Fixed-parameter intractability

Publisher Website

2 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 36-49
https://doi.org/10.1109/sct.1992.215379

Abstract

No abstract available

Keywords

This publication has 10 references indexed in Scilit:

Nondeterminism within P
Published by Springer Nature ,2005
Finitary substructure languages with application to the theory of NP-completeness
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing, 1995
On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
SIAM Journal on Discrete Mathematics, 1992
On search decision and the efficiency of polynomial-time algorithms
Published by Association for Computing Machinery (ACM) ,1989
On the complexity of fixed parameter problems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
On the Complexity of Covering Vertices by Faces in a Planar Graph
SIAM Journal on Computing, 1988
Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
Journal of Algorithms, 1984
Isomorphism of graphs of bounded valence can be tested in polynomial time
Journal of Computer and System Sciences, 1982