Nikolaos Fountoulakis

According to our database, Nikolaos Fountoulakis authored at least 37 papers between 2002 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Percolation on Random Graphs with a Fixed Degree Sequence.

Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau

SIAM J. Discret. Math., 2022

Algebraic and combinatorial expansion in random simplicial complexes.

Nikolaos Fountoulakis, Michal Przykucki

Random Struct. Algorithms, 2022

Best response dynamics on random graphs.

Jordan Chellig, Calina Durbac, Nikolaos Fountoulakis

Games Econ. Behav., 2022

2021

The modularity of random graphs on the hyperbolic plane.

Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman

J. Complex Networks, 2021

2020

Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs.

Nikolaos Fountoulakis, Mihyun Kang, Tamás Makai

Random Struct. Algorithms, 2020

2018

A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs.

Mohammed Amin Abdullah, Nikolaos Fountoulakis

Random Struct. Algorithms, 2018

2017

Typical distances in a geometric model for complex networks.

Mohammed Amin Abdullah, Nikolaos Fountoulakis, Michel Bode

Internet Math., 2017

2016

The probability of connectivity in a hyperbolic model of complex networks.

Michel Bode, Nikolaos Fountoulakis, Tobias Müller

Random Struct. Algorithms, 2016

Clustering and the Hyperbolic Geometry of Complex Networks.

Elisabetta Candellero, Nikolaos Fountoulakis

Internet Math., 2016

The Multiple-Orientability Thresholds for Random Hypergraphs.

Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou

Comb. Probab. Comput., 2016

2015

On the average-case complexity of parameterized clique.

Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin

Theor. Comput. Sci., 2015

On a geometrization of the Chung-Lu model for complex networks.

Nikolaos Fountoulakis

J. Complex Networks, 2015

On the Largest Component of a Hyperbolic Model of Complex Networks.

Michel Bode, Nikolaos Fountoulakis, Tobias Müller

Electron. J. Comb., 2015

Local Majority Dynamics on Preferential Attachment Graphs.

Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis

Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

2013

On the Insertion Time of Cuckoo Hashing.

Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger

SIAM J. Comput., 2013

Rumor spreading on random regular graphs and expanders.

Nikolaos Fountoulakis, Konstantinos Panagiotou

Random Struct. Algorithms, 2013

2012

Sharp load thresholds for cuckoo hashing.

Nikolaos Fountoulakis, Konstantinos Panagiotou

Random Struct. Algorithms, 2012

On the evolution of random graphs on spaces of negative curvature

Nikolaos Fountoulakis

CoRR, 2012

What I Tell You Three Times Is True: Bootstrap Percolation in Small Worlds.

Hamed Amini, Nikolaos Fountoulakis

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Ultra-fast rumor spreading in social networks.

Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Largest sparse subgraphs of random graphs.

Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid

Electron. Notes Discret. Math., 2011

3-Connected Cores In Random Planar Graphs.

Nikolaos Fountoulakis, Konstantinos Panagiotou

Comb. Probab. Comput., 2011

2010

The t-Stability Number of a Random Graph.

Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid

Electron. J. Comb., 2010

Reliable Broadcasting in Random Networks and the Effect of Density.

Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Orientability of Random Hypergraphs and the Power of Multiple Choices.

Nikolaos Fountoulakis, Konstantinos Panagiotou

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading.

Nikolaos Fountoulakis, Anna Huber

SIAM J. Discret. Math., 2009

Minors in random regular graphs.

Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus

Random Struct. Algorithms, 2009

Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting.

Anna Huber, Nikolaos Fountoulakis

Electron. Notes Discret. Math., 2009

A general critical condition for the emergence of a giant component in random graphs with given degrees.

Nikolaos Fountoulakis, Bruce A. Reed

Electron. Notes Discret. Math., 2009

Embeddings and Ramsey numbers of sparse <i>kappa</i>-uniform hypergraphs.

Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus

Comb., 2009

Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter.

Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008

The evolution of the mixing rate of a simple random walk on the giant component of a random graph.

Nikolaos Fountoulakis, Bruce A. Reed

Random Struct. Algorithms, 2008

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.

Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus

J. Comb. Theory B, 2008

2007

Percolation on Sparse Random Graphs with Given Degree Sequence.

Nikolaos Fountoulakis

Internet Math., 2007

Ramsey numbers of sparse hypergraphs.

Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus

Electron. Notes Discret. Math., 2007

The order of the largest complete minor in a random graph.

Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus

Electron. Notes Discret. Math., 2007

2002

Upper bounds on the non-3-colourability threshold of random graphs.

Nikolaos Fountoulakis, Colin McDiarmid

Discret. Math. Theor. Comput. Sci., 2002