default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID60th Birthday: Hans L. Bodlaender 2020
- Fedor V. Fomin
, Stefan Kratsch, Erik Jan van Leeuwen:
Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 12160, Springer 2020, ISBN 978-3-030-42070-3
Short Contributions
- Stefan Arnborg, Andrzej Proskurowski:
Seeing Arboretum for the (partial k-) Trees. 3-6 - Michael R. Fellows, Frances A. Rosamond:
Collaborating with Hans: Some Remaining Wonderments. 7-17 - Danny Hermelin:
Hans Bodlaender and the Theory of Kernelization Lower Bounds. 18-21 - Jan van Leeuwen:
Algorithms, Complexity, and Hans. 22-27
Surveys
- Mark de Berg, Sándor Kisfaludi-Bak:
Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. 31-48 - Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche:
As Time Goes By: Reflections on Treewidth for Temporal Graphs. 49-77 - Alexander Grigoriev:
Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs. 78-88 - Bart M. P. Jansen:
Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds. 89-111 - Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. 112-128 - Dániel Marx:
Four Shorts Stories on Surprising Algorithmic Uses of Treewidth. 129-144 - Jesper Nederlof:
Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. 145-164 - Yota Otachi:
A Survey on Spanning Tree Congestion. 165-172 - Marcin Pilipczuk:
Surprising Applications of Treewidth Bounds for Planar Graphs. 173-188 - Michal Pilipczuk:
Computing Tree Decompositions. 189-213 - Hisao Tamaki:
Experimental Analysis of Treewidth. 214-221 - Dimitrios M. Thilikos:
A Retrospective on (Meta) Kernelization. 222-246 - Tom C. van der Zanden:
Games, Puzzles and Treewidth. 247-261 - Johan M. M. van Rooij:
Fast Algorithms for Join Operations on Tree Decompositions. 262-297
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-07 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
