Parameterized Complexity: The Main Ideas and Some Research Frontiers
- 4 December 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 291-307
- https://doi.org/10.1007/3-540-45678-3_26
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Parameterized Complexity: Exponential Speed-Up for Planar Graph ProblemsLecture Notes in Computer Science, 2001
- The parameterized complexity of database queriesPublished by Association for Computing Machinery (ACM) ,2001
- Generalized Model-Checking Problems for First-Order LogicLecture Notes in Computer Science, 2001
- Faster exact algorithms for hard problems: A parameterized point of viewDiscrete Mathematics, 2001
- Parameterized Complexity of Finding Subgraphs with Hereditary PropertiesLecture Notes in Computer Science, 2000
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- Vertex Cover: Further Observations and Further ImprovementsLecture Notes in Computer Science, 1999
- On the efficiency of polynomial time approximation schemesInformation Processing Letters, 1997
- A linear-time algorithm for computing the intersection of all odd cycles in a graphDiscrete Applied Mathematics, 1997
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995