[
University of Bonn
|
Department of Computer Science
|
Chair V
]
Dagstuhl Seminars:
-
Dagstuhl Seminars
Past Seminars
-
Dagstuhl Seminar 01231:
Design and Analysis of Randomized and Approximation Algorithms, Dagstuhl,
June 6-8, 2001,
Org.: M. Dyer (Leeds), M. Jerrum (Edinburgh), M. Karpinski (Bonn).
-
Dagstuhl Seminar 03291:
Algorithmic Game Theory and the Internet, Dagstuhl,
July 13-18, 2003,
Org.: M. Karpinski (Bonn), C. Papadimitriou (Berkeley), V.Vazirani (Atlanta).
-
Dagstuhl Seminar 05201:
Design and Analysis of Randomized and Approximation Algorithms, Dagstuhl,
May 15-20, 2005,
Org.: M. Dyer (Leeds), M. Jerrum (Edinburgh), M. Karpinski (Bonn).
-
Dagstuhl Seminar 08201:
Design and Analysis of Randomized and Approximation Algorithms, Dagstuhl,
May 11-16, 2008,
Org.: M. Dyer (Leeds), M. Jerrum (London), M. Karpinski (Bonn).
-
Dagstuhl Seminar 11241:
Design and Analysis of Randomized and Approximation Algorithms, Dagstuhl,
June 13-17, 2011,
Org.: M. Dyer (Leeds), U. Feige (Rehovot), A. Frieze (Pittsburgh), M. Karpinski (Bonn).
Please report any problems with our server by Email to:
webmaster@theory.cs.uni-bonn.de
This page last modified: July 4th, 2011