Parameterized Complexity: The Main Ideas and Some Research Frontiers

Authors:
Michael R. Fellows
Affiliations:
School of Electrical Engineering and Computer Science, University of Newcastle University Drive, Callaghan, Australia 2308
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2009

Citing 0
Cited 7

Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Automating the runtime performance evaluation of simulation algorithms

Winter Simulation Conference
Kernels for the vertex cover problem on the preferred attachment model

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Book review: Invitation to fixed-parameter algorithms

Computer Science Review
FPT suspects and tough customers: open problems of downey and fellows

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purposes of this paper are two:(1)To give an exposition of the main ideas of parameterized complexity,and (2)To discuss some of the current research frontiers and directions.