New Directions and New Challenges in Algorithm Design and Complexity, Parameterized
- 1 January 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 505-519
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Polynomial time approximation schemes for Euclidean TSP and other geometric problems2002
- Nearly linear time approximation schemes for Euclidean TSP and other geometric problems2002
- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar CaseLecture Notes in Computer Science, 2002
- Vertex Cover: Further Observations and Further ImprovementsJournal of Algorithms, 2001
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)1999
- Complexity and Approximation1999
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- Color-codingJournal of the ACM, 1995
- On Linear Time Minor Tests with Depth-First SearchJournal of Algorithms, 1993