Your search returned the following 27 documents:

27. Explosive percolation in Erdös-Rényi-like random graph processes
    Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, and Henning Thomas
    Combinatorics, Probability and Computing 22 (1): 133-145, 2013
    
26. Faster Rumor Spreading with Multiple Calls
    Konstantinos Panagiotou, Ali Pourmiri, and Thomas Sauerwald
    In: 24th International Symposium on Algorithms and Computation (ISAAC-13), Hong Kong, China, 2013, 446-456
    
25. On the Insertion Time of Cuckoo Hashing
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    SIAM Journal on Computing , 2013. Note: Accepted for publication.
    
24. Catching the k-NAESAT Threshold
    Konstantinos Panagiotou and Amin Coja-Oghlan
    In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, New York, NY, 2012, 899-907
    
23. Efficient Sampling Methods for Discrete Distributions
    Karl Bringmann and Konstantinos Panagiotou
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 133-144
    
    
22. Extremal subgraphs of random graphs
    Graham Brightwell, Konstantinos Panagiotou, and Angelika Steger
    Random Structures & Algorithms 41 (2): 147-178, 2012
    
21. Tight Load Thresholds for Cuckoo Hashing
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    Random Structures and Algorithms 41 (3): 306-333, 2012
    
20. Ultra-fast rumor spreading in social networks
    Nikolaos Fountoulakis, Konstantinos Panagiotou, and Thomas Sauerwald
    In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), Kyoto, Japan, 2012, 1642-1660
    
19. Vertices of degree k in random unlabeled trees
    Konstantinos Panagiotou and Makrand Sinha
    Journal of Graph Theory 69 (2): 114-130, 2012
    
18. 3-Connected Cores In Random Planar Graphs
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    Combinatorics, Probability & Computing 20 (3): 381-412, 2011
    
17. Approximate Counting of Cycles in Streams
    Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, and He Sun
    In: 19th Annual European Symposium on Algorithms (ESA-11), Saarbrücken, Germany, 2011, 677-688
    
16. Explosive percolation in Erdős-Rényi-like random graph processes
    Konstantinos Panagiotou, Reto Spöhel, Angelika Steger, and Henning Thomas
    In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, Budapest, 2011, 699-704
    
15. On the Degree Sequence of Random Planar Graphs
    Konstantinos Panagiotou and Angelika Steger
    In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011, 1198-1210
    
14. The Multiple-orientability Thresholds for Random Hypergraphs
    Nikolaos Fountoulakis, Megha Khosla, and Konstantinos Panagiotou
    In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), San Francisco, CA, 2011, 1222-1236
    
13. Maximal Biconnected Subgraphs of Random Planar Graphs
    Konstantinos Panagiotou and Angelika Steger
    ACM Transactions on Algorithms 6 (2): 31,1-31,21, 2010
    
12. Orientability of random hypergraphs and the power of multiple choices
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, Bordeaux, France, 2010, 348-359
    
11. Reliable broadcasting in random networks and the effect of density
    Nikolaos Fountoulakis, Anna Huber, and Konstantinos Panagiotou
    In: 2010 Proceedings IEEE INFOCOM, San Diego, USA, 2010, 2552-2560
    
10. Rumor spreading on random regular graphs and expanders
    Nikolaos Fountoulakis and Konstantinos Panagiotou
    In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, Barcelona, Spain, 2010, 560-573
    
9. Synchrony and Asynchrony in Neural Networks
   Fabian Kuhn, Konstantinos Panagiotou, Joel Spencer, and Angelika Steger
   In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA, 2010, 949-964
   
8. Vertices of Degree k in Random Maps
   Daniel Johannsen and Konstantinos Panagiotou
   In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin, USA, 2010, 1436-1447. Note: to appear
   [PDF: Download: JohannsenPanagiotou2010.pdf]
   
7. Blocks In Constrained Random Graphs with Fixed Average Degree
   Konstantinos Panagiotou
   In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), Hagenberg, Austria, 2009, 733-744
   
6. Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
   Nikolaos Fountoulakis, Anna Huber, and Konstantinos Panagiotou
   In: Distributed Computing : 23rd International Symposium, DISC 2009, Elche/Elx, Spain, 2009, 529-530. Note: Full version available from arXiv:0904.4851
   
5. Maximal Biconnected Subgraphs of Random Planar Graphs
   Konstantinos Panagiotou and Angelika Steger
   In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, NY, USA, 2009, 432-440
   
4. The Degree Sequence of Random Graphs from Subcritical Classes
   Konstantinos Panagiotou
   Combinatorics, Probability and Computing 18 (5): 647-681, 2009
   
3. The Speed of Broadcasting in Random Networks: Density Does Not Matter
   Nikolaos Fountoulakis, Anna Huber, and Konstantinos Panagiotou
   In: 23rd International Symposium on Distributed Computing (DISC '09), Elche/Elx, Spain, 2009, 529-530
   
2. Tight bounds for quasirandom rumor spreading
   Spyros Angelopoulos, Benjamin Doerr, Anna Huber, and Konstantinos Panagiotou
   The Electronic Journal of Combinatorics 16 (1): R102,1-R102,19, 2009
   
1. Vertices of Degree k in Random Unlabeled Trees
   Konstantinos Panagiotou
   In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), Bordeaux, France, 2009, 41-45