Hans Bodlaender is a Full Professor and Chair of Network Algorithms in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e). His area’s of expertise include computer systems, architectures, networks, artificial intelligence, expert systems, operations research, software, algorithms, control systems and theoretical computer science. Hans’ work focuses on the study of algorithms and the complexity of computational problems, in particular for problems on graphs and networks. Important themes are: Fixed parameter tractability and complexity Kernelization (mathematical analysis of preprocessing) Exact algorithms Treewidth and other width notions on graphs Dynamic programming
Hans Bodlaender studied Mathematics at Utrecht University from 1978 till 1983. In 1986, he obtained his PhD with a thesis titled: ‘Distributed Computing - Structure and Complexity’. In 1987, he was postdoc at M.I.T. and later that year returned as Associate Professor at Utrecht University. In June 2003, he became associate professor (UHD) in Utrecht, where he is currently still working in addition to his position at TU/e. He has received five NWO grants, as well as grants from the EU and Japanese government. Hans has been a Chairman, Program Committee Member and speaker at a large number of international symposia and workshops, including STACS, WG, SIROCCO, CIAC, CIRM, ISAAC, WG, WADS, ECSQARU, ALGO and IWPEC. He has been a reviewer for Zentralblatt für Mathematik and Mathematical Reviews and Scientific Organizer of WORKER 2010: Workshop on Kernelization, Lorentz Center Leiden, and Dagstuhl Seminar Graph modification problems, 2014.
Parameterized complexity of conflict-free graph coloring16th International Symposium on Algorithms and Data Structures, WADS 2019 (2019)
The homogeneous broadcast problem in narrow and wide strips IAlgorithmica (2019)
The homogeneous broadcast problem in narrow and wide strips IIAlgorithmica (2019)
Subgraph isomorphism on graph classes that exclude a substructure11th International Conference on Algorithms and Complexity, CIAC 2019 (2019)
On exploring always-connected temporal graphs of small pathwidthInformation Processing Letters (2019)
No ancillary activities