Parameterized complexity for the skeptic
- 24 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 94 references indexed in Scilit:
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On the Complexity of Database QueriesJournal of Computer and System Sciences, 1999
- On Fixed-Parameter Tractability and Approximability of NP Optimization ProblemsJournal of Computer and System Sciences, 1997
- A linear-time algorithm for computing the intersection of all odd cycles in a graphDiscrete Applied Mathematics, 1997
- Coloring interval graphs with first-fitDiscrete Mathematics, 1995
- W[2]-hardness of precedence constrained K-processor schedulingOperations Research Letters, 1995
- The parameterized complexity of sequence alignment and consensusTheoretical Computer Science, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Coloring inductive graphs on-lineAlgorithmica, 1994
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987