Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
DOI10.1007/978-3-642-30891-8_6zbMATH Open1358.68146OpenAlexW113281379MaRDI QIDQ2908533FDOQ2908533
Authors: Venkatesh Raman 
Publication date: 5 September 2012
Published in: The Multivariate Algorithmic Revolution and Beyond (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-30891-8_6
Recommendations
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) History of computer science (68-03)
Cites Work
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Title not available (Why is that?)
- On the existence of subexponential parameterized algorithms
- On limited nondeterminism and the complexity of the V-C dimension
- An improved fixed-parameter algorithm for vertex cover
- A Constructive Solution to a Tournament Problem
- Parameterized complexity of finding subgraphs with hereditary properties.
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- On finding a minimum dominating set in a tournament
- The complexity of irredundant sets parameterized by size
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
Cited In (2)
This page was built for publication: Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908533)
