Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
- 4 July 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 261-272
- https://doi.org/10.1007/3-540-48224-5_22
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Fixed Parameter Algorithms for Planar Dominating Set and Related ProblemsLecture Notes in Computer Science, 2000
- Parameterized ComplexityPublished by Springer Nature ,1999
- Vertex Cover: Further Observations and Further ImprovementsLecture Notes in Computer Science, 1999
- Upper Bounds for Vertex Cover Further ImprovedLecture Notes in Computer Science, 1999
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Reduced constants for simple cycle graph separationActa Informatica, 1997
- Treewidth: Algorithmic techniques and resultsPublished by Springer Nature ,1997
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- TreewidthPublished by Springer Nature ,1994
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980