scientific article
From MaRDI portal
Publication:3113682
DOI10.4230/LIPIcs.STACS.2011.177zbMath1230.68092arXiv1012.4701MaRDI QIDQ3113682
Bart M. P. Jansen, Hans L. Bodlaender
Publication date: 23 January 2012
Full work available at URL: https://arxiv.org/abs/1012.4701
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal ⋮ On the Hardness of Losing Width ⋮ Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel ⋮ Kernelization – Preprocessing with a Guarantee ⋮ Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter ⋮ Preprocessing subgraph and minor problems: when does a small vertex cover help? ⋮ Two-layer planarization parameterized by feedback edge set ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ On the hardness of losing width ⋮ Confronting intractability via parameters ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? ⋮ How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs
This page was built for publication:
