Cutting Up Is Hard To Do: The Parameterised Complexity of k-Cut and Related Problems
Open Access
- 30 April 2003
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 78, 209-222
- https://doi.org/10.1016/s1571-0661(04)81014-4
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Polynomial time approximation schemes for Euclidean TSP and other geometric problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Nearly linear time approximation schemes for Euclidean TSP and other geometric problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Graph Drawing in Motion IILecture Notes in Computer Science, 2002
- Parameterized Complexity: The Main Ideas and Some Research FrontiersLecture Notes in Computer Science, 2001
- Approximating the minimum bisection size (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- Vertex Cover: Further Observations and Further ImprovementsLecture Notes in Computer Science, 1999
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- 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
- The complexity of multiway cuts (extended abstract)Published by Association for Computing Machinery (ACM) ,1992