Algorithmic Meta-theorems for Restrictions of Treewidth

DOI10.1007/978-3-642-15775-2_47zbMath1287.68078OpenAlexW1519337743MaRDI QIDQ3586492

Michael Lampis

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_47

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Iterated Type Partitions ⋮ Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics ⋮ Parameterized maximum path coloring ⋮ Complexity of conflict-free colorings of graphs ⋮ Many Visits TSP Revisited ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications ⋮ Many-visits TSP revisited ⋮ Parameterized Compilation Lower Bounds for Restricted CNF-Formulas

This page was built for publication: Algorithmic Meta-theorems for Restrictions of Treewidth