The following pages link to Hans L. Bodlaender (Q242851):
Displaying 50 items.
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- Google Scholar makes it hard -- the complexity of organizing one's publications (Q495683) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315) (← links)
- The complexity of finding uniform emulations on fixed graphs (Q1110329) (← links)
- The distributed bit complexity of the ring: From the anonymous to the non-anonymous case (Q1314268) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- Finding a \(\Delta\)-regular supergraph of minimum order (Q1408809) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions (Q1957653) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) (Q2817636) (← links)
- On exact algorithms for treewidth (Q2933641) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- Exact Algorithms for Intervalizing Colored Graphs (Q2999332) (← links)
- Complexity Results for the Spanning Tree Congestion Problem (Q3057608) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- Exact Algorithms for Kayles (Q3104765) (← links)
- Approximation of pathwidth of outerplanar graphs (Q3150282) (← links)
- A Kernel for Convex Recoloring of Weighted Forests (Q3401093) (← links)
- Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (Q3452781) (← links)
- Exact Algorithms for Edge Domination (Q3503591) (← links)
- Faster Parameterized Algorithms for Minimum Fill-In (Q3596726) (← links)
- A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs (Q3596728) (← links)
- Kernel Bounds for Disjoint Cycles and Disjoint Paths (Q3639278) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)
- Simulation of large networks on smaller networks (Q3763599) (← links)
- Graphs with Branchwidth at Most Three (Q4264493) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q5056146) (← links)
- A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (Q5230321) (← links)
- A linear time algorithm for finding tree-decompositions of small treewidth (Q5248490) (← links)
- FINDING SMALL EQUIVALENT DECISION TREES IS HARD (Q5249043) (← links)
- Improved Lower Bounds for Graph Embedding Problems (Q5283358) (← links)
- The Valve Location Problem in Simple Network Topologies (Q5302043) (← links)
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (Q5326561) (← links)
- A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth (Q5434404) (← links)
- Cutwidth I: A linear time fixed parameter algorithm (Q5462383) (← links)
- Cutwidth II: Algorithms for partial w-trees of bounded degree (Q5462384) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
