2018

Coja-Oghlan, Amin, Efthymiou, Charilaos, Jaafari, Nor, Kang, Mihyun and Kapetanopoulos, Tobias (2018) Charting the replica symmetric phase. Communications in Mathematical Physics, 359 (2). pp. 603-698. doi:10.1007/s00220-018-3096-x

Coja-Oghlan, Amin, Efthymiou, Charilaos and Jaafari, Nor (2018) Local convergence of random graph colorings. Combinatorica, 38 (2). pp. 341-380. doi:10.1007/s00493-016-3394-x

Efthymiou, Charilaos, Hayes, Thomas, Štefankovič, Daniel and Vigoda, Eric (2018) Sampling random colorings of sparse random graphs. In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7-10 Jan 2018. Published in: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1759-1771. ISBN 9781611975031. doi:10.1137/1.9781611975031.115

2016

Efthymiou, Charilaos, Hayes, Thomas, Štefankovič, Daniel, Vigoda, Eric and Yin, Yitong (2016) Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model [conference item]. In: 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016), New Brunswick, New Jersey, USA, 9-11 Oct 2016. Published in: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) pp. 704-713. ISBN 9781509039333. ISSN 0272-5428. doi:10.1109/FOCS.2016.80

Efthymiou, Charilaos (2016) A simple algorithm for sampling colourings of G(N,D/N) up to Gibbs Uniqueness threshold. SIAM Journal on Computing, 45 (6). pp. 2087-2116. doi:10.1137/140977643

2014

Efthymiou, Charilaos (2014) MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold. In: 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, Oregon, USA, 5-7 Jan 2014. Published in: SODA '14 Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms pp. 305-316. ISBN 9781611973389. doi:10.1137/1.9781611973402.22

2012

Efthymiou, Charilaos (2012) A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours. In: 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17-19 Jan 2012. Published in: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms pp. 272-280. ISSN 9781611972108.

2011

Coja-Oghlan, Amin and Efthymiou, Charilaos (2011) On independent sets in random graphs. In: Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA, 23 - 25 Jan 2011. Published in: SODA '11 Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms pp. 136-144.

2010

Efthymiou, Charilaos and Spirakis, Paul G. (2010) Sharp thresholds for Hamiltonicity in random intersection graphs. Theoretical Computer Science, Vol.411 (No.40-42). pp. 3714-3730. doi:10.1016/j.tcs.2010.06.022