scientific article; zbMATH DE number 7204413
From MaRDI portal
Publication:5111296
DOI10.4230/LIPIcs.MFCS.2017.79zbMath1441.68194arXiv1705.06796MaRDI QIDQ5111296
Michael P. O'Brien, Felix Reidl, Irene Muzi, Blair D. Sullivan
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1705.06796
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Density (toughness, etc.) (05C42) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
Structural parameterization for minimum conflict-free colouring ⋮ Characterising graphs with no subdivision of a wheel of bounded diameter
Cites Work
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Subexponential parameterized algorithms
- Strong computational lower bounds via parameterized complexity
- Kernelization Using Structural Parameters on Sparse Graph Classes
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Easy problems for tree-decomposable graphs
- Minimum-weight triangulation is NP-hard
- Kernelization and Sparseness: the case of Dominating Set
- Deciding First-Order Properties of Nowhere Dense Graphs
- A Fast Parametric Maximum Flow Algorithm and Applications
- Contraction and Treewidth Lower Bounds
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
- The complexity of satisfiability problems
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
This page was built for publication:
