Subexponential parameterized algorithms for graphs of polynomial growth
From MaRDI portal
Publication:5111748
DOI10.4230/LIPIcs.ESA.2017.59zbMath1442.68178arXiv1610.07778OpenAlexW2963153697MaRDI QIDQ5111748
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1610.07778
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
Surprising Applications of Treewidth Bounds for Planar Graphs ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Subexponential parameterized algorithms
- Linearity of grid minors in treewidth with applications through bidimensionality
- Low diameter graph decompositions
- Which problems have strongly exponential complexity?
- Subexponential algorithms for partial cover problems
- Probabilistic quorums for dynamic systems
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ Time
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
- Fast Sub-exponential Algorithms and Compactness in Planar Graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- The limited blessing of low dimensionality
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
- A subexponential parameterized algorithm for Subset TSP on planar graphs
- Routing with Improved Communication-Space Trade-Off
- Parameterized Algorithms
- Graph Drawing
- Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering
- LATIN 2004: Theoretical Informatics
This page was built for publication: Subexponential parameterized algorithms for graphs of polynomial growth
