Als u wijzigingen in Pure hebt gemaakt, zullen deze hier binnenkort zichtbaar zijn.

Persoonlijk profiel

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.

Externe posities

Utrecht University

Vingerafdruk Duik in de onderzoeksthema's waar Hans L. Bodlaender actief is. Deze onderwerplabels komen voort uit het werk van deze persoon. Samen vormen ze een unieke vingerafdruk.

  • 5 Vergelijkbare profielen
Treewidth Rekenkunde
Graph in graph theory Rekenkunde
Polynomials Engineering en materiaalwetenschappen
Kernelization Rekenkunde
Decomposition Engineering en materiaalwetenschappen
Parameterized Complexity Rekenkunde
Tree Decomposition Rekenkunde
Dynamic programming Engineering en materiaalwetenschappen

Netwerk Recente externe samenwerking op landenniveau. Duik in de details door op de stippen te klikken.

Onderzoeksoutput 1988 2019

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, blz. 68-71 4 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Pathwidth
Computational complexity
Graph in graph theory
NP-complete problem

On the maximum weight minimal separator

Hanaka, T., Bodlaender, H. L., van der Zanden, T. C. & Ono, H., 3 dec 2019, In : Theoretical Computer Science. 796, blz. 294-308 15 blz.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Separator
Separators
Tree Decomposition
Proper subset
Treewidth

Parameterized complexity of conflict-free graph coloring

Bodlaender, H. L., Kolay, S. & Pieterse, A., 12 jul 2019, Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings. Friggstad, Z., Salavatipour, M. R. & Sack, J-R. (redactie). Cham: Springer, blz. 168-180 13 blz. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11646 LNCS).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Parameterized Complexity
Graph Coloring
Coloring
Colouring
Vertex Cover

Parameterized complexity of conflict-free graph coloring

Bodlaender, H. L., Kolay, S. & Pieterse, A., 1 mei 2019, In : arXiv. 41 blz., 1905.00305v1.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademic

Open Access
Bestand
Parameterized Complexity
Graph Coloring
Colouring
Vertex Cover
Treewidth

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. Catania, B., Pighizzini, G., Královič, R. & Nawrocki, J. (redactie). Cham: Springer, blz. 81-93 13 blz. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11376 LNCS).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

Gonality
Linear programming
Polynomials
Geometry
Subdivision

Prijzen

CIAC 2017 Best Paper Award

Hans Bodlaender (Ontvanger) & Tom C. van der Zanden (Ontvanger), 24 mei 2017

Prijs: AndersWerk, activiteit of publicatie gerelateerde prijzen (lifetime, best paper, poster etc.)Wetenschappelijk

Activiteiten 2017 2017

  • 1 Keynote spreker

Treewidth

Hans Bodlaender (Spreker)
8 dec 2017

Activiteit: Types gesprekken of presentatiesKeynote sprekerWetenschappelijk