Homepage

Konstantinos Panagiotou

Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1.4, Room 313
Stuhlsatzenhausweg 85
66123 Saarbrücken
Germany

Email: kpanagio@mpi-inf.mpg.de
Phone: +49 681 9325 113
Fax: +49 681 9325 199

List of Selected Talks

Random Planar Graphs (and more)
Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, January 2011
Adequate Performance Measures for Paging
Max-Planck-Institute for Computer Science, Saarbrucken, Germany, September 2008
Random Structures in Computer Science
Symposium on Theoretical Computer Science, ETH Zurich, Zurich, September 2008
Properties of Random Planar Graphs (via Sampling)
SIAM Conference on Discrete Mathematics, Burlington, USA, June 2008
Extremal Subgraphs of Random Graphs
McGill University, Montreal, Canada, March 2008
Einfache und schwierige Probleme eines Informatikers
Schnupperstudium Informatik, Zurich, Switzerland, February 2008
The Degree Sequences of Random Outerplanar and Series-Parallel Graphs
Technical University Munich, Munich, Germany, January 2008
On Properties of Random Dissections and Triangulations
ACM-SIAM Symposium on Discrete Algorithms (SODA '08), San Francisco, USA, January 2008
The Degree Sequences of Random Outerplanar and Series-Parallel Graphs
Humboldt University Berlin, Berlin, Germany, November 2007
The Chromatic Number of Random Graphs
ETH Zurich, Zurich, Switzerland, 2007
Einfache und schwierige Probleme eines Informatikers
Schnupperstudium Informatik, Zurich, Switzerland, August 2007
The Chromatic Number of Random Graphs
34th International Colloquium on Automata, Languages and Programming (ICALP '07), Wroclaw, Poland, July 2007
The Chromatic Number of Random Graphs
Workshop Random Graphs and Extremal Graph Theory, Berlin, Germany, July 2007
Properties of Random Graphs via Boltzmann Samplers
2007 Conference on Analysis of Algorithms (AofA '07), Juan-Les-Pins, France, June 2007
The Santa Claus Problem (in a Probabilistic Setting)
Random Structures & Algorithms, Tel-Aviv, Israel, MAy 2007
On Extremal Subgraphs of Random Graphs
ACM-SIAM Symposium on Discrete Algorithms (SODA '07), New Orleans, USA, January 2007
On the Chromatic Number of Random Graphs
Workshop: Algorithms for the SAT-Problem, Berlin, Germany, October 2006
Extremal Subgraphs of Random Graphs
6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague, July 2006
New Bounds and Models for Paging
CGC Workshop, Hidensee, Germany, October 2005
Is the Random Graph Uniquely Colorable?
Random Structures & Algorithms, Poznan, Poland, August 2005
Data Compression Using Vector Quantization
ETH Zurich, Zurich, Switzerland, March 2005