scientific article
From MaRDI portal
Publication:2921728
zbMath1297.05227MaRDI QIDQ2921728
Erik D. Demaine, Mohammad Taghi Hajiaghayi
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Unnamed Item ⋮ Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds ⋮ Faster parameterized algorithms for minor containment ⋮ Treewidth lower bounds with brambles ⋮ Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs ⋮ Linearity of grid minors in treewidth with applications through bidimensionality ⋮ Parameterized complexity of the spanning tree congestion problem ⋮ Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time ⋮ Contraction obstructions for treewidth ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ Bidimensionality and Kernels ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction ⋮ Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
This page was built for publication:
