Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.05354OpenAlexW2501059503MaRDI QIDQ5475822

Eelko Penninkx, Frederic Dorn, Fedor V. Fomin, Hans L. Bodlaender

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (23)

On the minimum corridor connection problem and other generalized geometric problems ⋮ Unnamed Item ⋮ Improved bounds on the planar branchwidth with respect to the largest grid minor size ⋮ A Linear Kernel for Planar Feedback Vertex Set ⋮ How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms ⋮ An exact algorithm for connected red-blue dominating set ⋮ Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions ⋮ Subexponential parameterized algorithms ⋮ Digraph measures: Kelly decompositions, games, and orderings ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ Computing branchwidth via efficient triangulations and blocks ⋮ Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm ⋮ Minimum dominating set of queens: a trivial programming exercise? ⋮ Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms ⋮ Dynamic programming and planarity: improved tree-decomposition based algorithms ⋮ Complexity and approximation of the constrained forest problem ⋮ Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs ⋮ Milling a Graph with Turn Costs: A Parameterized Complexity Perspective ⋮ A Local Search Algorithm for Branchwidth ⋮ Finding Paths in Grids with Forbidden Transitions ⋮ Planar k-Path in Subexponential Time and Polynomial Space ⋮ Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs ⋮ Computational study on planar dominating set problem

This page was built for publication: Algorithms – ESA 2005