Random hyperbolic graphs: degree sequence and clustering L Gugelmann, K Panagiotou, U Peter Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 163 | 2012 |

The asymptotic k-SAT threshold A Coja-Oghlan, K Panagiotou Advances in Mathematics, 985-1068, 2016 | 150 | 2016 |

Ultra-fast rumor spreading in social networks N Fountoulakis, K Panagiotou, T Sauerwald Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 98 | 2012 |

Rumor spreading on random regular graphs and expanders N Fountoulakis, K Panagiotou Random Structures & Algorithms 43 (2), 201-220, 2013 | 92 | 2013 |

Reliable broadcasting in random networks and the effect of density N Fountoulakis, A Huber, K Panagiotou INFOCOM, 2010 Proceedings IEEE, 1-9, 2010 | 88 | 2010 |

Optimal algorithms for k-search with application in option pricing J Lorenz, K Panagiotou, A Steger Algorithmica 55 (2), 311-328, 2009 | 86 | 2009 |

Efficient sampling methods for discrete distributions K Bringmann, K Panagiotou Algorithmica 79, 484-508, 2017 | 83* | 2017 |

Catching the k-NAESAT threshold A Coja-Oglan, K Panagiotou Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 77 | 2012 |

Scaling limits of random graphs from subcritical classes K Panagiotou, B Stufler, K Weller Annals of Probability 44 (5), 3291-3334, 2016 | 71 | 2016 |

Approximate counting of cycles in streams M Manjunath, K Mehlhorn, K Panagiotou, H Sun Algorithms–ESA 2011: 19th Annual European Symposium, Saarbrücken, Germany …, 2011 | 62 | 2011 |

The multiple-orientability thresholds for random hypergraphs N Fountoulakis, M Khosla, K Panagiotou Combinatorics, Probability and Computing 25 (6), 870-908, 2016 | 59 | 2016 |

Managing default contagion in inhomogeneous financial networks N Detering, T Meyer-Brandis, K Panagiotou, D Ritter SIAM Journal on Financial Mathematics 10 (2), 578-614, 2019 | 55 | 2019 |

Going after the k-SAT threshold A Coja-Oghlan, K Panagiotou Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 55 | 2013 |

On adequate performance measures for paging K Panagiotou, A Souza Proceedings of the thirty-eighth Annual ACM Symposium on Theory of computing …, 2006 | 55 | 2006 |

On the chromatic number of random graphs A Coja-Oghlan, K Panagiotou, A Steger Journal of Combinatorial Theory, Series B 98 (5), 980-993, 2008 | 53 | 2008 |

Explosive Percolation in Erdos-Rényi-Like Random Graph Processes K Panagiotou, R Spöhel, A Steger, H Thomas | 52* | |

Sharp load thresholds for cuckoo hashing N Fountoulakis, K Panagiotou Random Structures & Algorithms 41 (3), 306-333, 2012 | 51 | 2012 |

On properties of random dissections and triangulations N Bernasconi, K Panagiotou, A Steger Combinatorica 30 (6), 627-654, 2010 | 45 | 2010 |

Maximal biconnected subgraphs of random planar graphs K Panagiotou, A Steger ACM Transactions on Algorithms (TALG) 6 (2), 1-21, 2010 | 43 | 2010 |

On the insertion time of cuckoo hashing N Fountoulakis, K Panagiotou, A Steger SIAM Journal on Computing 42 (6), 2156-2181, 2013 | 37 | 2013 |