Concepedia

Andreas Galanis

AG

14

Publications

432

Citations

12

H-Index

2011

Active since

Affiliations

University of Rochester(Current)

Georgia Institute of Technology

University of Oxford

University of Illinois Chicago

Queen Mary University of London

Andreas Galanis is an author at University of Rochester specializing in computational complexity, graph theory, and engineering.

Top concepts

Computational ComplexityEngineeringGraph TheoryDiscrete MathematicsPhysicsSpin SystemsComputer ScienceProbabilityCondensed Matter TheoryEntropy

Publications per year

2011–2023

14

Publications

14

Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models

Andreas Galanis, Daniel Štefankovič, Eric Vigoda · Combinatorics Probability Computing · 2016 · 120 citations · Full text

Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results

Andreas Galanis, Daniel Štefankovič, Eric Vigoda et al. · SIAM Journal on Computing · 2016 · 52 citations

Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region

Andreas Galanis, Daniel Štefankovič, Eric Vigoda · Journal of the ACM · 2015 · 50 citations

Spectral Theory, Partition Function, Engineering +24

#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 et al. · Journal of Computer and System Sciences · 2015 · 38 citations · Full text

Engineering, Graph Theory, Algebraic Graph Theory +10

Improved inapproximability results for counting independent sets in the hard‐core model

Andreas Galanis, Qi Ge, Daniel Štefankovič et al. · Random Structures and Algorithms · 2012 · 29 citations

Computational Complexity Theory, Engineering, Computational Complexity +19

Rows per page

1–5 of 14