A simple algorithm for random colouring G(n, d/n) using (2+ε)d colours - Charilaos Efthymiou 001 (CoRR, 2011)

A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours. - Charilaos Efthymiou 001 (SODA, 2012)

Broadcasting colourings on trees. A combinatorial view - Charilaos Efthymiou 001 (CoRR, 2012)

MCMC sampling colourings and independent sets of G(n,d/n) near the uniqueness threshold - Charilaos Efthymiou 001 (CoRR, 2013)

Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness Threshold. - Charilaos Efthymiou 001 (ESA, 2014)

MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold. - Charilaos Efthymiou 001 (SODA, 2014)

Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees. - Charilaos Efthymiou 001 (APPROX-RANDOM, 2015)

Random Instances of Problems in NP - Algorithms and Statistical Physics. - Charilaos Efthymiou 001 (Algorithms, Probability, Networks, and Games, 2015)

On independent sets in random graphs. - Amin Coja-Oghlan; Charilaos Efthymiou 001 (Random Struct. Algorithms, 2015)

A simple algorithm for sampling colourings of G(n, d/n) up to Gibbs Uniqueness Threshold. - Charilaos Efthymiou 001 (CoRR, 2016)

On the chromatic number of random regular graphs. - Amin Coja-Oghlan; Charilaos Efthymiou 001; Samuel Hetterich (J. Comb. Theory B, 2016)

A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold. - Charilaos Efthymiou 001 (SIAM J. Comput., 2016)

Charting the Replica Symmetric Phase. - Amin Coja-Oghlan; Charilaos Efthymiou 001; Nor Jaafari; Mihyun Kang; Tobias Kapetanopoulos (APPROX-RANDOM, 2017)

Planting Colourings Silently. - Victor Bapst; Amin Coja-Oghlan; Charilaos Efthymiou 001 (Comb. Probab. Comput., 2017)

Sampling Random Colorings of Sparse Random Graphs. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (SODA, 2018)

Local Convergence of Random Graph Colorings. - Amin Coja-Oghlan; Charilaos Efthymiou 001; Nor Jaafari (Comb., 2018)

Phase transitions and dynamics for random constraint satisfaction problems - Charilaos Efthymiou 001 (2018)

Improved Strong Spatial Mixing for Colorings on Trees. - Charilaos Efthymiou 001; Andreas Galanis; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (APPROX-RANDOM, 2019)

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda; Yitong Yin (SIAM J. Comput., 2019)

Deterministic counting of graph colourings using sequences of subgraphs. - Charilaos Efthymiou 001 (Comb. Probab. Comput., 2020)

On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs. - Charilaos Efthymiou 001 (ICALP, 2022)

Spectral Independence Beyond Uniqueness using the topological method. - Charilaos Efthymiou 001 (CoRR, 2022)

On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n, d/n). - Charilaos Efthymiou 001; Weiming Feng 001 (ICALP, 2023)

Broadcasting with Random Matrices. - Charilaos Efthymiou 001; Kostas Zampetakis (ICALP, 2023)

On sampling diluted Spin-Glasses using Glauber Dynamics. - Charilaos Efthymiou 001; Kostas Zampetakis (COLT, 2024)

On sampling two spin models using the local connective constant. - Charilaos Efthymiou 001 (CoRR, 2024)

Optimal mixing via tensorization for random independent sets on arbitrary trees. - Charilaos Efthymiou 001; Thomas P. Hayes; Daniel Stefankovic; Eric Vigoda (Comb. Probab. Comput., 2025)