scientific article; zbMATH DE number 6469227
From MaRDI portal
zbMath1318.05077MaRDI QIDQ5501346
Erik D. Demaine, Mohammad Taghi Hajiaghayi
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering, Layered separators in minor-closed graph classes with applications, Beyond bidimensionality: parameterized subexponential algorithms on directed graphs, Structure of Graphs with Locally Restricted Crossings, Parameterized complexity of finding small degree-constrained subgraphs, Approximation algorithms via contraction decomposition, Minor-Closed Graph Classes with Bounded Layered Pathwidth, Guard games on graphs: keep the intruder out!, Orthogonal Tree Decompositions of Graphs, The degree-diameter problem for sparse graph classes, Frameworks for designing in-place graph algorithms, Linearity of grid minors in treewidth with applications through bidimensionality, Complexity of Grundy coloring and its variants, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs
