Andreas Galanis

Cited by

	All	Since 2019
Citations	1118	916
h-index	17	17
i10-index	29	28

260

130

195

201120122013201420152016201720182019202020212022202320244 5 21 25 26 32 34 39 87 75 115 163 244 222

Public access

View all

26 articles

1 article

available

not available

Based on funding mandates

Co-authors

Leslie Ann GoldbergProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Daniel StefankovicUniversity of RochesterVerified email at cs.rochester.edu
Eric VigodaUniversity of California Santa BarbaraVerified email at ucsb.edu
Heng GuoUniversity of EdinburghVerified email at inf.ed.ac.uk
Zongchen ChenGeorgia TechVerified email at gatech.edu
Linji YangFacebook.com, Georgia Institute of TechnologyVerified email at fb.com
James StewartPhD Student, University of OxfordVerified email at cs.ox.ac.uk
Kuan YangUniversity of OxfordVerified email at cs.ox.ac.uk
Andrés Herrera-PoyatosPost Doctoral Researcher in Deep Learning - University of Granada. PhD from the University of OxfordVerified email at correo.ugr.es
Jin-Yi CaiUniversity of Wisconsin - MadisonVerified email at cs.wisc.edu
Will PerkinsGeorgia Institute of TechnologyVerified email at willperkins.org
David RicherbyUniversity of EssexVerified email at essex.ac.uk
John LapinskasLecturer in Computer Science, University of BristolVerified email at bristol.ac.uk
Andreas GöbelHasso Plattner Institute, University of PotsdamVerified email at hpi.de
Antonio BlancaAssociate Professor, CSE Department, Penn StateVerified email at cse.psu.edu
Paulina SmolarovaDPhil at Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Amin Coja-OghlanTU DortmundVerified email at tu-dortmund.de
Guus RegtsAssociate Professor at University of AmsterdamVerified email at uva.nl
Pjotr BuysPostdoc, University of AmsterdamVerified email at uva.nl
Martin DyerUniversity of LeedsVerified email at leeds.ac.uk

Andreas Galanis

University of Oxford

Verified email at cs.ox.ac.uk - Homepage

Algorithms and Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models A Galanis, D Štefankovič, E Vigoda Combinatorics, Probability and Computing 25 (4), 500-559, 2016	168	2016
Inapproximability for antiferromagnetic spin systems in the tree nonuniqueness region A Galanis, D Štefankovič, E Vigoda Journal of the ACM (JACM) 62 (6), 50, 2015	104	2015
Improved inapproximability results for counting independent sets in the hard‐core model A Galanis, Q Ge, D Štefankovič, E Vigoda, L Yang Random Structures & Algorithms 45 (1), 78-110, 2014	79	2014
Rapid mixing for colorings via spectral independence Z Chen, A Galanis, D Štefankovič, E Vigoda Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	73	2021
Ferromagnetic Potts model: Refined# BIS-hardness and related results A Galanis, D Stefankovic, E Vigoda, L Yang SIAM Journal on Computing 45 (6), 2004-2065, 2016	73	2016
# BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region JY Cai, A Galanis, LA Goldberg, H Guo, M Jerrum, D Štefankovič, ... Journal of Computer and System Sciences 82 (5), 690-711, 2016	54	2016
Fast algorithms at low temperatures via Markov chains Z Chen, A Galanis, LA Goldberg, W Perkins, J Stewart, E Vigoda Random Structures & Algorithms 58 (2), 294-321, 2021	48	2021
Amplifiers for the Moran process A Galanis, A Göbel, LA Goldberg, J Lapinskas, D Richerby Journal of the ACM (JACM) 64 (1), 5, 2017	47	2017
Swendsen‐Wang algorithm on the mean‐field Potts model A Galanis, D Štefankovič, E Vigoda Random Structures & Algorithms 54 (1), 82-147, 2019	46	2019
Inapproximability of the independent set polynomial in the complex plane I Bezáková, A Galanis, LA Goldberg, D Stefankovic SIAM Journal on Computing 49 (5), STOC18-395-STOC18-448, 2019	43	2019
Approximation via correlation decay when strong spatial mixing fails I Bezáková, A Galanis, LA Goldberg, H Guo, D Stefankovic SIAM Journal on Computing 48 (2), 279-349, 2019	42	2019
Sampling in uniqueness from the Potts and random-cluster models on random regular graphs A Blanca, A Galanis, LA Goldberg, D Stefankovic, E Vigoda, K Yang SIAM Journal on Discrete Mathematics 34 (1), 742-793, 2020	30	2020
Counting solutions to random CNF formulas A Galanis, LA Goldberg, H Guo, K Yang SIAM Journal on Computing 50 (6), 1701-1738, 2021	28	2021
Approximately Counting -Colorings is -Hard A Galanis, LA Goldberg, M Jerrum SIAM Journal on Computing 45 (3), 680-711, 2016	26	2016
Fast algorithms for general spin systems on bipartite expanders A Galanis, LA Goldberg, J Stewart ACM Transactions on Computation Theory (TOCT) 13 (4), 1-18, 2021	25	2021
Metastability of the Potts ferromagnet on random regular graphs A Coja-Oghlan, A Galanis, LA Goldberg, JB Ravelomanana, ... Communications in Mathematical Physics 401 (1), 185-225, 2023	18	2023
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region∗ Z Chen, A Galanis, D Štefankovič, E Vigoda Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022	17	2022
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs P Buys, A Galanis, V Patel, G Regts Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	16	2021
Fast sampling of satisfying assignments from random k-SAT with applications to connectivity Z Chen, A Galanis, L Goldberg, H Guo, A Herrera-Poyatos, N Mani, ... SIAM Journal on Discrete Mathematics, 2024	14*	2024
The complexity of approximating the matching polynomial in the complex plane I Bezáková, A Galanis, LA Goldberg, D Štefankovič ACM Transactions on Computation Theory (TOCT) 13 (2), 1-37, 2021	14	2021

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors