BIS-Hardness for Ferromagnetic Potts in the Ordered Phase and Related Results. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (CoRR, 2013)

Inapproximability for antiferromagnetic spin systems in the tree non-uniqueness region. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (STOC, 2014)

Improved inapproximability results for counting independent sets in the hard-core model. - Andreas Galanis; Qi Ge; Daniel Stefankovic; Eric Vigoda; Linji Yang (Random Struct. Algorithms, 2014)

Phase transitions in the complexity of counting. - Andreas Galanis (2014)

Approximately Counting H-Colourings is # mathrm BIS # BIS -Hard. - Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum (ICALP (1), 2015)

Approximately Counting H-Colourings is #BIS-Hard. - Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum (CoRR, 2015)

Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (J. ACM, 2015)

A Complexity Trichotomy for Approximately Counting List H-Colourings. - Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum (ICALP, 2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. - Andreas Galanis; Leslie Ann Goldberg (SODA, 2016)

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (Comb. Probab. Comput., 2016)

The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. - Andreas Galanis; Leslie Ann Goldberg (Inf. Comput., 2016)

#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region. - Jin-Yi Cai; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Mark Jerrum; Daniel Stefankovic; Eric Vigoda (J. Comput. Syst. Sci., 2016)

Approximately Counting H-Colorings is $ # mathrm{BIS}$-Hard. - Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum (SIAM J. Comput., 2016)

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda; Linji Yang (SIAM J. Comput., 2016)

Rapid Mixing Swendsen-Wang Sampler for Stochastic Partitioned Attractive Models. - Sejun Park; Yunhun Jang; Andreas Galanis; Jinwoo Shin; Daniel Stefankovic; Eric Vigoda (AISTATS, 2017)

Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. - Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ICALP, 2017)

Amplifiers for the Moran Process. - Andreas Galanis; Andreas Göbel 001; Leslie Ann Goldberg; John Lapinskas; David Richerby (J. ACM, 2017)

A Complexity Trichotomy for Approximately Counting List H-Colorings. - Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum (ACM Trans. Comput. Theory, 2017)

Uniqueness for the 3-State Antiferromagnetic Potts Model on the Tree. - Andreas Galanis; Leslie Ann Goldberg; Kuan Yang 001 (CoRR, 2018)

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

A note on the high-fugacity hard-core model on bounded-degree bipartite expander graphs. - Andreas Galanis; Leslie Ann Goldberg; James Stewart 001 (CoRR, 2019)

Swendsen-Wang algorithm on the mean-field Potts model. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (Random Struct. Algorithms, 2019)

Approximation via Correlation Decay When Strong Spatial Mixing Fails. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Daniel Stefankovic (SIAM J. Comput., 2019)

The complexity of approximating averages on bounded-degree graphs. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (FOCS, 2020)

Inapproximability of the Independent Set Polynomial in the Complex Plane. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (SIAM J. Comput., 2020)

Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs. - Antonio Blanca; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic; Eric Vigoda; Kuan Yang 001 (SIAM J. Discret. Math., 2020)

Random Walks on Small World Networks. - Martin E. Dyer; Andreas Galanis; Leslie Ann Goldberg; Mark Jerrum; Eric Vigoda (ACM Trans. Algorithms, 2020)

Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. - Pjotr Buys; Andreas Galanis; Viresh Patel; Guus Regts (SODA, 2021)

Rapid Mixing for Colorings via Spectral Independence. - Zongchen Chen; Andreas Galanis; Daniel Stefankovic; Eric Vigoda (SODA, 2021)

Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems. - Andreas Galanis; Leslie Ann Goldberg; Kuan Yang 001 (J. Comput. Syst. Sci., 2021)

Fast algorithms at low temperatures via Markov chains. - Zongchen Chen; Andreas Galanis; Leslie Ann Goldberg; Will Perkins 001; James Stewart 001; Eric Vigoda (Random Struct. Algorithms, 2021)

Counting Solutions to Random CNF Formulas. - Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Kuan Yang 001 (SIAM J. Comput., 2021)

The Complexity of Approximating the Matching Polynomial in the Complex Plane. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ACM Trans. Comput. Theory, 2021)

Fast Algorithms for General Spin Systems on Bipartite Expanders. - Andreas Galanis; Leslie Ann Goldberg; James Stewart 001 (ACM Trans. Comput. Theory, 2021)

Metastability of the Potts Ferromagnet on Random Regular Graphs. - Amin Coja-Oghlan; Andreas Galanis; Leslie Ann Goldberg; Jean Bernoulli Ravelomanana; Daniel Stefankovic; Eric Vigoda (ICALP, 2022)

Approximating Observables Is as Hard as Counting. - Andreas Galanis; Daniel Stefankovic; Eric Vigoda (ICALP, 2022)

Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region. - Zongchen Chen; Andreas Galanis; Daniel Stefankovic; Eric Vigoda (SODA, 2022)

The complexity of approximating the complex-valued Potts model. - Andreas Galanis; Leslie Ann Goldberg; Andrés Herrera-Poyatos (Comput. Complex., 2022)

Fast sampling of satisfying assignments from random k-SAT. - Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Andrés Herrera-Poyatos (CoRR, 2022)

Fast mixing via polymers for random graphs with unbounded degree. - Andreas Galanis; Leslie Ann Goldberg; James Stewart 001 (Inf. Comput., 2022)

The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs. - Andreas Galanis; Leslie Ann Goldberg; Andrés Herrera-Poyatos (SIAM J. Discret. Math., 2022)

Inapproximability of Counting Hypergraph Colourings. - Andreas Galanis; Heng Guo 001; Jiaheng Wang 002 (ACM Trans. Comput. Theory, 2022)

Implementations and the independent set polynomial below the Shearer threshold. - Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (Theor. Comput. Sci., 2023)

On Sampling from Ising Models with Spectral Constraints. - Andreas Galanis; Alkis Kalavasis; Anthimos Vardis Kandiros (APPROX/RANDOM, 2024)

Learning Hard-Constrained Models with One Sample. - Andreas Galanis; Alkis Kalavasis; Anthimos Vardis Kandiros (SODA, 2024)

Planting and MCMC Sampling from the Potts model. - Andreas Galanis; Leslie Ann Goldberg; Paulina Smolarova (CoRR, 2024)

Fast Sampling of Satisfying Assignments from Random ( boldsymbol{k} )-SAT with Applications to Connectivity. - Zongchen Chen; Andreas Galanis; Leslie Ann Goldberg; Heng Guo 001; Andrés Herrera-Poyatos; Nitya Mani; Ankur Moitra (SIAM J. Discret. Math., 2024)

Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs. - Ivona Bezáková; Andreas Galanis; Leslie Ann Goldberg; Daniel Stefankovic (ACM Trans. Algorithms, 2024)

Low-Temperature Sampling on Sparse Random Graphs. - Andreas Galanis; Leslie Ann Goldberg; Paulina Smolarova (ICALP, 2025)

One-Shot Learning for k-SAT. - Andreas Galanis; Leslie Ann Goldberg; Xusheng Zhang (ICALP, 2025)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics. - Andreas Galanis; Leslie Ann Goldberg; Paulina Smolarova (Comb. Probab. Comput., 2025)