Charilaos Efthymiou

发表

On the Existence of Hamiltonian Cycles in Random Intersection Graphs

Paul G. Spirakis, Charilaos Efthymiou, P. Spirakis, 2005, ICALP.

Charting the Replica Symmetric Phase

Amin Coja-Oghlan, Charilaos Efthymiou, Mihyun Kang, 2017, APPROX-RANDOM.

Sharp thresholds for Hamiltonicity in random intersection graphs

Paul G. Spirakis, Charilaos Efthymiou, P. Spirakis, 2010, Theor. Comput. Sci..

Charting the Replica Symmetric Phase

Charilaos Efthymiou, Mihyun Kang, Nor Jaafari, 2017, APPROX-RANDOM.

Sampling Random Colorings of Sparse Random Graphs pdf

Thomas P. Hayes, Eric Vigoda, Charilaos Efthymiou, 2017, SODA.

Hamilton Cycles in Random Intersection Graphs

Charilaos Efthymiou, Paul Spirakis, P. Spirakis, 2016, Encyclopedia of Algorithms.

Switching Colouring of G(n, d/n) for Sampling up to Gibbs Uniqueness Threshold

Charilaos Efthymiou, 2014, ESA.

Local Convergence of Random Graph Colorings

Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, 2015, APPROX-RANDOM.

Energy balanced data propagation in wireless sensor networks

José D. P. Rolim, Sotiris E. Nikoletseas, Charilaos Efthymiou, 2006, Wirel. Networks.

Random sampling of colourings of sparse random graphs with a constant number of colours

Paul G. Spirakis, Charilaos Efthymiou, 2008, Theor. Comput. Sci..

A simple algorithm for random colouring G(n, d/n) using (2 + ε)d colours pdf

Charilaos Efthymiou, 2012, SODA.

Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees pdf

Charilaos Efthymiou, 2015, APPROX-RANDOM.

Broadcasting colourings on trees. A combinatorial view pdf

Charilaos Efthymiou, 2012, ArXiv.

A simple algorithm for random colouring G(n, d/n) using (2+\epsilon)d colours

Charilaos Efthymiou, 2011 .

A Simple Algorithm for Sampling Colorings of G(n, d/n) Up to The Gibbs Uniqueness Threshold pdf

Charilaos Efthymiou, 2016, SIAM J. Comput..

Random Instances of Problems in NP - Algorithms and Statistical Physics

Charilaos Efthymiou, Charilaos Efthymiou, 2015, Algorithms, Probability, Networks, and Games.

Improved Strong Spatial Mixing for Colorings on Trees

Thomas P. Hayes, Eric Vigoda, Charilaos Efthymiou, 2019, APPROX-RANDOM.

On independent sets in random graphs pdf

Amin Coja-Oghlan, Charilaos Efthymiou, A. Coja-Oghlan, 2010, SODA '11.

Planting Colourings Silently pdf

Amin Coja-Oghlan, Charilaos Efthymiou, Victor Bapst, 2014, Combinatorics, Probability and Computing.

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs pdf

Charilaos Efthymiou, Charilaos Efthymiou, 2020, ICALP.

Deterministic counting of graph colourings using sequences of subgraphs

Charilaos Efthymiou, 2020, Comb. Probab. Comput..

Energy Balanced Data Propagation in Wireless Sensor Networks

José D. P. Rolim, Sotiris E. Nikoletseas, Charilaos Efthymiou, 2004, IPDPS.

MCMC sampling colourings and independent sets of G(n, d/n) near uniqueness threshold pdf

Charilaos Efthymiou, 2014, SODA.

On the chromatic number of random regular graphs

Amin Coja-Oghlan, Charilaos Efthymiou, Samuel Hetterich, 2016, J. Comb. Theory, Ser. B.

Local Convergence of Random Graph Colorings

Amin Coja-Oghlan, Charilaos Efthymiou, Nor Jaafari, 2018, Comb..

Hamilton Cycles in Random Intersection Graphs

Paul G. Spirakis, Charilaos Efthymiou, P. Spirakis, 2008, Encyclopedia of Algorithms.

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model

Thomas P. Hayes, Eric Vigoda, Charilaos Efthymiou, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).