The following pages link to Hans L. Bodlaender (Q242851):
Displayed 50 items.
- Fill-in and operations of graphs (Q1902273) (← links)
- The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\) (Q1916130) (← links)
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
- Trees associated with the Motzkin numbers (Q1924243) (← 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)
- On path-sequential labellings of cycles (Q1974517) (← links)
- Steiner trees for hereditary graph classes (Q2081657) (← links)
- Knot diagrams of treewidth two (Q2110609) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Dynamic sampling from a discrete probability distribution with a known distribution of rates (Q2155015) (← links)
- On the exact complexity of polyomino packing (Q2196557) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- Clustering with partial information (Q2268879) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- Parameterized complexity of conflict-free graph coloring (Q2285090) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Partition into triangles on bounded degree graphs (Q2392247) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- The homogeneous broadcast problem in narrow and wide strips (Q2405290) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds (Q2415370) (← links)
- Scheduling of pipelined operator graphs (Q2434287) (← links)
- Algorithms for graphs embeddable with few crossings per edge (Q2461632) (← links)
- Faster algorithms for Frobenius numbers (Q2571269) (← links)
- Lower bound for the size of maximal nontraceable graphs (Q2571275) (← links)
- A linear programming formulation of Mader's edge-disjoint paths problem (Q2581506) (← links)
- Some lower bound results for decentralized extrema-finding in rings of processors (Q2640343) (← links)
- Steiner trees for hereditary graph classes: a treewidth perspective (Q2663041) (← links)
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- (Q2721971) (← links)
- (Q2741323) (← links)
- Robust Recoverable Path Using Backup Nodes (Q2794347) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- (Q2816028) (← links)
- (Q2816059) (← links)
- Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) (Q2817636) (← links)
- Fixed-Parameter Tractability and Characterizations of Small Special Treewidth (Q2864293) (← links)
- The Fine Details of Fast Dynamic Programming over Tree Decompositions (Q2867071) (← links)
- Speeding Up Dynamic Programming with Representative Sets (Q2867093) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- The Valve Location Problem in Simple Network Topologies (Q2899077) (← links)
- Kernel Bounds for Structural Parameterizations of Pathwidth (Q2904570) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- (Q2921699) (← links)
- On exact algorithms for treewidth (Q2933641) (← links)