Kernelization: New Upper and Lower Bound Techniques
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 17-37
Abstract
No abstract availableKeywords
This publication has 65 references indexed in Scilit:
- Exact Algorithms for Cluster Editing: Evaluation and ExperimentsAlgorithmica, 2009
- Data reduction and exact algorithms for clique coverACM Journal of Experimental Algorithmics, 2009
- The Bidimensionality Theory and Its Algorithmic ApplicationsThe Computer Journal, 2007
- Strong computational lower bounds via parameterized complexityJournal of Computer and System Sciences, 2006
- Experiments on data reduction for optimal domination in networksAnnals of Operations Research, 2006
- On the existence of subexponential parameterized algorithmsJournal of Computer and System Sciences, 2003
- On Fixed-Parameter Tractability and Approximability of NP Optimization ProblemsJournal of Computer and System Sciences, 1997
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- An algebraic theory of graph reductionJournal of the ACM, 1993
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph familiesAlgorithmica, 1992