Homepage
Nikolaos Fountoulakis
Marie Curie Research Fellow
E mail: fountoul at mpi-inf dot mpg dot de
Phone: +49 681 9325 108
Fax: +49 681 9325 199
- Probabilistic Methods in Combinatorics
- Random structures, pseudorandomness
- Extremal Combinatorics
- The multiple-orientability thresholds of random hypergraphs (joint with M. Koshla and K. Panagiotou), accepted in SODA 2011.
- Rumor spreading on random regular graphs and expanders, (joint with K. Panagiotou), In Proceedings of
RANDOM 2010, Leture Notes in Computer Science 6302, Springer, 2010, pp. 560-573.
- Orientability of random hypergraphs and the power of multiple choices ,
(joint with K.Panagiotou) In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Lecture Notes in Computer Science 6198, Springer, 2010, pp. 348-359.
- 3-Connected Cores in Random Planar Graphs, (joint with K. Panagiotou), accepted in Combinatorics, Probability and Computing.
- Reliable Broadcasting on Random Networks and the Effect of
Density , (joint with A.Huber and K.Panagiotou)
In Proceedings of IEEE INFOCOM 2010, 2010, pp. 2552-2560.
-
The t-stability number of a random graph, (joint with
C.J.H. McDiarmid and R. Kang), The Electronic Journal of Combinatorics R(59), 2010.
-
Brief announcement:The Speed of Broadcasting in Random Networks:
Density Does Not Matter, (joint with A. Huber and K. Panagiotou),
In Proceedings of the 23rd International Symposium on Distributed
Computing (DISC 2009), Lecture Notes in Computer Science 5805, Springer, 2009, pp. 529-530.
-
A general critical condition for the emergence of a giant component in random graphs with given degrees,
(joint with B. Reed) In Proceedings of EUROCOMB 2009,
Electronic Notes in Discrete Mathematics 34, 2009, pp. 639-645
-
Quasirandom rumor spreading on the complete graph is as
fast as randomized rumor spreading, (joint with A. Huber), SIAM Journal on Discrete Mathematics 23 (2009), 1964-1991.
-
Embeddings and Ramsey numbers
of sparse k-uniform hypergraphs
(joint with O.J. Cooley, D. Kühn and D. Osthus),
Combinatorica 29 (2009), 263-297.
- Minors in random
regular graphs (joint with D. Kühn and D. Osthus), Random Structures and Algorithms 35 (2009), 444-463.
- The order of the largest complete minor in a random graph
(joint with D. Kühn and D. Osthus), Random Structures and Algorithms 33 (2008), 127-141.
-
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
(joint with O.J. Cooley, D. Kühn and D. Osthus),
Journal of Combinatorial Theory B 98(2008), 484-505.
- The evolution of the mixing rate of a simple random walk on
the giant component of a random graph ,
(joint with B. A. Reed), Random Structures and Algorithms
33 (2008), 68-86.
-
Percolation on sparse random graphs with given degree sequence,
Internet Mathematics 4 (2007), 329-356.
- Faster Mixing and Small Bottlenecks , (joint with B. A. Reed), Probability Theory and Related Fields 137 (2007), 475-486.
- Upper bounds on the non-3-colourability threshold of random graphs (joint with C.J.H. McDiarmid), Discrete Mathematics and Theoretical Computer Science 5 (2002), 205-226.
- On the structure of the core of sparse random graphs, preprint.
No teaching activities at the moment.
