Kernelization Lower Bounds by Cross-Composition von Bodlaender, Hans L., Jansen, Bart M. P., Kratsch, Stefan

Volltext

Treewidth: Characterizations, Applications, and Computations von Bodlaender, Hans L.

Volltext

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions von Dorn, Frederic, Penninkx, Eelko, Bodlaender, Hans L., Fomin, Fedor V.

Volltext

Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity von Bodlaender, Hans L., Ono, Hirotaka, Otachi, Yota

Volltext

A linear-time algorithm for finding tree-decompositions of small treewidth von BODLAENDER, H. L

Volltext

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth von Bodlaender, Hans L., Cygan, Marek, Kratsch, Stefan, Nederlof, Jesper

Volltext

Kernel bounds for disjoint cycles and disjoint paths von Bodlaender, Hans L., Thomassé, Stéphan, Yeo, Anders

Volltext

(Meta) Kernelization von Bodlaender, Hans L, Fomin, Fedor V, Lokshtanov, Daniel, Penninkx, Eelko, Saurabh, Saket, Thilikos, Dimitrios M

Volltext

Graph-Theoretic Concepts in Computer Science: 29th International Workshop, WG 2003, Elspeet, the Netherlands, June 19-21, 2003, Revised Papers von Bodlaender, Hans L

Volltext

A faster parameterized algorithm for Pseudoforest Deletion von Bodlaender, Hans L., Ono, Hirotaka, Otachi, Yota

Volltext

An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions von Kesselheim, Thomas, Radke, Klaus, Tönnis, Andreas, Vöcking, Berthold

Volltext

Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers von Bodlaender, Hans L, Woeginger, Gerhard J

Volltext

A Note on Exact Algorithms for Vertex Ordering Problems on Graphs von Bodlaender, Hans L., Fomin, Fedor V., Koster, Arie M. C. A., Kratsch, Dieter, Thilikos, Dimitrios M.

Volltext

Typical Sequences Revisited — Computing Width Parameters of Graphs von Bodlaender, Hans L., Jaffke, Lars, Telle, Jan Arne

Volltext

On the maximum weight minimal separator von Hanaka, Tesshu, Bodlaender, Hans L., van der Zanden, Tom C., Ono, Hirotaka

Volltext

Treewidth computations I. Upper bounds von Bodlaender, Hans L., Koster, Arie M.C.A.

Volltext

Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes von Saitoh, Toshiki, Yoshinaka, Ryo, Bodlaender, Hans L.

Volltext

Dynamic sampling from a discrete probability distribution with a known distribution of rates von D’Ambrosio, Federico, Bodlaender, Hans L., Barkema, Gerard T.

Volltext

Algorithms for graphs embeddable with few crossings per edge von GRIGORIEV, Alexander, BODLAENDER, Hans L

Volltext

Combinatorial Optimization on Graphs of Bounded Treewidth von Bodlaender, Hans L., Koster, Arie M. C. A.

Volltext