Journal of the ACM Bibliography
Michael R. Fellows and Michael A. Langston.
Nonconstructive tools for proving polynomial-time decidability.
Journal of the ACM, 35(3):727-739, July 1988.
[BibTeX entry]
Selected papers that cite this one
- Hans L. Bodlaender. A linear-time
algorithm for finding tree-decompositions of small treewidth.
SIAM Journal on Computing, 25(6):1305-1317, December 1996.
- Hans L. Bodlaender, Jan van Leeuwen, Richard Tan, and Dimitrios
Thilikos. On interval
routing schemes and treewidth. Information and
Computation, 139(1):92-109, 25 November 1997.
- J. A. Ellis, I. H. Sudborough, and J. S. Turner. The vertex separation and search
number of a graph. Information and Computation,
113(1):50-79, 15 August 1994.
- Arvind Gupta and Naomi Nishimura. The parallel complexity
of tree embedding problems. Journal of Algorithms,
18(1):176-200, January 1995.
- Ron van der Meyden. The complexity of
querying indefinite data about linearly ordered domains.
Journal of Computer and System Sciences, 54(1):113-135,
February 1997.
- Kenneth W. Regan. Diagonalization, uniformity, and
fixed-point theorems. Information and Computation,
98(1):1-40, May 1992.
Shortcuts: