Vertex cover, dominating set and my encounters with parameterized complexity and mike fellows

Authors:
Venkatesh Raman
Affiliations:
The Institute of Mathematical Sciences, Chennai, India
Venue:
The Multivariate Algorithmic Revolution and Beyond
Year:
2012

Citing 9
Cited 0

On finding a minimum dominating set in a tournament (Note)

Theoretical Computer Science
Sorting, minimal feedback sets, and Hamilton paths in tournaments

SIAM Journal on Discrete Mathematics
On limited nondeterminism and the complexity of the V-C dimension

Journal of Computer and System Sciences
An improved fixed-parameter algorithm for vertex cover

Information Processing Letters
Parameterizing above guaranteed values: MaxSat and MaxCut

Journal of Algorithms
Parameterized complexity of finding subgraphs with hereditary properties

Theoretical Computer Science
On the existence of subexponential parameterized algorithms

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles

Algorithmica - Parameterized and Exact Algorithms
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this report, I start with a historic view of how, the two problems Vertex Cover and Dominating Set that were influential to the birth of the area of parameterized complexity, also led me to this area and introduced me to Mike Fellows. I also discuss early research and meetings in Parameterized Complexity, Mike's influence in community building and some personal anecdotes with Mike. I conclude with some recent results on these two problems and also discuss open problems in the area.