Search results
Results: 53
Number of items: 53
-
Barvinok, A., & Regts, G. (2019). Weighted counting of solutions to sparse systems of equations. Combinatorics Probability and Computing, 28(5), 696-719. https://doi.org/10.1017/S0963548319000105
-
Helmuth, T., Perkins, W., & Regts, G. (2019). Algorithmic Pirogov-Sinai theory. In M. Charikar, & E. Cohen (Eds.), STOC '19: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (pp. 1009-1020). Association for Computing Machinery. https://doi.org/10.1145/3313276.3316305
-
Patel, V., & Regts, G. (2019). Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Algorithmica, 81(5), 1844–1858. https://doi.org/10.1007/s00453-018-0511-9 -
Kang, R. J., Patel, V., & Regts, G. (2019). Discrepancy and large dense monochromatic subsets. Journal of Algebraic Combinatorics, 10(1), 87-109. https://doi.org/10.4310/JOC.2019.v10.n1.a4 -
Regts, G. (2018). Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits. Combinatorica, 38(4), 987–1015. https://doi.org/10.1007/s00493-016-3506-7
-
Goodall, A., Krajewski, T., Regts, G., & Vena, L. (2018). A Tutte Polynomial for Maps. Combinatorics Probability and Computing, 27(6), 913-945. https://doi.org/10.1017/S0963548318000081
-
Patel, V., & Regts, G. (2017). Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM Journal on Computing, 46(6), 1893-1919. https://doi.org/10.1137/16M1101003
-
Goodall, A., Litjens, B., Regts, G., & Vena, L. (2017). A Tutte polynomial for non-orientable maps. Electronic Notes in Discrete Mathematics, 61, 513-519. https://doi.org/10.1016/j.endm.2017.07.001
Page 4 of 6