Andreas Galanis
ScholarGPS® ID: 20519104707054
Affiliation History
Discipline
Computer Science
Top Specialties
Combinatorial Optimization | Mathematical Optimization | Food Coloring | Ising Model
Metrics Summary
Publication Count
45
Predicted Citations
568
Predicted h-index
13
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
|
Add
Delete
|
|---|
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs (journal article) ACM Transactions on Algorithms, volume 20, issue 1, pages 1-26 (2024). |
Metastability of the Potts Ferromagnet on Random Regular Graphs (journal article) Communications in Mathematical Physics, volume 401, issue 1, pages 185-225 (2023). |
Theoretical Computer Science, volume 939 (2023). |
Inapproximability of Counting Hypergraph Colourings (journal article) ACM Transactions on Computation Theory, volume 14, issue 3-4, pages 1-33 (2022). |
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (journal article) SIAM Journal on Discrete Mathematics, volume 36, issue 3, pages 2159-2204 (2022). |
The complexity of approximating the complex-valued Potts model (journal article) computational complexity, volume 31, issue 1 (2022). |
Fast mixing via polymers for random graphs with unbounded degree (journal article) Information and Computation, volume 285 (2022). |
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region (book chapter) In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) Society for Industrial and Applied Mathematics (2022) |
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (journal article) Forum of Mathematics, Sigma, volume 10 (2022). |
Fast Algorithms for General Spin Systems on Bipartite Expanders (journal article) ACM Transactions on Computation Theory, volume 13, issue 4, pages 1-18 (2021). |
ACM Transactions on Computation Theory, volume 13, issue 2, pages 1-37 (2021). |
Fast algorithms at low temperatures via Markov chains† (journal article) Random Structures & Algorithms, volume 58, issue 2, pages 294-321 (2021). |
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems (journal article) Journal of Computer and System Sciences, volume 115 (2021). |
Counting Solutions to Random CNF Formulas (journal article) SIAM Journal on Computing, volume 50, issue 6, pages 1701-1738 (2021). |
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs (book chapter) In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) Society for Industrial and Applied Mathematics (2021) |
Rapid Mixing for Colorings via Spectral Independence (book chapter) In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) Society for Industrial and Applied Mathematics (2021) |
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA |
Random Walks on Small World Networks (journal article) ACM Transactions on Algorithms, volume 16, issue 3, pages 1-33 (2020). |
Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs (journal article) SIAM Journal on Discrete Mathematics, volume 34, issue 1, pages 742-793 (2020). |
Inapproximability of the Independent Set Polynomial in the Complex Plane (journal article) SIAM Journal on Computing, volume 49, issue 5, pages STOC18-395-STOC18-448 (2020). |