List of Publications
Journals

C. Efthymiou, T. Hayes, D. Stefankovic, E. Vigoda and Y. Yin. Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the HardCore Model. In SIAM Journal on Computing (SICOMP), 48(2), pp. 581643, 2019 (special issue).

A. CojaOghlan, C. Efthymiou, N. Jaafari, M. Kang and T. Kapetanopoulos. Charting the Replica Symmetric Phase. In Communications in Mathematical Physics (CIMP), 359(2), pp. 603698, 2018.

A. CojaOghlan, C. Efthymiou and N. Jafaari. Local convergence of random graph colorings. In Combinatorica 38(2), pp. 341380, 2018.

V. Bapst, A. CojaOghlan and C. Efthymiou. Planting colorings silently. In Combinatorics Probability and Computing (CPC), 26(3), pp. 338366, 2017.

C. Efthymiou. A simple algorithm for sampling colourings of G(n,d/n) up to Uniqueness threshold. In SIAM Journal on Computing (SICOMP), 45(6), pp. 20872116, 2016.

A. CojaOghlan, C. Efthymiou and S. Hetterich. On the chromatic number of random regular graphs. In Journal of Combinatorial Theory Series B (JCTB), 116, pp. 367439, 2016.

A. CojaOghlan and C. Efthymiou. On independent sets in random graphs. In Random Structures and Algorithms (RSA), 47(3), pp. 436486, 2015.
 C. Efthymiou. â€¨Deterministic counting of graph colourings using sequences of subgraphs. In Combinatorics Probability and Computing (CPC), 29(4), pp. 555586, 2020.

C. Efthymiou and P. G. Spirakis. Sharp Thresholds for Hamiltonicity in Random Intersection Graphs. In Theoretical Computer Science (TCS), 411, pp. 37143730, 2010.

C. Efthymiou and P. G. Spirakis. Random sampling of colourings of sparse random graphs with a constant number of colours. In Theoretical Computer Science (TCS), 407, pp. 134154, 2008.

C. Efthymiou, S. Nikoletseas and J. Rolim. Energy Balanced Data Propagation in Wireless Sensor Networks. Invited paper in Wireless Networks Journal (WINET), 12(6) pp. 691707, 2006 (special issue).
Conferences (peer reviewed)
 C. Efthymiou and K. Zampetakis. Broadcasting with Random Matrices. To appear in ICALP'23.
 C. Efthymiou and W. Feng. On the Mixing Time of Glauber Dynamics for the Hardcore and Related Models on G(n,d/n). To appear in ICALP'23.
 C. Efthymiou. On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs. In the proc. of the 49th International Colloquium on Automata, Languages, and Programming (ICALP'22), pp 57:157:16, 2022.
 C. Efthymiou, A. Galanis, T. P. Hayes, D. Stefankovic and E. Vigoda. Improved Strong Spatial Mixing for Colorings on Trees. In the proc. of APPROXRANDOM'19, pp. 48:148:16, 2019.

C. Efthymiou, T. Hayes, D. Stefankovic and E. Vigoda. Sampling Random Colorings of Sparse Random Graphs. In the proc. of the 29th ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 1759 1771, 2018.

A. CojaOghlan, C. Efthymiou, N. Jaafari, M. Kang and T. Kapetanopoulos. Charting the Replica Symmetry Phase. In the proc. of RANDOMAPPROX'17, pp. 40:140:17, 2017.

C. Efthymiou, T. Hayes, D. Stefankovic, E. Vigoda and Y. Yin. Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the HardCore Model. In the proc. of the 57th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 704713, 2016.

C. Efthymiou. Reconstruction/Nonreconstruction Thresholds for Colourings of General GaltonWatson Trees. In the proc. of RANDOMAPPROX'15, pp. 756774, 2015.

A. CojaOghlan, C. Efthymiou and N. Jafaari. Local convergence of random graph colorings. In the proc. of RANDOMAPPROX'15, pp. 726737, 2015.

C. Efthymiou. Switching colourings of G(n,d/n) for sampling up to Gibbs Uniqueness Threshold. In the proc. of the 22nd European Symposium on Algorithms (ESA), pp. 371381, 2014.

C. Efthymiou. MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold. In the proc. of the 25th ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 305316, 2014.

C. Efthymiou. A simple algorithm for random colouring G(n, d/n) using (2+Îµ)d colours. In the proc. of the 23rd ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 272280, 2012.

A. CojaOghlan and C. Efthymiou. On independent sets in random graphs. In the proc. of the 22nd ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 136144, 2011.

C. Efthymiou and P.G. Spirakis. On the Existence of Hamilton Cycles in Random Intersection Graphs. In the proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), pp. 690701, 2005.

C. Efthymiou, S. Nikoletseas and J. Rolim. Energy Balanced Data Propagation in Wireless Sensor Networks. In the proc. of the 4th Int. Workshop on Algorithms for Wireless Mobile AdHoc and Sensor Networks (WMAN), IPDPS 2004, p.225, 2004.
Misc.

C. Efthymiou. Random Instances of problems in NP  Algorithms and Statistical Physics. In Algorithms, Probability, Networks, and Games, Springer LNCS, pp 196222, 2015.
 C. Efthymiou and P. G. Spirakis.On the Existence of Hamilton Cycles in Random Intersection Graphs. In Encyclopaedia of Algorithms (Editor MingYang Kao), Springer, 2008.