| Random hyperbolic graphs: degree sequence and clustering L Gugelmann, K Panagiotou, U Peter International Colloquium on Automata, Languages, and Programming, 573-585, 2012 | 97 | 2012 |
| The asymptotic k-SAT threshold A Coja-Oghlan, K Panagiotou Advances in Mathematics 288, 985-1068, 2016 | 93 | 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 | 91 | 2012 |
| Rumor spreading on random regular graphs and expanders N Fountoulakis, K Panagiotou Random Structures & Algorithms 43 (2), 201-220, 2013 | 75 | 2013 |
| Reliable broadcasting in random networks and the effect of density N Fountoulakis, A Huber, K Panagiotou INFOCOM, 2010 Proceedings IEEE, 1-9, 2010 | 75 | 2010 |
| Primal dual gives almost optimal energy-efficient online algorithms NR Devanur, Z Huang ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017 | 63 | 2017 |
| Bootstrap percolation in power-law random graphs H Amini, N Fountoulakis Journal of Statistical Physics 155 (1), 72-92, 2014 | 55 | 2014 |
| Optimal algorithms for k-search with application in option pricing J Lorenz, K Panagiotou, A Steger Algorithmica 55 (2), 311-328, 2009 | 55 | 2009 |
| On adequate performance measures for paging K Panagiotou, A Souza Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 51 | 2006 |
| Catching the k-NAESAT threshold A Coja-Oglan, K Panagiotou Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 50 | 2012 |
| Going after the k-SAT threshold A Coja-Oghlan, K Panagiotou Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 47 | 2013 |
| Scaling limits of random graphs from subcritical classes K Panagiotou, B Stufler, K Weller The Annals of Probability 44 (5), 3291-3334, 2016 | 45 | 2016 |
| Approximate counting of cycles in streams M Manjunath, K Mehlhorn, K Panagiotou, H Sun European Symposium on Algorithms, 677-688, 2011 | 45 | 2011 |
| Efficient sampling methods for discrete distributions K Bringmann, K Panagiotou International Colloquium on Automata, Languages, and Programming, 133-144, 2012 | 43* | 2012 |
| Explosive Percolation in Erdos-Rényi-Like Random Graph Processes K Panagiotou, R Spöhel, A Steger, H Thomas | 43* | |
| On properties of random dissections and triangulations N Bernasconi, K Panagiotou, A Steger Combinatorica 30 (6), 627-654, 2010 | 41 | 2010 |
| The Multiple-Orientability Thresholds for Random Hypergraphs† N Fountoulakis, M Khosla, K Panagiotou Combinatorics, Probability and Computing 25 (6), 870-908, 2016 | 38 | 2016 |
| Sharp load thresholds for cuckoo hashing N Fountoulakis, K Panagiotou Random Structures & Algorithms 41 (3), 306-333, 2012 | 38 | 2012 |
| Maximal biconnected subgraphs of random planar graphs K Panagiotou, A Steger ACM Transactions on Algorithms (TALG) 6 (2), 1-21, 2010 | 38 | 2010 |
| The degree sequence of random graphs from subcritical classes N Bernasconi, K Panagiotou, A Steger Combinatorics, Probability & Computing 18 (5), 647-681, 2009 | 32 | 2009 |
Fabian KuhnProfessor of Computer Science, University of FreiburgVerified email at informatik.uni-freiburg.de
