default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolaos Fountoulakis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j32]Jordan Chellig
, Calina Durbac, Nikolaos Fountoulakis:
Best response dynamics on random graphs. Games Econ. Behav. 131: 141-170 (2022)- [j31]Nikolaos Fountoulakis, Michal Przykucki:
Algebraic and combinatorial expansion in random simplicial complexes. Random Struct. Algorithms 60(3): 339-366 (2022) - [j30]Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau:
Percolation on Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 36(1): 1-46 (2022) - 2021
- [j29]Jordan Chellig, Nikolaos Fountoulakis, Fiona Skerman:
The modularity of random graphs on the hyperbolic plane. J. Complex Networks 10(1) (2021) - 2020
- [j28]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): 1134-1156 (2020) - [i8]Jordan Chellig, Calina Durbac, Nikolaos Fountoulakis:
Best response dynamics on random graphs. CoRR abs/2011.12983 (2020)
2010 – 2019
- 2018
- [j27]Mohammed Amin Abdullah, Nikolaos Fountoulakis:
A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. Random Struct. Algorithms 52(3): 379-418 (2018) - 2017
- [j26]Mohammed Amin Abdullah, Nikolaos Fountoulakis, Michel Bode:
Typical distances in a geometric model for complex networks. Internet Math. 2017 (2017) - 2016
- [j25]Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou:
The Multiple-Orientability Thresholds for Random Hypergraphs. Comb. Probab. Comput. 25(6): 870-908 (2016) - [j24]Elisabetta Candellero, Nikolaos Fountoulakis:
Clustering and the Hyperbolic Geometry of Complex Networks. Internet Math. 12(1-2): 2-53 (2016) - [j23]Michel Bode, Nikolaos Fountoulakis, Tobias Müller:
The probability of connectivity in a hyperbolic model of complex networks. Random Struct. Algorithms 49(1): 65-94 (2016) - [i7]Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau:
Percolation on random graphs with a fixed degree sequence. CoRR abs/1611.08496 (2016) - 2015
- [j22]Michel Bode, Nikolaos Fountoulakis, Tobias Müller:
On the Largest Component of a Hyperbolic Model of Complex Networks. Electron. J. Comb. 22(3): 3 (2015) - [j21]Nikolaos Fountoulakis:
On a geometrization of the Chung-Lu model for complex networks. J. Complex Networks 3(3): 361-387 (2015) - [j20]Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin:
On the average-case complexity of parameterized clique. Theor. Comput. Sci. 576: 18-29 (2015) - [c10]Mohammed Amin Abdullah, Michel Bode, Nikolaos Fountoulakis:
Local Majority Dynamics on Preferential Attachment Graphs. WAW 2015: 95-106 - 2014
- [j19]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. Eur. J. Comb. 35: 232-244 (2014) - [c9]Elisabetta Candellero, Nikolaos Fountoulakis:
Clustering and the Hyperbolic Geometry of Complex Networks. WAW 2014: 1-12 - [i6]Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin:
On the Average-case Complexity of Parameterized Clique. CoRR abs/1410.6400 (2014) - 2013
- [j18]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Rumor spreading on random regular graphs and expanders. Random Struct. Algorithms 43(2): 201-220 (2013) - [j17]Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger:
On the Insertion Time of Cuckoo Hashing. SIAM J. Comput. 42(6): 2156-2181 (2013) - [i5]Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou:
The Multiple-orientability Thresholds for Random Hypergraphs. CoRR abs/1309.6772 (2013) - 2012
- [j16]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Sharp load thresholds for cuckoo hashing. Random Struct. Algorithms 41(3): 306-333 (2012) - [c8]Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald:
Ultra-fast rumor spreading in social networks. SODA 2012: 1642-1660 - [c7]Hamed Amini, Nikolaos Fountoulakis:
What I Tell You Three Times Is True: Bootstrap Percolation in Small Worlds. WINE 2012: 462-474 - [i4]Nikolaos Fountoulakis:
On the evolution of random graphs on spaces of negative curvature. CoRR abs/1205.2923 (2012) - 2011
- [j15]Nikolaos Fountoulakis, Konstantinos Panagiotou:
3-Connected Cores In Random Planar Graphs. Comb. Probab. Comput. 20(3): 381-412 (2011) - [j14]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. Electron. Notes Discret. Math. 38: 349-354 (2011) - [c6]Nikolaos Fountoulakis, Megha Khosla, Konstantinos Panagiotou:
The Multiple-Orientability Thresholds for Random Hypergraphs. SODA 2011: 1222-1236 - 2010
- [j13]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
The t-Stability Number of a Random Graph. Electron. J. Comb. 17(1) (2010) - [c5]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Rumor Spreading on Random Regular Graphs and Expanders. APPROX-RANDOM 2010: 560-573 - [c4]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Orientability of Random Hypergraphs and the Power of Multiple Choices. ICALP (1) 2010: 348-359 - [c3]Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou:
Reliable Broadcasting in Random Networks and the Effect of Density. INFOCOM 2010: 2552-2560 - [i3]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Rumor Spreading on Random Regular Graphs and Expanders. CoRR abs/1002.3518 (2010) - [i2]Nikolaos Fountoulakis, Konstantinos Panagiotou, Angelika Steger:
On the Insertion Time of Cuckoo Hashing. CoRR abs/1006.1231 (2010)
2000 – 2009
- 2009
- [j12]Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs. Comb. 29(3): 263-297 (2009) - [j11]Anna Huber, Nikolaos Fountoulakis:
Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting. Electron. Notes Discret. Math. 34: 553-559 (2009) - [j10]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: 639-645 (2009) - [j9]Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
Minors in random regular graphs. Random Struct. Algorithms 35(4): 444-463 (2009) - [j8]Nikolaos Fountoulakis, Anna Huber:
Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading. SIAM J. Discret. Math. 23(4): 1964-1991 (2009) - [c2]Nikolaos Fountoulakis, Anna Huber, Konstantinos Panagiotou:
Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter. DISC 2009: 529-530 - [i1]Nikolaos Fountoulakis, Konstantinos Panagiotou:
Sharp Load Thresholds for Cuckoo Hashing. CoRR abs/0910.5147 (2009) - 2008
- [j7]Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers. J. Comb. Theory B 98(3): 484-505 (2008) - [j6]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): 68-86 (2008) - [j5]Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
The order of the largest complete minor in a random graph. Random Struct. Algorithms 33(2): 127-141 (2008) - [c1]Nikolaos Fountoulakis:
Percolation on sparse random graphs with given degree sequence. CTW 2008: 88-93 - 2007
- [j4]Daniela Kühn, Oliver Cooley, Nikolaos Fountoulakis, Deryk Osthus:
Ramsey numbers of sparse hypergraphs. Electron. Notes Discret. Math. 29: 29-33 (2007) - [j3]Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus:
The order of the largest complete minor in a random graph. Electron. Notes Discret. Math. 29: 141-146 (2007) - [j2]Nikolaos Fountoulakis:
Percolation on Sparse Random Graphs with Given Degree Sequence. Internet Math. 4(4): 329-356 (2007) - 2002
- [j1]Nikolaos Fountoulakis, Colin McDiarmid:
Upper bounds on the non-3-colourability threshold of random graphs. Discret. Math. Theor. Comput. Sci. 5(1): 205-226 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
