Hans L. Bodlaender
Universiteit Utrecht
H-index: 69
Europe-Netherlands
Top articles of Hans L. Bodlaender
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
XNLP-hardness of Parameterized Problems on Planar Graphs | arXiv preprint arXiv:2402.03087 | Hans L Bodlaender Krisztina Szilágyi | 2024/2/5 |
Typical Sequences Revisited—Computing Width Parameters of Graphs | Theory of Computing Systems | Hans L Bodlaender Lars Jaffke Jan Arne Telle | 2023/2 |
The Parameterised Complexity Of Integer Multicommodity Flow | 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) | Isja Mannens Jelle Oostveen Erik Jan van Leeuwen Sukanya Pandey Hans L Bodlaender | 2023/12/13 |
Treewidth is NP-complete on cubic graphs (and related results) | arXiv preprint arXiv:2301.10031 | Hans L Bodlaender Édouard Bonnet Lars Jaffke Dušan Knop Paloma T Lima | 2023/1/24 |
Treewidth is NP-Complete on Cubic Graphs | S Ordyniak H Bodlaender É Bonnet Dušan Knop M Milanic | 2023/8/5 | |
An ETH-Tight Exact Algorithm for Euclidean TSP | SIAM Journal on Computing | Mark de Berg Hans L Bodlaender Sándor Kisfaludi-Bak Sudeshna Kolay | 2023/6/30 |
Complexity framework for forbidden subgraphs IV: The Steiner Forest problem | arXiv preprint arXiv:2305.01613 | Hans L Bodlaender Matthew Johnson Barnaby Martin Jelle J Oostveen Sukanya Pandey | 2023/5/2 |
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs | Operational Research | Tom C van der Zanden Hans L Bodlaender Herbert JM Hamers | 2023/3 |
Problems hard for treewidth but easy for stable gonality | Hans L Bodlaender Gunther Cornelissen Marieke van der Wegen | 2022/6/22 | |
Parameterized complexity of binary csp: Vertex cover, treedepth, and related parameters | arXiv preprint arXiv:2208.12543 | Hans L Bodlaender Carla Groenland Michał Pilipczuk | 2022/8/26 |
List colouring trees in logarithmic space | arXiv preprint arXiv:2206.09750 | Hans L Bodlaender Carla Groenland Hugo Jacob | 2022/6/20 |
Parameterized Complexity Results for Bayesian Inference | arXiv preprint arXiv:2206.07172 | Hans Bodlaender Nils Donselaar Johan Kwisthout | 2022/6/14 |
Dynamic sampling from a discrete probability distribution with a known distribution of rates | Computational Statistics | Federico D’Ambrosio Hans L Bodlaender Gerard T Barkema | 2022/7 |
On the parameterized complexity of computing tree-partitions | arXiv preprint arXiv:2206.11832 | Hans L Bodlaender Carla Groenland Hugo Jacob | 2022/6/23 |
From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability | Hans L Bodlaender | 2022/3/16 | |
Parameterized problems complete for nondeterministic FPT time and logarithmic space | Hans L Bodlaender Carla Groenland Jesper Nederlof Céline MF Swennenhuis | 2022/2/7 | |
On the complexity of problems on tree-structured graphs | arXiv preprint arXiv:2206.11828 | Hans L Bodlaender Carla Groenland Hugo Jacob Marcin Pilipczuk Michał Pilipczuk | 2022/6/23 |
XNLP-completeness for parameterized problems on graphs with a linear structure | arXiv preprint arXiv:2201.13119 | Hans L Bodlaender Carla Groenland Hugo Jacob Lars Jaffke Paloma T Lima | 2022/1/31 |
Parameterized Completeness Results for Bayesian Inference | Hans L Bodlaender Nils Donselaar Johan Kwisthout | 2022/9/19 | |
Parameterized complexity of conflict-free graph coloring | SIAM Journal on Discrete Mathematics | Hans L Bodlaender Sudeshna Kolay Astrid Pieterse | 2021 |
Co-Authors
