Konstantinos Panagiotou
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
30
Venues
11
Active years
2006–2026
Best venue rank
A*
Where they publish
Papers
30 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | PODC | Brief Announcement: Limit Laws for Consensus Protocols on the Complete Graph. | Julian Becker, Konstantinos Panagiotou |
| 2024 | AofA | Limit Laws for Critical Dispersion on Complete Graphs. | Umberto De Ambroggio, Tams Makai, Konstantinos Panagiotou, Annika Steibel |
| 2021 | STACS | Inference and Mutual Information on Random Factor Graphs. | Amin Coja-Oghlan, Max Hahn-Klimroth, Philipp Loick, Nola Mller, Konstantinos Panagiotou, Matija Pasch |
| 2020 | LATIN | Asymptotics for Push on the Complete Graph. | Rami Daknama, Konstantinos Panagiotou, Simon Reisser |
| 2019 | ESA | Robustness of Randomized Rumour Spreading. | Rami Daknama, Konstantinos Panagiotou, Simon Reisser |
| 2019 | ICALP | Satisfiability Thresholds for Regular Occupation Problems. | Konstantinos Panagiotou, Matija Pasch |
| 2018 | SODA | Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. | Pawel Gawrychowski, Fabian Kuhn, Jakub Lopuszanski, Konstantinos Panagiotou, Pascal Su |
| 2014 | ICALP | Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). | Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas |
| 2013 | ISAAC | Faster Rumor Spreading with Multiple Calls. | Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald |
| 2013 | ISAAC | Asynchronous Rumor Spreading on Random Graphs. | Konstantinos Panagiotou, Leo Speidel |
| 2013 | STOC | Going after the k-SAT threshold. | Amin Coja-Oghlan, Konstantinos Panagiotou |
| 2012 | ICALP | Efficient Sampling Methods for Discrete Distributions. | Karl Bringmann, Konstantinos Panagiotou |
| 2012 | ICALP | Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract). | Luca Gugelmann, Konstantinos Panagiotou, Ueli Peter |
| 2012 | SODA | The maximum degree of random planar graphs. | Michael Drmota, Omer Gimnez, Marc Noy, Konstantinos Panagiotou, Angelika Steger |
| 2012 | SODA | Ultra-fast rumor spreading in social networks. | Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald |
| 2012 | STOC | Catching the k-NAESAT threshold. | Amin Coja-Oghlan, Konstantinos Panagiotou |
| 2011 | ESA | Approximate Counting of Cycles in Streams. | Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, He Sun |
| 2011 | SODA | The Multiple-Orientability Thresholds for Random Hypergraphs. | Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou |
| 2011 | SODA | On the Degree Distribution of Random Planar Graphs. | Konstantinos Panagiotou, Angelika Steger |
| 2011 | WADS | Multi-target Ray Searching Problems. | Spyros Angelopoulos, Alejandro Lpez-Ortiz, Konstantinos Panagiotou |
| 2010 | ICALP | Orientability of Random Hypergraphs and the Power of Multiple Choices. | Nikolaos Fountoulakis, Konstantinos Panagiotou |
| 2010 | INFOCOM | Reliable Broadcasting in Random Networks and the Effect of Density. | Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou |
| 2010 | SODA | Vertices of Degree k in Random Maps. | Daniel Johannsen, Konstantinos Panagiotou |
| 2010 | SODA | Synchrony and Asynchrony in Neural Networks. | Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, Angelika Steger |
| 2009 | SODA | Maximal biconnected subgraphs of random planar graphs. | Konstantinos Panagiotou, Angelika Steger |
| 2008 | SODA | On properties of random dissections and triangulations. | Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger |
| 2007 | ESA | Optimal Algorithms for | Julian Lorenz, Konstantinos Panagiotou, Angelika Steger |
| 2007 | ICALP | On the Chromatic Number of Random Graphs. | Amin Coja-Oghlan, Konstantinos Panagiotou, Angelika Steger |
| 2007 | SODA | On extremal subgraphs of random graphs. | Graham R. Brightwell, Konstantinos Panagiotou, Angelika Steger |
| 2006 | STOC | On adequate performance measures for paging. | Konstantinos Panagiotou, Alexander Souza |