On adequate performance measures for paging. - Konstantinos Panagiotou; Alexander Souza (STOC, 2006)

On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. - Nicla Bernasconi; Konstantinos Panagiotou; Angelika Steger (APPROX-RANDOM, 2008)

On the chromatic number of random graphs. - Amin Coja-Oghlan; Konstantinos Panagiotou; Angelika Steger (J. Comb. Theory B, 2008)

Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. - Nikolaos Fountoulakis; Anna Huber; Konstantinos Panagiotou (DISC, 2009)

Optimal Algorithms for k-Search with Application in Option Pricing. - Julian Lorenz; Konstantinos Panagiotou; Angelika Steger (Algorithmica, 2009)

Tight Bounds for Quasirandom Rumor Spreading. - Spyros Angelopoulos 001; Benjamin Doerr; Anna Huber; Konstantinos Panagiotou (Electron. J. Comb., 2009)

The Degree Sequence of Random Graphs from Subcritical Classes. - Nicla Bernasconi; Konstantinos Panagiotou; Angelika Steger (Comb. Probab. Comput., 2009)

A note on the chromatic number of a dense random graph. - Konstantinos Panagiotou; Angelika Steger (Discret. Math., 2009)

Vertices of Degree k in Random Unlabeled Trees. - Konstantinos Panagiotou; Makrand Sinha (Electron. Notes Discret. Math., 2009)

Orientability of Random Hypergraphs and the Power of Multiple Choices. - Nikolaos Fountoulakis; Konstantinos Panagiotou (ICALP (1), 2010)

Reliable Broadcasting in Random Networks and the Effect of Density. - Nikolaos Fountoulakis; Anna Huber; Konstantinos Panagiotou (INFOCOM, 2010)

Vertices of Degree k in Random Maps. - Daniel Johannsen; Konstantinos Panagiotou (SODA, 2010)

Synchrony and Asynchrony in Neural Networks. - Fabian Kuhn; Konstantinos Panagiotou; Joel Spencer; Angelika Steger (SODA, 2010)

On properties of random dissections and triangulations. - Nicla Bernasconi; Konstantinos Panagiotou; Angelika Steger (Comb., 2010)

Maximal biconnected subgraphs of random planar graphs. - Konstantinos Panagiotou; Angelika Steger (ACM Trans. Algorithms, 2010)

Approximate Counting of Cycles in Streams. - Madhusudan Manjunath; Kurt Mehlhorn; Konstantinos Panagiotou; He Sun 001 (ESA, 2011)

On the Degree Distribution of Random Planar Graphs. - Konstantinos Panagiotou; Angelika Steger (SODA, 2011)

3-Connected Cores In Random Planar Graphs. - Nikolaos Fountoulakis; Konstantinos Panagiotou (Comb. Probab. Comput., 2011)

Explosive Percolation in Erdős-Rényi-Like Random Graph Processes. - Konstantinos Panagiotou; Reto Spöhel; Angelika Steger; Henning Thomas (Electron. Notes Discret. Math., 2011)

Random Hyperbolic Graphs: Degree Sequence and Clustering - (Extended Abstract). - Luca Gugelmann; Konstantinos Panagiotou; Ueli Peter (ICALP (2), 2012)

The maximum degree of random planar graphs. - Michael Drmota; Omer Giménez; Marc Noy; Konstantinos Panagiotou; Angelika Steger (SODA, 2012)

Ultra-fast rumor spreading in social networks. - Nikolaos Fountoulakis; Konstantinos Panagiotou; Thomas Sauerwald (SODA, 2012)

Catching the k-NAESAT threshold. - Amin Coja-Oghlan; Konstantinos Panagiotou (STOC, 2012)

A Probabilistic Analysis of Christofides' Algorithm. - Markus Bläser; Konstantinos Panagiotou; B. V. Raghavendra Rao (SWAT, 2012)

Random Hyperbolic Graphs: Degree Sequence and Clustering - Luca Gugelmann; Konstantinos Panagiotou; Ueli Peter (CoRR, 2012)

Vertices of degree k in random unlabeled trees. - Konstantinos Panagiotou; Makrand Sinha (J. Graph Theory, 2012)

Extremal subgraphs of random graphs. - Graham R. Brightwell; Konstantinos Panagiotou; Angelika Steger (Random Struct. Algorithms, 2012)

Sharp load thresholds for cuckoo hashing. - Nikolaos Fountoulakis; Konstantinos Panagiotou (Random Struct. Algorithms, 2012)

Going after the k-SAT threshold. - Amin Coja-Oghlan; Konstantinos Panagiotou (STOC, 2013)

A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. - Michael Drmota; Konstantinos Panagiotou (Algorithmica, 2013)

On the connectivity of random graphs from addable classes. - Mihyun Kang; Konstantinos Panagiotou (J. Comb. Theory B, 2013)

Rumor spreading on random regular graphs and expanders. - Nikolaos Fountoulakis; Konstantinos Panagiotou (Random Struct. Algorithms, 2013)

On the Insertion Time of Cuckoo Hashing. - Nikolaos Fountoulakis; Konstantinos Panagiotou; Angelika Steger (SIAM J. Comput., 2013)

Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). - Karl Bringmann; Fabian Kuhn; Konstantinos Panagiotou; Ueli Peter; Henning Thomas (ICALP (1), 2014)

Coloring d-Embeddable k-Uniform Hypergraphs. - Carl Georg Heise; Konstantinos Panagiotou; Oleg Pikhurko; Anusch Taraz (Discret. Comput. Geom., 2014)

Multi-target ray searching problems. - Spyros Angelopoulos 001; Alejandro López-Ortiz; Konstantinos Panagiotou (Theor. Comput. Sci., 2014)

Faster Rumor Spreading With Multiple Calls. - Konstantinos Panagiotou; Ali Pourmiri; Thomas Sauerwald (Electron. J. Comb., 2015)

Randomized Rumour Spreading: The Effect of the Network Topology. - Konstantinos Panagiotou; Xavier Pérez-Giménez; Thomas Sauerwald; He Sun 001 (Comb. Probab. Comput., 2015)

Maximizing the Minimum Load for Random Processing Times. - Stefanie Gerke; Konstantinos Panagiotou; Justus Schwartz; Angelika Steger (ACM Trans. Algorithms, 2015)

Random Graphs, Geometry and Asymptotic Structure. - Michael Krivelevich; Konstantinos Panagiotou; Mathew D. Penrose; Colin J. H. McDiarmid (Cambridge University Press, 2016)

The Multiple-Orientability Thresholds for Random Hypergraphs. - Nikolaos Fountoulakis; Megha Khosla; Konstantinos Panagiotou (Comb. Probab. Comput., 2016)

Efficient Sampling Methods for Discrete Distributions. - Karl Bringmann; Konstantinos Panagiotou (Algorithmica, 2017)

Asynchronous Rumor Spreading on Random Graphs. - Konstantinos Panagiotou; Leo Speidel (Algorithmica, 2017)

Optimal strategies for weighted ray search. - Spyros Angelopoulos 001; Konstantinos Panagiotou (CoRR, 2017)

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes. - Fabian Kuhn; Konstantinos Panagiotou; Pascal Su (CoRR, 2017)

Asymptotic Enumeration of Graph Classes with Many Components. - Konstantinos Panagiotou; Leon Ramzews (ANALCO, 2018)

Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees. - Pawel Gawrychowski; Fabian Kuhn; Jakub Lopuszanski; Konstantinos Panagiotou; Pascal Su (SODA, 2018)

Load Thresholds for Cuckoo Hashing with Double Hashing. - Michael Mitzenmacher; Konstantinos Panagiotou; Stefan Walzer (SWAT, 2018)

Bootstrap Percolation in Directed Inhomogeneous Random Graphs. - Thilo Meyer-Brandis; Nils Detering; Konstantinos Panagiotou (Electron. J. Comb., 2019)

Bootstrap percolation with inhibition. - Hafsteinn Einarsson; Johannes Lengler; Frank Mousset; Konstantinos Panagiotou; Angelika Steger (Random Struct. Algorithms, 2019)

Managing Default Contagion in Inhomogeneous Financial Networks. - Nils Detering; Thilo Meyer-Brandis; Konstantinos Panagiotou; Daniel Ritter 004 (SIAM J. Financial Math., 2019)

Asymptotically optimal amplifiers for the Moran process. - Leslie Ann Goldberg; John Lapinskas; Johannes Lengler; Florian Meier 002; Konstantinos Panagiotou; Pascal Pfister (Theor. Comput. Sci., 2019)

Asymptotics for Push on the Complete Graph. - Rami Daknama; Konstantinos Panagiotou; Simon Reisser (LATIN, 2020)

Inference and Mutual Information on Random Factor Graphs. - Amin Coja-Oghlan; Max Hahn-Klimroth; Philipp Loick; Noëla Müller; Konstantinos Panagiotou; Matija Pasch (STACS, 2021)

Robustness of randomized rumour spreading. - Rami Daknama; Konstantinos Panagiotou; Simon Reisser (Comb. Probab. Comput., 2021)

Suffocating Fire Sales. - Nils Detering; Thilo Meyer-Brandis; Konstantinos Panagiotou; Daniel Ritter 004 (SIAM J. Financial Math., 2022)

Exact-Size Sampling of Enriched Trees in Linear Time. - Konstantinos Panagiotou; Leon Ramzews; Benedikt Stufler (SIAM J. Comput., 2023)

Weighted online search. - Spyros Angelopoulos 001; Konstantinos Panagiotou (J. Comput. Syst. Sci., 2023)

Limit Laws for Critical Dispersion on Complete Graphs. - Umberto De Ambroggio; Tamás Makai; Konstantinos Panagiotou; Annika Steibel (AofA, 2024)

Search Games with Predictions. - Spyros Angelopoulos 001; Thomas Lidbetter; Konstantinos Panagiotou (CoRR, 2024)

The effect of iterativity on adversarial opinion forming. - Konstantinos Panagiotou; Simon Reisser (Inf. Process. Lett., 2024)

Satisfiability thresholds for regular occupation problems. - Konstantinos Panagiotou; Matija Pasch (Comb. Probab. Comput., 2025)

Dispersion on the Complete Graph. - Umberto De Ambroggio; Tamás Makai; Konstantinos Panagiotou (Random Struct. Algorithms, 2025)