Parameterized complexity of finding subgraphs with hereditary properties
Top Cited Papers
- 6 January 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 289 (2), 997-1008
- https://doi.org/10.1016/s0304-3975(01)00414-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the parametric complexity of schedules to minimize tardy tasksTheoretical Computer Science, 2003
- Perfect Code is W[1]-completeInformation Processing Letters, 2002
- The complexity of irredundant sets parameterized by sizeDiscrete Applied Mathematics, 2000
- Parameterizing above Guaranteed Values: MaxSat and MaxCutJournal of Algorithms, 1999
- Complexity Classification of Some Edge Modification ProblemsLecture Notes in Computer Science, 1999
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- 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
- Edge-Deletion ProblemsSIAM Journal on Computing, 1981
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980