On this page we list some selected publications of our research groups. Full lists of our publications can be found here:

• Angelika Steger's Group
• Emo Welzl's Group
• Peter Widmayer's Group

Recent Papers at Major TCS Conferences

Symposium on Discrete Algorithms (SODA) '15:

• R. Nenadov, A. Steger, N. Škorić An algorithmic framework for obtaining lower bounds for random Ramsey problems
• A. Ferber, R. Nenadov, A. Noever, U. Peter, N. Škorić Robust hamiltonicity of random directed graphs

Symposium on Discrete Algorithms (SODA) '12:

• M. Drmota, O. Gimenez, M. Noy, K. Panagiotou and A.Steger The maximum degree of random planar graphs

Symposium on Discrete Algorithms (SODA) '11:

• K. Panagiotou, A. Steger: On the degree distribution of random planar graphs
• T. Mütze, T. Rast, R. Spöhel Coloring random graphs online without creating monochromatic subgraphs

Symposium on Discrete Algorithms (SODA) '10:

• F. Kuhn, K. Panagiotou, J. Spencer, A. Steger Synchrony and asynchrony in neural networks

Symposium on Theory of Computing (STOC) '09:

• R. Moser A Constructive Proof of the Lovász Local Lemma

International Colloquium on Automata, Languages and Programming (ICALP) '09:

• B. Gfeller and P. Sanders Toward Optimal Range Medians.

Symposium on Discrete Algorithms (SODA) '09:

• K. Panagiotou, A. Steger: Maximal biconnected subgraphs of random planar graphs
• J. Matoušek, M. Tancer, and U. Wagner Hardness of Embedding Simplicial Complexes

Symposium on Discrete Algorithms (SODA) '08:

• N. Bernasconi, K. Panagiotou, A. Steger On Properties of Random Dissections and Triangulations
• J. Díaz, D. Mitsche, X. Pérez-Giménez On the connectivity of dynamic random geometric graphs

Symposium on Discrete Algorithms (SODA) '07:

• G. Brightwell, K. Panagiotou, A. Steger On extremal subgraphs of random graphs
• M. Marciniszyn, R. Spöhel Online vertex colorings of random graphs without monochromatic subgraphs
• T. Asano, J. Matoušek, T. Tokuyama
  Zone diagrams

Symposium on the Foundations of Computer Science (FOCS) '06:

• U. Wagner On a Generalization of the Upper Bound Theorem

Symposium on Theory of Computing (STOC) '06:

• J. Remy, A. Steger A quasi-polynomial time approximation scheme for minimum weight triangulation
• K. Panagiotou, A. Souza On adequate performance measures for paging
• T. Asano, J. Matoušek, T. Tokuyama The distance trisector curve

Symposium on Discrete Algorithms (SODA) '06:

• B. Gärtner, I. Schurr Linear programming and unique sink orientations
• M. Sharir, E. Welzl On the number of crossing-free matchings, (cycles, and partitions)