The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
From MaRDI portal
Publication:2908532
DOI10.1007/978-3-642-30891-8_5zbMath1358.68147OpenAlexW194279835MaRDI QIDQ2908532
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_5
Cites Work
- An improved fixed-parameter algorithm for vertex cover
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Parameterizing above or below guaranteed values
- Nonconstructive advances in polynomial-time complexity
- Fast, frugal, and fit: simple heuristics for paired comparison
- On limited nondeterminism and the complexity of the V-C dimension
- Solving large FPT problems on coarse-grained parallel machines
- Sources of complexity in subset choice
- Reflections on Multivariate Algorithmics and Problem Parameterization
- Algorithm Engineering for Optimal Graph Bipartization
- Nondeterminism within $P^ * $
- Analogs & duals of the MAST problem for sequences & trees
- Multivariate Complexity Theory
- Improved Parameterized Upper Bounds for Vertex Cover
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
