Energy balanced data propagation in wireless sensor networks C Efthymiou, S Nikoletseas, J Rolim
18th International Parallel and Distributed Processing Symposium, 2004 …, 2004
274 2004 On independent sets in random graphs A Coja‐Oghlan, C Efthymiou
Random Structures & Algorithms 47 (3), 436-486, 2015
107 2015 Charting the replica symmetric phase A Coja-Oghlan, C Efthymiou, N Jaafari, M Kang, T Kapetanopoulos
Communications in Mathematical Physics 359, 603-698, 2018
47 2018 Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model C Efthymiou, TP Hayes, D Stefankovic, E Vigoda, Y Yin
SIAM Journal on Computing 48 (2), 581-643, 2019
44 2019 On the chromatic number of random regular graphs A Coja-Oghlan, C Efthymiou, S Hetterich
Journal of Combinatorial Theory, Series B 116, 367-439, 2016
43 2016 Sampling random colorings of sparse random graphs C Efthymiou, TP Hayes, D Štefankovič, E Vigoda
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
25 2018 Planting colourings silently V Bapst, A Coja-Oghlan, C Efthymiou
Combinatorics, probability and computing 26 (3), 338-366, 2017
25 2017 On the existence of Hamiltonian cycles in random intersection graphs C Efthymiou, PG Spirakis
Automata, Languages and Programming: 32nd International Colloquium, ICALP …, 2005
25 2005 MCMC sampling colourings and independent sets of G (n, d /n ) near uniqueness threshold C Efthymiou
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
22 2014 A simple algorithm for random colouring G (n , d /n ) using (2 + ε)d colours. C Efthymiou
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
20 2012 Sharp thresholds for Hamiltonicity in random intersection graphs C Efthymiou, PG Spirakis
Theoretical Computer Science 411 (40-42), 3714-3730, 2010
17 2010 Local convergence of random graph colorings A Coja-Oghlan, C Efthymiou, N Jaafari
Combinatorica 38 (2), 341-380, 2018
13 2018 Random sampling of colourings of sparse random graphs with a constant number of colours C Efthymiou, PG Spirakis
Theoretical Computer Science 407 (1-3), 134-154, 2008
13 2008 Reconstruction/non-reconstruction thresholds for colourings of general Galton-Watson trees C Efthymiou
arXiv preprint arXiv:1406.3617, 2014
12 2014 Switching Colouring of G (n ,d /n ) for Sampling up to Gibbs Uniqueness Threshold C Efthymiou
Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014
12 2014 A Simple Algorithm for Sampling Colorings of Up to The Gibbs Uniqueness Threshold C Efthymiou
SIAM Journal on Computing 45 (6), 2087-2116, 2016
11 2016 On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs C Efthymiou
arXiv preprint arXiv:2007.07145, 2020
10 2020 Improved strong spatial mixing for colorings on trees C Efthymiou, A Galanis, TP Hayes, D Stefankovic, E Vigoda
arXiv preprint arXiv:1909.07059, 2019
9 2019 On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G (n, d/n) C Efthymiou, W Feng
arXiv preprint arXiv:2302.06172, 2023
3 2023 Randomly colouring sparse random graphs using a constant number of colours C Efthymiou, PG Spirakis
Technical report, 2007
3 2007