Some new directions and questions in parameterized complexity

Authors:
Rodney G. Downey;Catherine McCartin
Affiliations:
Victoria University, Wellington, New Zealand;Massey University, Palmerston North, New Zealand
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 21
Cited 0

The linearity of first-fit coloring of interval graphs

SIAM Journal on Discrete Mathematics
Coloring interval graphs with First-Fit

Discrete Mathematics
Towards a syntactic characterization of PTAS

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On fixed-parameter tractability and approximability of NP optimization problems

Journal of Computer and System Sciences - special issue on complexity theory
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The maximum subforest problem: approximation and exact algorithms

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Vertex cover: further observations and further improvements

Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of First-Order and Monadic Second-Order Logic Revisited

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Parameterized complexity: the main ideas and connections to practical computing

Experimental algorithmics
Polynomial time approximation schemes for Euclidean TSP and other geometric problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Resolution is Not Automatizable Unless W[P] is Tractable

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On the existence of subexponential parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Proof verification and hardness of approximation problems

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Bounded fixed-parameter tractability and log2n nondeterministic bits

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently there have been some new initiatives in the field of parameterized complexity. In this paper, we will report on some of these, concentrating on some open questions, and also looking at some current investigations aimed towards applying ideas of parameterized complexity in the field of online model theory.