If you made any changes in Pure these will be visible here soon.

Personal profile

Research profile

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

Academic background

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.

External positions

Utrecht University

Fingerprint Fingerprint is based on mining the text of the person's scientific documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 1 Similar Profiles
Treewidth Mathematics
Graph in graph theory Mathematics
Polynomials Engineering & Materials Science
Kernelization Mathematics
Decomposition Engineering & Materials Science
Dynamic programming Engineering & Materials Science
Tree Decomposition Mathematics
Lower bound Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 1988 2019

ETH-tight algorithms for geometric network problems

Kisfaludi-Bak, S., 27 Jun 2019, Eindhoven: Technische Universiteit Eindhoven. 196 p.

Research output: ThesisPhd Thesis 1 (Research TU/e / Graduation TU/e)Academic

Open Access
File

On exploring always-connected temporal graphs of small pathwidth

Bodlaender, H. L. & van der Zanden, T. C., 1 Feb 2019, In : Information Processing Letters. 142, p. 68-71 4 p.

Research output: Contribution to journalArticleAcademicpeer-review

Pathwidth
Computational complexity
Graph in graph theory
NP-complete problem

Stable divisorial gonality is in NP

Bodlaender, H. L., van der Wegen, M. & van der Zanden, T. C., 11 Jan 2019, SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Královič, R., Nawrocki, J., Pighizzini, G. & Catania, B. (eds.). Cham: Springer, p. 81-93 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11376 LNCS)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Gonality
Linear programming
Polynomials
Geometry
Subdivision

Subgraph isomorphism on graph classes that exclude a substructure

Bodlaender, H. L., Hanaka, T., Okamoto, Y., Otachi, Y. & van der Zanden, T. C., 6 Apr 2019, Algorithms and Complexity - 11th International Conference, CIAC 2019, Proceedings. Heggernes, P. (ed.). Cham: Springer, p. 87-98 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11485 LNCS)

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Forbidden Minor
Graph Classes
Substructure
Byproducts
Subgraph

The homogeneous broadcast problem in narrow and wide strips I: algorithms

de Berg, M., Bodlaender, H. L. & Kisfaludi-Bak, S., Jul 2019, In : Algorithmica. 81, 7, p. 2934-2962 29 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Broadcast
Strip
Wireless networks
Hardness
Polynomials

Prizes

CIAC 2017 Best Paper Award

Hans Bodlaender (Recipient) & Tom C. van der Zanden (Recipient), 24 May 2017

Recognition: OtherCareer, activity or publication related prizes (lifetime, best paper, poster etc.)Scientific

Activities 2017 2017

  • 1 Keynote talk

Treewidth

Hans Bodlaender (Speaker)
8 Dec 2017

Activity: Talk or presentation typesKeynote talkScientific