Konstantinos Panagiotou - Personal Home

This page has not been maintained since October 2008. Please visit my new page!

Research Interests

• Random Structures
• Average Case Analysis/(Expected) Competitive Analysis
• Vertex-Coloring
• Combinatorics

Here you can find my CV and my Research Statement.

Publications

Accepted (Refereed Conferences)

• Maximal Biconnected Subgraphs of Random Planar Graphs (preprint)
  (joint with A. Steger)
  To appear in: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '09).
• On Properties of Random Dissections and Triangulations
  (joint with N. Bernasconi and A. Steger)
  In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), p. 132-141.
• On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs (preprint)
  (joint with N. Bernasconi and A. Steger)
  To appear in: Proceedings of the 12th International Workshop on Randomized Techniques in Computation (RANDOM'08)
• On Extremal Subgraphs of Random Graphs
  (joint with G. Brightwell and A. Steger)
  In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '07), p. 477-485.
• On the Chromatic Number of Random Graphs (preprint)
  (joint with A. Coja-Oghlan and A. Steger)
  In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP '07), p. 777-788. Full version to appear in JCTB.
• Optimal Algorithms for k-Search with Application in Option Pricing (preprint)
  (joint with J. Lorenz and A. Steger)
  In: 15th Annual European Symposium on Algorithms (ESA '07), p. 275-286. Invited and accepted to special issue of Algorithmica.
• Properties of Random Graphs via Boltzmann Samplers (preprint)
  (joint with A. Weißl)
  The Boltzmann sampler implementation and sampled graphs can be found here.
  To appear in: International Conference on Analysis of Algorithms (AofA'07).
• On Adequate Performance Measures for Paging
  (joint with A. Souza)
  In: Proceedings of the 38th ACM Symposium on Theory of Computing (STOC'06), p. 487-496.

Accepted (Journals)

• On the Chromatic Number of Random Graphs
  (joint with A. Coja-Oghlan and A. Steger)
  Accepted for publication in Journal of Combinatorial Theory, Series B.
• Optimal Algorithms for k-Search with Application in Option Pricing
  (joint with J. Lorenz and A. Steger)
  Accepted for publication in Algorithmica.
• A Note on the Chromatic Number of a Dense Random Graph
  (joint with A. Steger)
  Accepted for publication in Discrete Mathematics.
  

Submitted

• The Threshold for the Balancedness of Colored Graphs (preprint)
  (joint with A. Steger)
• The Santa Claus Problem in a Probabilistic Setting (preprint)
  (joint with S. Gerke and J. Schwartz and A. Steger)
• On Properties of Random Dissections and Triangulations (full version)
  (joint with N. Bernasconi and A. Steger)

Diploma Thesis & Other Projects

• Numerische Approximation multivariater Daten mit adaptiven Gebietszerlegungsmethoden (in german)
  (Numerical Approximation of Multivariate Data with Adaptive Domain Decomposition Methods)
  TU München, 2003
• e-jigsaw: Computergestützte Rekonstruktion zerrissener Stasi-Unterlagen
  TU München, 2001-2002
• Implementierung und Integration verallgemeinerter Delaunay-Triangulierungen zur adaptiven numerischen Behandlung von nichtlinearen Transportgleichungen
  TU München, 2002

Here you can find a list of my talks and teaching activities.