On Problems without Polynomial Kernels (Extended Abstract)
- 1 January 2008
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A Cubic Kernel for Feedback Vertex SetPublished by Springer Nature ,2007
- The Undirected Feedback Vertex Set Problem Has a Poly(k) KernelLecture Notes in Computer Science, 2006
- A Faster FPT Algorithm for Finding Spanning Trees with Many LeavesLecture Notes in Computer Science, 2003
- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar CaseLecture Notes in Computer Science, 2002
- Subexponential Parameterized Algorithms Collapse the W-HierarchyLecture Notes in Computer Science, 2001
- Parameterized ComplexityPublished by Springer Nature ,1999
- Advice classes of parameterized tractabilityAnnals of Pure and Applied Logic, 1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Color-codingJournal of the ACM, 1995
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985