Nikolaos Fountoulakis

Publication Activity (10 Years)

Years Active: 2002-2022
Publications (10 Years): 16

Top Topics

Complex Networks

Learning Curves

Top Venues

Random Struct. Algorithms

J. Complex Networks

Publications

Jordan Chellig, Calina Durbac, Nikolaos Fountoulakis
Best response dynamics on random graphs. Games Econ. Behav. 131 (2022)
Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau
Percolation on Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 36 (1) (2022)
Nikolaos Fountoulakis, Michal Przykucki
Algebraic and combinatorial expansion in random simplicial complexes. Random Struct. Algorithms 60 (3) (2022)
Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman
The modularity of random graphs on the hyperbolic plane. J. Complex Networks 10 (1) (2021)
Jordan Chellig, Calina Durbac, Nikolaos Fountoulakis
Best response dynamics on random graphs. CoRR (2020)
Nikolaos Fountoulakis, Mihyun Kang, Tamás Makai
Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs. Random Struct. Algorithms 57 (4) (2020)
Mohammed Amin Abdullah, Nikolaos Fountoulakis
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. Random Struct. Algorithms 52 (3) (2018)
Mohammed Amin Abdullah, Nikolaos Fountoulakis, Michel Bode
Typical distances in a geometric model for complex networks. Internet Math. 2017 (2017)
Michel Bode, Nikolaos Fountoulakis, Tobias Müller
The probability of connectivity in a hyperbolic model of complex networks. Random Struct. Algorithms 49 (1) (2016)
Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou
The Multiple-Orientability Thresholds for Random Hypergraphs. Comb. Probab. Comput. 25 (6) (2016)
Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau
Percolation on random graphs with a fixed degree sequence. CoRR (2016)
Elisabetta Candellero, Nikolaos Fountoulakis
Clustering and the Hyperbolic Geometry of Complex Networks. Internet Math. 12 (1-2) (2016)
Nikolaos Fountoulakis
On a geometrization of the Chung-Lu model for complex networks. J. Complex Networks 3 (3) (2015)
Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis
Local Majority Dynamics on Preferential Attachment Graphs. WAW (2015)
Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
On the average-case complexity of parameterized clique. Theor. Comput. Sci. 576 (2015)
Michel Bode, Nikolaos Fountoulakis, Tobias Müller
On the Largest Component of a Hyperbolic Model of Complex Networks. Electron. J. Comb. 22 (3) (2015)
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
Largest sparse subgraphs of random graphs. Eur. J. Comb. 35 (2014)
Elisabetta Candellero, Nikolaos Fountoulakis
Clustering and the Hyperbolic Geometry of Complex Networks. WAW (2014)
Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin
On the Average-case Complexity of Parameterized Clique. CoRR (2014)
Nikolaos Fountoulakis, Konstantinos Panagiotou
Rumor spreading on random regular graphs and expanders. Random Struct. Algorithms 43 (2) (2013)
Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou
The Multiple-orientability Thresholds for Random Hypergraphs. CoRR (2013)
Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger
On the Insertion Time of Cuckoo Hashing. SIAM J. Comput. 42 (6) (2013)
Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald
Ultra-fast rumor spreading in social networks. SODA (2012)
Nikolaos Fountoulakis
On the evolution of random graphs on spaces of negative curvature CoRR (2012)
Nikolaos Fountoulakis, Konstantinos Panagiotou
Sharp load thresholds for cuckoo hashing. Random Struct. Algorithms 41 (3) (2012)
Hamed Amini, Nikolaos Fountoulakis
What I Tell You Three Times Is True: Bootstrap Percolation in Small Worlds. WINE (2012)
Nikolaos Fountoulakis, Konstantinos Panagiotou
3-Connected Cores In Random Planar Graphs. Comb. Probab. Comput. 20 (3) (2011)
Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou
The Multiple-Orientability Thresholds for Random Hypergraphs. SODA (2011)
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
Largest sparse subgraphs of random graphs. Electron. Notes Discret. Math. 38 (2011)
Nikolaos Fountoulakis, Konstantinos Panagiotou
Rumor Spreading on Random Regular Graphs and Expanders. APPROX-RANDOM (2010)
Nikolaos Fountoulakis, Konstantinos Panagiotou
Rumor Spreading on Random Regular Graphs and Expanders CoRR (2010)
Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou
Reliable Broadcasting in Random Networks and the Effect of Density. INFOCOM (2010)
Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger
On the Insertion Time of Cuckoo Hashing CoRR (2010)
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
The t-Stability Number of a Random Graph. Electron. J. Comb. 17 (1) (2010)
Nikolaos Fountoulakis, Konstantinos Panagiotou
Orientability of Random Hypergraphs and the Power of Multiple Choices. ICALP (1) (2010)
Anna Huber, Nikolaos Fountoulakis
Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting. Electron. Notes Discret. Math. 34 (2009)
Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
-uniform hypergraphs. Comb. 29 (3) (2009)
Nikolaos Fountoulakis, Anna Huber
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading. SIAM J. Discret. Math. 23 (4) (2009)
Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
Minors in random regular graphs. Random Struct. Algorithms 35 (4) (2009)
Nikolaos Fountoulakis, Konstantinos Panagiotou
Sharp Load Thresholds for Cuckoo Hashing CoRR (2009)
Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. DISC (2009)
Nikolaos Fountoulakis, Bruce A. Reed
A general critical condition for the emergence of a giant component in random graphs with given degrees. Electron. Notes Discret. Math. 34 (2009)
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) (2008)
Nikolaos Fountoulakis
Percolation on sparse random graphs with given degree sequence. CTW (2008)
Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
The order of the largest complete minor in a random graph. Random Struct. Algorithms 33 (2) (2008)
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) (2008)
Nikolaos Fountoulakis
Percolation on Sparse Random Graphs with Given Degree Sequence. Internet Math. 4 (4) (2007)
Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus
The order of the largest complete minor in a random graph. Electron. Notes Discret. Math. 29 (2007)
Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus
Ramsey numbers of sparse hypergraphs. Electron. Notes Discret. Math. 29 (2007)
Nikolaos Fountoulakis, Colin McDiarmid
Upper bounds on the non-3-colourability threshold of random graphs. Discret. Math. Theor. Comput. Sci. 5 (1) (2002)