| 2026 | STACS | Planting and MCMC Sampling from the Potts Model. | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2025 | ICALP | Low-Temperature Sampling on Sparse Random Graphs. | Andreas Galanis, Leslie Ann Goldberg, Paulina Smolarova |
| 2025 | ICALP | One-Shot Learning for k-SAT. | Andreas Galanis, Leslie Ann Goldberg, Xusheng Zhang |
| 2024 | SODA | Learning Hard-Constrained Models with One Sample. | Andreas Galanis, Alkis Kalavasis, Anthimos Vardis Kandiros |
| 2022 | ICALP | Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2022 | ICALP | Metastability of the Potts Ferromagnet on Random Regular Graphs. | Amin Coja-Oghlan, Andreas Galanis, Leslie Ann Goldberg, Jean Bernoulli Ravelomanana, Daniel Stefankovic, Eric Vigoda |
| 2022 | ICALP | Approximating Observables Is as Hard as Counting. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2022 | SODA | Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. | Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2021 | SODA | Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. | Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts |
| 2021 | SODA | Rapid Mixing for Colorings via Spectral Independence. | Zongchen Chen, Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2020 | FOCS | The complexity of approximating averages on bounded-degree graphs. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
| 2020 | ICALP | Counting Solutions to Random CNF Formulas. | Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Kuan Yang |
| 2020 | MFCS | The Complexity of Approximating the Complex-Valued Potts Model. | Andreas Galanis, Leslie Ann Goldberg, Andrs Herrera-Poyatos |
| 2020 | MFCS | Fast Algorithms for General Spin Systems on Bipartite Expanders. | Andreas Galanis, Leslie Ann Goldberg, James Stewart |
| 2019 | ICALP | The Complexity of Approximating the Matching Polynomial in the Complex Plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2018 | STOC | Inapproximability of the independent set polynomial in the complex plane. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | AISTATS | Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. | Sejun Park, Yunhun Jang, Andreas Galanis, Jinwoo Shin, Daniel Stefankovic, Eric Vigoda |
| 2017 | ICALP | Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. | Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | ICALP | Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems. | Andreas Galanis, Leslie Ann Goldberg, Kuan Yang |
| 2016 | ICALP | Approximation via Correlation Decay When Strong Spatial Mixing Fails. | Ivona Bezkov, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic |
| 2016 | ICALP | Amplifiers for the Moran Process. | Andreas Galanis, Andreas Gbel, Leslie Ann Goldberg, John Lapinskas, David Richerby |
| 2016 | ICALP | A Complexity Trichotomy for Approximately Counting List H-Colourings. | Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum |
| 2016 | SODA | The complexity of approximately counting in 2-spin systems on | Andreas Galanis, Leslie Ann Goldberg |
| 2015 | ICALP | Approximately Counting H-Colourings is #\mathrm BIS # BIS -Hard. | Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum |
| 2014 | STOC | Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |