 | 2012 |
| 25 |  | Nikolaos Fountoulakis,
Konstantinos Panagiotou,
Thomas Sauerwald:
Ultra-fast rumor spreading in social networks.
SODA 2012: 1642-1660 |
| 2011 |
| 24 |  | Nikolaos Fountoulakis,
Megha Khosla,
Konstantinos Panagiotou:
The Multiple-Orientability Thresholds for Random Hypergraphs.
SODA 2011: 1222-1236 |
| 23 |  | Nikolaos Fountoulakis,
Konstantinos Panagiotou:
3-Connected Cores In Random Planar Graphs.
Combinatorics, Probability & Computing 20(3): 381-412 (2011) |
| 22 |  | Nikolaos Fountoulakis,
Ross J. Kang,
Colin McDiarmid:
Largest sparse subgraphs of random graphs.
Electronic Notes in Discrete Mathematics 38: 349-354 (2011) |
| 2010 |
| 21 |  | Nikolaos Fountoulakis,
Konstantinos Panagiotou:
Rumor Spreading on Random Regular Graphs and Expanders.
APPROX-RANDOM 2010: 560-573 |
| 20 |  | Nikolaos Fountoulakis,
Konstantinos Panagiotou:
Orientability of Random Hypergraphs and the Power of Multiple Choices.
ICALP (1) 2010: 348-359 |
| 19 |  | Nikolaos Fountoulakis,
Anna Huber,
Konstantinos Panagiotou:
Reliable Broadcasting in Random Networks and the Effect of Density.
INFOCOM 2010: 2552-2560 |
| 18 |  | Nikolaos Fountoulakis,
Konstantinos Panagiotou:
Rumor Spreading on Random Regular Graphs and Expanders
CoRR abs/1002.3518: (2010) |
| 17 |  | Nikolaos Fountoulakis,
Konstantinos Panagiotou,
Angelika Steger:
On the Insertion Time of Cuckoo Hashing
CoRR abs/1006.1231: (2010) |
| 16 |  | Nikolaos Fountoulakis,
Ross J. Kang,
Colin McDiarmid:
The t-Stability Number of a Random Graph.
Electr. J. Comb. 17(1): (2010) |
| 2009 |
| 15 |  | Nikolaos Fountoulakis,
Anna Huber,
Konstantinos Panagiotou:
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter.
DISC 2009: 529-530 |
| 14 |  | Nikolaos Fountoulakis,
Konstantinos Panagiotou:
Sharp Load Thresholds for Cuckoo Hashing
CoRR abs/0910.5147: (2009) |
| 13 |  | Oliver Cooley,
Nikolaos Fountoulakis,
Daniela Kühn,
Deryk Osthus:
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs.
Combinatorica 29(3): 263-297 (2009) |
| 12 |  | Anna Huber,
Nikolaos Fountoulakis:
Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting.
Electronic Notes in Discrete Mathematics 34: 553-559 (2009) |
| 11 |  | Nikolaos Fountoulakis,
Bruce A. Reed:
A general critical condition for the emergence of a giant component in random graphs with given degrees.
Electronic Notes in Discrete Mathematics 34: 639-645 (2009) |
| 10 |  | Nikolaos Fountoulakis,
Daniela Kühn,
Deryk Osthus:
Minors in random regular graphs.
Random Struct. Algorithms 35(4): 444-463 (2009) |
| 9 |  | Nikolaos Fountoulakis,
Anna Huber:
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading.
SIAM J. Discrete Math. 23(4): 1964-1991 (2009) |
| 2008 |
| 8 |  | Nikolaos Fountoulakis:
Percolation on sparse random graphs with given degree sequence.
CTW 2008: 88-93 |
| 7 |  | Oliver Cooley,
Nikolaos Fountoulakis,
Daniela Kühn,
Deryk Osthus:
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.
J. Comb. Theory, Ser. B 98(3): 484-505 (2008) |
| 6 |  | Nikolaos Fountoulakis,
Bruce A. Reed:
The evolution of the mixing rate of a simple random walk on the giant component of a random graph.
Random Struct. Algorithms 33(1): 68-86 (2008) |
| 5 |  | Nikolaos Fountoulakis,
Daniela Kühn,
Deryk Osthus:
The order of the largest complete minor in a random graph.
Random Struct. Algorithms 33(2): 127-141 (2008) |
| 2007 |
| 4 |  | Nikolaos Fountoulakis,
Daniela Kühn,
Deryk Osthus:
The order of the largest complete minor in a random graph.
Electronic Notes in Discrete Mathematics 29: 141-146 (2007) |
| 3 |  | Daniela Kühn,
Oliver Cooley,
Nikolaos Fountoulakis,
Deryk Osthus:
Ramsey numbers of sparse hypergraphs.
Electronic Notes in Discrete Mathematics 29: 29-33 (2007) |
| 2 |  | Nikolaos Fountoulakis:
Percolation on Sparse Random Graphs with Given Degree Sequence.
Internet Mathematics 4(4): 329-356 (2007) |
| 2002 |
| 1 |  | Nikolaos Fountoulakis,
Colin McDiarmid:
Upper bounds on the non-3-colourability threshold of random graphs.
Discrete Mathematics & Theoretical Computer Science 5(1): 205-226 (2002) |