Publication:3113683
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2011.189zbMath1230.68107arXiv1010.1365MaRDI QIDQ3113683
Neeldhara Misra, Fedor V. Fomin, Daniel Lokshtanov, Geevarghese Philip, Saket Saurabh
Publication date: 23 January 2012
Full work available at URL: https://arxiv.org/abs/1010.1365
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel, Unnamed Item, Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations., Linear-vertex kernel for the problem of packing \(r\)-stars into a graph without long induced paths, On a generalization of Nemhauser and Trotter's local optimization theorem, Kernelization using structural parameters on sparse graph classes, Parameterized complexity of vertex deletion into perfect graph classes, Confronting intractability via parameters, On parameterized independent feedback vertex set, A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem, On sparsification for computing treewidth, Linear kernels for separating a graph into components of bounded size, On the hardness of losing width, Satisfying more than half of a system of linear equations over GF(2): a multivariate approach, On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal, On the Hardness of Losing Width, Kernelization – Preprocessing with a Guarantee, Graph Minors and Parameterized Algorithm Design, Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel, Parameterized Complexity of Vertex Deletion into Perfect Graph Classes, Bivariate Complexity Analysis of Almost Forest Deletion, Uniform Kernelization Complexity of Hitting Forbidden Minors
