On the existence of subexponential parameterized algorithms
- 31 December 2003
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 67 (4), 789-807
- https://doi.org/10.1016/s0022-0000(03)00074-6
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- Faster exact algorithms for hard problems: A parameterized point of viewDiscrete Mathematics, 2001
- A general method to speed up fixed-parameter-tractable algorithmsInformation Processing Letters, 2000
- An improved fixed-parameter algorithm for vertex coverInformation Processing Letters, 1998
- On Fixed-Parameter Tractability and Approximability of NP Optimization ProblemsJournal of Computer and System Sciences, 1997
- On the Structure of Parameterized Problems in NPInformation and Computation, 1995
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995
- Nondeterminism within $P^ * $SIAM Journal on Computing, 1993
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976