Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Cutting Up Is Hard To Do: The Parameterised Complexity of k-Cut and Related ProblemsElectronic Notes in Theoretical Computer Science, 2003
- Polynomial time approximation schemes for Euclidean TSP and other geometric problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Nearly linear time approximation schemes for Euclidean TSP and other geometric problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar CaseLecture Notes in Computer Science, 2002
- Improved Tree Decomposition Based Algorithms for Domination-like ProblemsLecture Notes in Computer Science, 2002
- Refined Search Tree Technique for Dominating Set on Planar GraphsLecture Notes in Computer Science, 2001
- On the efficiency of polynomial time approximation schemesInformation Processing Letters, 1997
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- On Linear Time Minor Tests with Depth-First SearchJournal of Algorithms, 1993