- Random discrete structures
- Stochastic processes on graphs
- Probabilistic combinatorics

- Percolation on random graphs with a fixed degree sequence, (joint with F. Joos and G. Perarnau),
*submitted*. - A phase transition on the evolution of bootstrap processes in inhomogeneous random graphs, (joint with M. Kang, C. Koch and T. Makai),
*submitted*. - Law of large numbers for the largest component in a hyperbolic model of complex networks, (joint with T. Müller),
*submitted*. - Local majority dynamics on preferential attachement graphs, (joint with M. Abdullah and M. Bode),
*submitted*. - Typical distances in a geometric model for complex networks, (joint with M. Abdullah and M. Bode),
*submitted*. - A phase transition on the evolution of bootstrap percolation processes on preferential attachment graphs, (joint with M.Abdullah)
*submitted*. - Bootstrap percolation in inhomogeneous random graphs (joint with H.Amini and K. Panagiotou)
*submitted*.

- The probability of connectivity in a hyperbolic model of complex networks, (joint with M. Bode and T. Müller),
*Random Structures and Algorithms***49**(1) (2016), 65-94. - Clustering and the hyperbolic geometry of complex networks (joint with E. Candellero),
*Internet Mathematics***12**(1-2) (2016), 2-53.

(a short version has appeared in*Proceedings of the 11th International Workshop on Algorithms and Models for the Web graph (WAW'14) (A. Bonato et al. Eds.)*, LNCS 8882, 2014, pp. 1-12.) - Multiple orientability thresholds for random hypergraphs (joint with M. Khosla and K. Panagiotou), to appear in
*Combinatorics, Probability and Computing*. - Bootstrap percolation and the geometry of complex networks (joint with E. Candellero),
*Stochastic Processes and their Applications***126**(1) (2016), 234-264. - On the largest component of a hyperbolic model of complex networks, (joint with M. Bode and T. Müller),
*Electronic Journal of Combinatorics***22**(3) (2015), 3.24. - On a geometrization of the Chung-Lu model for complex networks,
*Journal of Complex Networks***3**(3) (2015), 361-387. - On the average-case complexity of parametrised clique, (joint with T. Friedrich and D. Hermelin),
*Theoretical Computer Science***576**(2015), 18-29. - Bootstrap percolation in power-law random graphs, (joint with H. Amini)
*J. Stat. Phys.***155**(2014), 72-92. - Largest sparse subgraphs of random graphs, (joint with R. Kang and C. McDiarmid),
*European J. Combin.***35**(2014), 232-244. - On the insertion time of Cuckoo hashing (joint with K. Panagiotou and A. Steger),
*SIAM Journal on Computing***42**(2013), 2156-2181. - Rumor spreading on random regular graphs and expanders, (joint with K. Panagiotou),
*Random Structures and Algorithms***41**(2013), 201-220. - Sharp load thresholds for Cuckoo hashing, (joint with K. Panagiotou),
*Random Structures and Algorithms***41**(2012), 306-333. - 3-Connected Cores in Random Planar Graphs,(joint with K. Panagiotou),
*Combinatorics, Probability and Computing***20**(3) (2011), 381-412. -
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. -
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.

- What I tell you three times in true: bootstrap percolation in small worlds, (joint with H. Amini), In
*Proceedings of the 8th Workshop on Internet and Network Economics (WINE '12) (P. Goldberg, Ed.)*, Lecture Notes in Computer Science, 7695, 2012, pp. 462-474. - Ultra-fast rumor spreading in social networks (joint with K.Panagiotou and T.Sauerwald),
In
*Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012*, Kyoto, Japan, 2012, pp. 1642-1660. - The multiple-orientability thresholds of random hypergraphs
(joint with M. Koshla and K. Panagiotou), In
*Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011*, San Francisco, U.S.A., 2011, pp.1222-1236. - 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. - 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. -
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

- Combinatorics (2AC)
- Communication Theory (3Com)

- September 2008 - March 2011, Research fellow, Max-Planck-Institut Informatik, Germany.
- May 2006 - September 2008, Research fellow, School of Mathematics , University of Birmingham, UK.
- August 2003 - July 2004, Research fellow,
School of Computer Science , McGill University, Canada.

- D. Phil , Mathematical Institute, University of Oxford (under the supervision of Colin McDiarmid ), 2000-03.
- M.Sc on Mathematics and the Foundations of Computer Science, Mathematical Institute, University of Oxford, 1999-2000.
- Diploma of Computer Engineering and Informatics, University of Patras, 1994-1999.

- Some of my collaborators: T. Müller, K. Panagiotou, D. Kühn, , D. Osthus , B. Reed , C. McDiarmid.