Hans L. Bodlaender
I work four days per week at the Department of Computer Science, Utrecht University,
as head of the Algorithms and Complexity group, and one day per week (Monday) at
the Department of Mathematics and Computer Science, Eindhoven University of Technology,
in the group of Mark de Berg.
My webpage at the TU Eindhoven.
Foto by Ivar Pel.
technical reports at Utrecht University. Other reports can be found
- My CV. (Version November 2014. PDF-file.)
- TreewidthLIB: a benchmark for treewidth algorithms.
A collection of graphs and some results on/for experiments for computing the
treewidth of graphs. Website is down; a replacement is in beta-stage.
- Algorithmic Systems.
- Steiner Tree. Java code for the Steiner Tree problem on Tree decompositions, using Representative Sets.
- BZ Treewidth. Program to compute treewidth.
(2nd place PACE, 2016.) By Tom van der Zanden (and me).
- GPGPU Treewidth. Parallel program to compute
treewidth. (Paper IPEC 2017. By Tom van der Zanden (and me).)
My main area of research is algorithms, in particular, algorithms for problems on
graphs and networks and other combinatorial problems. Important themes are:
- Fixed parameter tractability and complexity
- Kernelization (mathematical analysis of preprocessing)
- Exact algorithms
- Treewidth and other width notions on graphs
- Dynamic programming
My hobbies include: origami, chess, chess variants, long distance hiking,
running, board games.
In the past, I made a few webpages on hobbies of me. These are now
often outdated (and sometimes not, but maintained by other people).
Other hobbies are long distance hiking, running, chess,
- Origami. Old webpages on origami. Include some of web's earliest
explanations for four basic models.
- Chess variants.
A link to a website that I started many years ago, but now is maintained by
Website on stories of Wipperoen, from 1970's Dutch newspaper comics.
Ancient: Texts or programs I wrote long ago