(Meta) Kernelization

(Meta) Kernelization

1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor

article published in 2002

A 3-approximation for the pathwidth of Halin graphs

A 3-approximation for the pathwidth of Halin graphs

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

scholarly article by Hans L. Bodlaender et al published 21 January 2011 in Theory of Computing Systems

An $$O(\log \mathrm {OPT})$$ O ( log OPT ) -Approximation for Covering and Packing Minor Models of $$\theta _r$$ θ r

An annotated bibliography on guaranteed graph searching

Approximating Width Parameters of Hypergraphs with Excluded Minors

Approximation Algorithms for Domination Search

Bidimensional Parameters and Local Treewidth

Catalan structures and dynamic programming in H-minor-free graphs

Connected Graph Searching in Outerplanar Graphs

Connected graph searching

Contraction Bidimensionality: The Accurate Picture

Contraction obstructions for treewidth

Cutwidth I: A linear time fixed parameter algorithm

Cutwidth II: Algorithms for partial w-trees of bounded degree

D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy

scientific article published on 31 January 2012

Derivation of algorithms for cutwidth and related graph layout parameters

scholarly article by Hans L. Bodlaender et al published June 2009 in Journal of Computer and System Sciences

Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

Fast Minor Testing in Planar Graphs

Fast Minor Testing in Planar Graphs

Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus

Faster Parameterized Algorithms for Minor Containment

Faster parameterized algorithms for minor containment

Foreword: Special Issue on Theory and Applications of Graph Searching Problems

Forewords: Special issue on Theory and Applications of Graph Searching Problems

Forewords: Special issue on graph searching

Graphs with Branchwidth at Most Three

Irrelevant vertices for the planar Disjoint Paths Problem ⬇️

Isomorphism for graphs of bounded distance width

New upper bounds on the decomposability of planar graphs

On Graph Powers for Leaf-Labeled Trees

scientific article (publication date: 2002)

On exact algorithms for treewidth

On self duality of pathwidth in polyhedral graph embeddings

On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring

On the monotonicity of games generated by symmetric submodular functions

Planar Disjoint-Paths Completion ⬇️

Rank-width and tree-width of H -minor-free graphs

Strengthening Erdös-Pósa property for minor-closed graph classes

Subexponential parameterized algorithms

Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

scholarly article by Erik D. Demaine et al published 1 November 2005 in Journal of the ACM