scientific article; zbMATH DE number 6744934
From MaRDI portal
DOI10.4230/LIPIcs.FSTTCS.2015.420zbMath1366.68368arXiv1504.08120MaRDI QIDQ5275384
Publication date: 13 July 2017
Full work available at URL: https://arxiv.org/abs/1504.08120
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items
Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}, Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs, On subgraph complementation to \(H\)-free graphs, FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters, Turing kernelization for finding long paths in graph classes excluding a topological minor, Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization, Turing kernelization for finding long paths and cycles in restricted graph classes, Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor, On subgraph complementation to \(H\)-free Graphs
