Gerhard Woeginger

from Wikipedia, the free encyclopedia
Gerhard Woeginger, Oberwolfach 2011

Gerhard J. Woeginger (born May 31, 1964 in Graz ) is an Austrian computer scientist. Since 2016 he has held a professorship at the Chair of Algorithms and Complexity at RWTH Aachen University .

Live and act

Woeginger studied applied mathematics at the Graz University of Technology with a diploma in 1987 and a doctorate under Franz Rendl in 1991. He then stayed at the Graz University of Technology and qualified as a professor in 1995 in the basics of computer science and discrete mathematics . In 1995 Woeginger was a post-doctoral student at the TU Eindhoven. In 2001 he took over the chair for discrete mathematics and mathematical programming at the University of Twente as a full professor and from 2004 the chair for combinatorial optimization at the TU Eindhoven . In 2016 he accepted a call to RWTH Aachen University , where he heads the Algorithms and Complexity Department.

Woeginger researches approximation algorithms , scheduling , combinatorial optimization , online algorithms , parameterized complexity, graph theory , operations research and social choice theory . Among other things, he led the program for the 5th European Symposium on Algorithms in Graz in 1997 and the 23rd European Conference on Operational Research in Bonn in 2009.

In 1996 Woeginger was one of the first winners of the Austrian Start Prize . In 2011 he received a Humboldt Research Award . He has been with the Academia Europaea since 2014 .

Fonts (selection)

  • with Amos Fiat (editor): Online Algorithms: the state of the art , Springer, Lecturenotes in computer science 1442, 1998
    • therein by Woeginger with J. Csirik: On-line packing and covering problems , pp. 147–177
  • Exact algorithms for NP-hard problems: A survey, in: Combinatorial optimization - Eureka, you shrink! , Springer 2003, pp. 185-207
  • with P. Crescenzi, V. Kann, MM Halldórsson, M. Karpinski: A compendium of NP optimization problems , 2000
  • with B. Chen, CN Potts: A review of machine scheduling: Complexity, algorithms and approximability , in: Handbook of Combinatorial Optimization, Volume 3, 1998, pp. 21-169
  • with RE Burkard u. a .: Well-solvable special cases of the traveling salesman problem: a survey , SIAM Review, Volume 40, 1998, pp. 496-546

Web links

personal data
SURNAME Woeginger, Gerhard
ALTERNATIVE NAMES Woeginger, Gerhard J.
BRIEF DESCRIPTION Austrian computer scientist
DATE OF BIRTH May 31, 1964
PLACE OF BIRTH Graz