Nikolaos Fountoulakis

Orcid: 0000-0002-5751-7575

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Percolation on Random Graphs with a Fixed Degree Sequence.
SIAM J. Discret. Math., 2022

Algebraic and combinatorial expansion in random simplicial complexes.
Random Struct. Algorithms, 2022

Best response dynamics on random graphs.
Games Econ. Behav., 2022

2021
The modularity of random graphs on the hyperbolic plane.
J. Complex Networks, 2021

2020
Resolution of a conjecture on majority dynamics: Rapid stabilization in dense random graphs.
Random Struct. Algorithms, 2020

2018
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs.
Random Struct. Algorithms, 2018

2017
Typical distances in a geometric model for complex networks.
Internet Math., 2017

2016
The probability of connectivity in a hyperbolic model of complex networks.
Random Struct. Algorithms, 2016

Clustering and the Hyperbolic Geometry of Complex Networks.
Internet Math., 2016

The Multiple-Orientability Thresholds for Random Hypergraphs.
Comb. Probab. Comput., 2016

2015
On the average-case complexity of parameterized clique.
Theor. Comput. Sci., 2015

On a geometrization of the Chung-Lu model for complex networks.
J. Complex Networks, 2015

On the Largest Component of a Hyperbolic Model of Complex Networks.
Electron. J. Comb., 2015

Local Majority Dynamics on Preferential Attachment Graphs.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

2013
On the Insertion Time of Cuckoo Hashing.
SIAM J. Comput., 2013

Rumor spreading on random regular graphs and expanders.
Random Struct. Algorithms, 2013

2012
Sharp load thresholds for cuckoo hashing.
Random Struct. Algorithms, 2012

On the evolution of random graphs on spaces of negative curvature
CoRR, 2012

What I Tell You Three Times Is True: Bootstrap Percolation in Small Worlds.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Ultra-fast rumor spreading in social networks.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Largest sparse subgraphs of random graphs.
Electron. Notes Discret. Math., 2011

3-Connected Cores In Random Planar Graphs.
Comb. Probab. Comput., 2011

2010
The t-Stability Number of a Random Graph.
Electron. J. Comb., 2010

Reliable Broadcasting in Random Networks and the Effect of Density.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Orientability of Random Hypergraphs and the Power of Multiple Choices.
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.
SIAM J. Discret. Math., 2009

Minors in random regular graphs.
Random Struct. Algorithms, 2009

Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting.
Electron. Notes Discret. Math., 2009

A general critical condition for the emergence of a giant component in random graphs with given degrees.
Electron. Notes Discret. Math., 2009

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

Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter.
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.
Random Struct. Algorithms, 2008

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers.
J. Comb. Theory B, 2008

2007
Percolation on Sparse Random Graphs with Given Degree Sequence.
Internet Math., 2007

Ramsey numbers of sparse hypergraphs.
Electron. Notes Discret. Math., 2007

The order of the largest complete minor in a random graph.
Electron. Notes Discret. Math., 2007

2002
Upper bounds on the non-3-colourability threshold of random graphs.
Discret. Math. Theor. Comput. Sci., 2002


  Loading...