Kernels: Annotated, Proper and Induced
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 264-275
- https://doi.org/10.1007/11847250_24
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Fixed-Parameter Tractability Results for Feedback Set Problems in TournamentsLecture Notes in Computer Science, 2006
- nonblocker: Parameterized Algorithmics for minimum dominating setLecture Notes in Computer Science, 2006
- A General Data Reduction Scheme for Domination in GraphsLecture Notes in Computer Science, 2006
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel SizeLecture Notes in Computer Science, 2005
- Two-Layer Planarization: Improving on Parameterized AlgorithmicsJournal of Graph Algorithms and Applications, 2005
- Fixed Parameter Algorithms for one-sided crossing minimization RevisitedLecture Notes in Computer Science, 2004
- A Direct Algorithm for the Parameterized Face Cover ProblemPublished by Springer Nature ,2004
- Parameterized complexity: A framework for systematically confronting computational intractabilityPublished by American Mathematical Society (AMS) ,1999
- Parameterized ComplexityPublished by Springer Nature ,1999