prof.dr. H.L. (Hans) Bodlaender - Publications

Bodlaender, prof.dr. H.L.
Address :
Technische Universiteit Eindhoven
P.O. Box 513
5600 MB EINDHOVEN
Chair :
Network Algorithms
Department :
Department of Mathematics and Computer Science
Section :
Algorithms and Visualization W&I
Positioncategory :
Professor (HGL)
Position :
Full Professor
Room :
MF 4.144
Email :
h.l.bodlaender@tue.nl

Share / Bookmark

Publications

Article

Scientific peer reviewed
2017
2016
2014
2013
2012
2009
2004
2003
2002
2000
1999
1998
1994
1993
1988
Scientific not peer reviewed
2017
2015
2014
2013
2009

Editorial

Scientific peer reviewed

Chapter

Scientific peer reviewed
2012

Entry for encyclopedia/dictionary

Scientific peer reviewed
2016

Conference contribution

Scientific peer reviewed
2017
2016
2015
2014
2013
2012
2007
2002
1993
  • Bodlaender, H.L., Jansen, K. & Woeginger, G.J. (1993). Scheduling with incompatible jobs. In E.W. Mayr (Ed.), Graph-Theoretic Concepts in Computer Science (Proceedings 18th International Workshop, WG'92, Wiesbaden-Naurod, Germany, June 18-20, 1992) (pp. 37-49). (Lecture Notes in Computer Science, No. 657). Berlin: Springer.

  • Bodlaender, H.L., Kloks, A.J.J. & Kratsch, D. (1993). Treewidth and pathwidth of permutation graphs. In A. Lingas, R. Karlsson & S. Carlsson (Eds.), Automata, Languages and Programming (Proceedings 20th International Colloquium, ICALP'93, Lund, Sweden, July 5-9, 1993) (pp. 114-125). (Lecture Notes in Computer Science, No. 700). Berlin: Springer.

  • Kloks, A.J.J., Bodlaender, H.L., Müller, H. & Kratsch, D. (1993). Computing treewidth and minimum fill-in : all you need are the minimal separators. In T. Lengauer (Ed.), Algorithms - ESA'93 (Proceedings of the First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993) (pp. 260-271). (Lecture Notes in Computer Science, No. 726). Berlin: Springer.

Scientific not peer reviewed
2014

Paper

Other research output

Report

Scientific
2015
Popular
1995
1993
1992
1991
1990