On problems without polynomial kernels
Authors:
- Hans L. BodlaenderHBHans L. Bodlaender
- Rodney G. DowneyRDRodney G. Downey
- Michael R. FellowsMFMichael R. Fellows
- Danny HermelinDHDanny Hermelin
Top Cited Papers
- 1 December 2009
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (8) , 423-434
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Invitation to data reduction and problem kernelizationACM SIGACT News, 2007
- Fixed‐parameter tractability and data reduction for multicut in treesNetworks, 2005
- Polynomial-time data reduction for dominating setJournal of the ACM, 2004
- An efficient fixed-parameter algorithm for 3-Hitting SetJournal of Discrete Algorithms, 2003
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Computation Models for Parameterized ComplexityMathematical Logic Quarterly, 1997
- Color-codingJournal of the ACM, 1995
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975