Kernel bounds for disjoint cycles and disjoint paths
Top Cited Papers
- 1 August 2011
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (35), 4570-4578
- https://doi.org/10.1016/j.tcs.2011.04.039
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Infeasibility of instance compression and succinct PCPs for NPJournal of Computer and System Sciences, 2010
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapsesPublished by Association for Computing Machinery (ACM) ,2010
- Lower Bounds for Kernelizations and Other Preprocessing ProceduresTheory of Computing Systems, 2010
- On problems without polynomial kernelsJournal of Computer and System Sciences, 2009
- A Cubic Kernel for Feedback Vertex Set and Loop CutsetTheory of Computing Systems, 2009
- Approximation Algorithms for TreewidthAlgorithmica, 2008
- On treewidth approximationsDiscrete Applied Mathematics, 2004
- The Moore Bound for Irregular GraphsGraphs and Combinatorics, 2002
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995