Algorithmic Meta-theorems for Restrictions of Treewidth
From MaRDI portal
Publication:3586492
DOI10.1007/978-3-642-15775-2_47zbMath1287.68078OpenAlexW1519337743MaRDI QIDQ3586492
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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
