Gerhard Woeginger - Biography#

Gerhard Woeginger is a full professor and the chair of combinatorial optimization at the Department of Mathematics and Computer Science at TU Eindhoven (Netherlands). His research interests lie in the Foundations of Computer Science, in Discrete Mathematics, and in Operations Research, and are mainly centered around algorithms and complexity. Concrete topics are approximation, scheduling, competitive analysis of online algorithms, parameterized complexity, graph theory; recently also computational social choice.

Born May 31, 1964, in Graz, Austria. 1982-1987 Diplom in Applied Mathematics at TU Graz, Austria. 1991 Ph.D. (supervisor Franz Rendl). 1995 habilitation in Discrete Mathematics and in Foundations of Computer Science, also in Graz. 1995 one-year post-doc at TU Eindhoven, Netherlands. 2001-2004 full professor and chair of Discrete Mathematics and Mathematical Programming at University Twente, Netherlands. 2011 Humboldt research award.

Editorial board member of "Journal of Computer and System Sciences", "Discrete Applied Mathematics", "Mathematics of Operations Research", and of a dozen other journals. Program committee chair of 5th European Symposium on Algorithms (Graz, Austria, 1997), 30th International Colloquium on Automata, Languages and Programming (Algorithms, Automata, Complexity and Games Track; Eindhoven, Netherlands, 2003), 7th Workshop on Algorithms for Planning and Scheduling problems (Siena, Italy, 2005), 23rd European Conference on Operational Research (Bonn, Germany, 2009), 15th International Conference on Integer Programming and Combinatorial Optimization (Yorktown Heights, USA, 2011), and 7th International Symposium on Parameterized and Exact Computation (Ljubljana, Slovenia, 2012).

Imprint Privacy policy « This page (revision-4) was last updated on Tuesday, 14. October 2014, 16:30 by Kaiser Dana
  • operated by