Berthold Vöcking
|
Professor for Algorithms and Complexity
Office hours: Tuesday 14:30 - 15:00 (except Jan 17 and Jan 31) |
|
Currently, I do *not* offer any internship project. Please excuse if I do not respond to such email requests.
Research interests and publications
I'm interested in theoretical computer science, mostly in algorithms and networks. Topics of interest include
- algorithms for communication networks
- algorithmic game theory / mechanism design
- approximation and online algorithms
- randomized algorithms and probabilistic analysis of algorithms
Most of my publications together with a citation list can be found at Google scholar.
Editorships
- Distributed Computing (Springer-Verlag)
- ACM Transactions on Computation Theory (ToCT)
- Taschenbuch der Algorithmen (Springer-Verlag)
- Algorithms Unplugged (Springer-Verlag)
Scientific activities
- PC chair of SPAA 2013 in Toronto
- PC chair and organization of SAGT 2013 in Aachen
- Since 2008, member of the steering committee of the Symposium on Algorithmic Game Theory (SAGT)
- Since 2006, speaker of special interest group Theoretical Computer Science (Fachausschuss Theoretische Informatik) of the GI and, hence, Co-Chair of the STACS steering committee.
- Organization of a Dagstuhl seminar on Flexible Network Design, May 24-28, 2010.
- Organization of a SWAT satellite workshop on Realistic Models for Algorithms in Wireless Networks, June 19-20, 2010
- Chair of the initiative Algorithmus der
Woche within the Informatikjahr
2006.
- Organization of a Dagstuhl seminar on Probabilistic Methods in the Design and Analysis of Algorithms, Sept. 23-28, 2007.
- Member of the organization committee for STACS 2007 in Aachen.
- Organization of the workshop Optimization in Complex Networks in Oxford, 2006.
- Host of the annual meeting of DFG-SPP 1126 in Aachen, 2006.
- Organization of the GI seminar "Game-Theoretic Analyses of the Internet" in Dagstuhl, 2004.
- Organization of ADFOCS in Saarbrücken, 2001.
Program committees
FOCS'12 | PODC'12 | IPDPS'12 | SAGT'11 | EC'11 | SAGT'10 | ICALP-C'10 | EC'10 | DCOSS'10 | Algosensors'10 | CSR'10 | FOCS'09 | EC'09 | WINE'09 | COMSOC'08 | ICALP-A'08 | SAGT'08 | SODA'08 | HIPC'07 | PODC'07 | GECCO'07 | FOCS'05 | ESA'05 | WAOA'05 | ICALP'04 | SPAA'04 | IPDPS'04 | SIROCCO'03 | SPAA'02 | STACS'02 | Euro-Par'02A short CV ...
- From June 1995 to December 98, I worked towards my Ph.D. in the research group Theoretical Computer Science headed by Friedhelm Meyer auf der Heide at Paderborn University, Heinz-Nixdorf-Intistiute in Paderborn, Germany.
- From January to December 1999, I joined the theory group headed by Richard Karp at the International Computer Science Institute in Berkeley, California.
- From January to May 2000, I stayed as visiting assistent professor at the University of Massachusetts (UMASS) in Amherst, Massachusetts.
- From June 2000 to September 2002, I was a member of the algorithms and complexity group of Kurt Mehlhorn at the Max-Planck-Institut für Informatik (MPII) in Saarbrücken, Germany (almost France).
- From October 2002 to September 2004, I joined the CS department at Dortmund University as an associate professor in the algorithms and complexity group.
- Since October 2004, I'm full professor in the CS department at RWTH Aachen University.