Dr. G. (Guus) Regts
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
Korteweg-de Vries Instituut
Bezoekadres
- Science Park 107
- Kamernummer: F3.31
Postadres
- Postbus 94248
1090 GE Amsterdam
Contactgegevens
-
Publicaties
2023
- Huijben, J., Patel, V., & Regts, G. (2023). Sampling from the low temperature Potts model through a Markov chain on flows. Random Structures and Algorithms, 62(1), 219-239. https://doi.org/10.1002/rsa.21089
2022
- Buys, P., Galanis, A., Patel, V., & Regts, G. (2022). Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs. Forum of Mathematics, Sigma, 10. https://doi.org/10.1017/fms.2022.4
- Regts, G., Goodall, A., Garijo, D., & Nesetril, J. (2022). Polynomials and graph homomorphisms. In J. Ellis-Monaghan, & I. Moffat (Eds.), Handbook of the Tutte Polynomial and Related Topics
2021
Bencs, F., Csikvári, P., & Regts, G. (2021). Some Applications of Wagner's Weighted Subgraph Counting Polynomial. The Electronic Journal of Combinatorics, 28(4), [4-14]. https://doi.org/10.37236/10185 [details]- Bencs, F., Davies, E., Patel, V., & Regts, G. (2021). On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. Annales de l'Institut Henri Poincaré D, 8(3), 459-489. https://doi.org/10.4171/AIHPD/108 [details]
- Buys, P., Galanis, A., Patel, V. S., & Regts, G. (2021). Lee-yang zeros and the complexity of the ferromagnetic ising model on bounded-degree graphs. In D. Marx (Ed.), Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1508-1519). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611976465.91 [details]
- Goodall, A., Litjens, B., Regts, G., & Vena, L. (2021). Tutte’s dichromate for signed graphs. Discrete Applied Mathematics, 289, 153-184. https://doi.org/10.1016/j.dam.2020.09.021 [details]
- Regts, G., & Sevenster, B. (2021). Mixed partition functions and exponentially bounded edge-connection rank. Annales de l'Institut Henri Poincaré D, 8(2), 179-200. https://doi.org/10.4171/AIHPD/100 [details]
2020
- Abiad, A., Gribling, S., Lahaye, D., Mnich, M., Regts, G., Vena, L., ... Zwaneveld, P. (2020). On the complexity of solving a decision problem with flow-depending costs: The case of the IJsselmeer dikes. Discrete Optimization, 37, [100565]. https://doi.org/10.1016/j.disopt.2019.100565 [details]
- Goodall, A., Litjens, B., Regts, G., & Vena, L. (2020). A Tutte polynomial for maps II: The non-orientable case. European Journal of Combinatorics, 86, [103095]. https://doi.org/10.1016/j.ejc.2020.103095 [details]
- Helmuth, T., Perkins, W., & Regts, G. (2020). Algorithmic Pirogov–Sinai theory. Probability Theory and Related Fields, 176(3-4), 851-895. https://doi.org/10.1007/s00440-019-00928-y [details]
- Peters, H., & Regts, G. (2020). Location of zeros for the partition function of the Ising model on bounded degree graphs. Journal of the London Mathematical Society, 101(2), 765-785. https://doi.org/10.1112/jlms.12286 [details]
2019
- 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 [details]
- 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). New York, NY: Association for Computing Machinery. https://doi.org/10.1145/3313276.3316305 [details]
- 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 [details]
- 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 [details]
- Peters, H., & Regts, G. (2019). On a Conjecture of Sokal Concerning Roots of the Independence Polynomial. The Michigan mathematical journal, 68(1), 33-55. https://doi.org/10.1307/mmj/1541667626 [details]
2018
- 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 [details]
- 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 [details]
2017
- 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 [details]
- Kang, R. J., Long, E., Patel, V., & Regts, G. (2017). On a Ramsey-type problem of Erdős and Pach. Bulletin of the London Mathematical Society, 49(6), 991-999. https://doi.org/10.1112/blms.12094 [details]
- 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 [details]
- Patel, V., & Regts, G. (2017). Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. Electronic Notes in Discrete Mathematics, 61, 971-977. https://doi.org/10.1016/j.endm.2017.07.061 [details]
- Regts, G., & Sevenster, B. (2017). Graph parameters from symplectic group invariants. Journal of Combinatorial Theory. Series B, 122, 844-868. https://doi.org/10.1016/j.jctb.2016.10.002 [details]
- Regts, G., & Sevenster, B. (2017). Partition functions from orthogonal and symplectic group invariants. Electronic Notes in Discrete Mathematics, 61, 1011-1017. https://doi.org/10.1016/j.endm.2017.07.066 [details]
- Regts, G., Schrijver, A., & Sevenster, B. (2017). On the existence of real R-matrices for virtual link invariants. Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 87(2), 435-443. https://doi.org/10.1007/s12188-016-0175-9 [details]
2016
- Goodall, A., Regts, G., & Vena, L. (2016). Matroid invariants and counting graph homomorphisms. Linear Algebra and Its Applications, 494, 263–273. https://doi.org/10.1016/j.laa.2016.01.022 [details]
- Regts, G. (2016). Regularity lemmas in a Banach space setting. European journal of combinatorics = Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik, 51, 347-358. https://doi.org/10.1016/j.ejc.2015.06.006 [details]
- Regts, G., & Schrijver, A. (2016). Compact orbit spaces in Hilbert spaces and limits of edge-colouring models. European journal of combinatorics = Journal européen de combinatoire = Europäische Zeitschrift für Kombinatorik, 52(B), 389-395. https://doi.org/10.1016/j.ejc.2015.07.013 [details]
- Regts, G., Schrijver, A., & Sevenster, B. (2016). On partition functions for 3-graphs. Journal of Combinatorial Theory Series B, 121, 421–431. https://doi.org/10.1016/j.jctb.2016.07.012 [details]
2015
- Kang, R. J., Pach, J., Patel, V., & Regts, G. (2015). A Precise Threshold for Quasi-Ramsey Numbers. SIAM Journal on Discrete Mathematics, 29(3), 1670-1682. https://doi.org/10.1137/14097313X [details]
- Kang, R. J., Patel, V., & Regts, G. (2015). On a Ramsey-type problem of Erdős and Pach. Electronic Notes in Discrete Mathematics, 49, 821-827. https://doi.org/10.1016/j.endm.2015.06.049 [details]
- Regts, G. (2015). Regularity lemmas in a Banach space setting. Electronic Notes in Discrete Mathematics, 49, 107-113. https://doi.org/10.1016/j.endm.2015.06.017 [details]
2022
- Regts, G., & Patel, V. (2022). Approximate counting using Taylor’s theorem: a survey. Bulletin of the EATC, 138(October 2022).
2020
- Coulson, M., Davies, E., Kolla, A., Patel, V., & Regts, G. (2020). Statistical physics approaches to Unique Games. In S. Saraf (Ed.), 35th Computational Complexity Conference: CCC 2020, July 28–31, 2020, Saarbrücken, Germany (Virtual Conference) [13] (Leibniz International Proceedings in Informatics; Vol. 169). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2020.13 [details]
2013
- van der Aalst, T., Denteneer, D., Döring, H., Duong, M. H., Kang, R. J., Keane, M., ... Tomczyk, J. (2013). The random disc thrower problem. In M. Heydenreich, S. Hille, V. Rottschäfer, F. Spieksma, & E. Verbitskiy (Eds.), Proceedings of the 90th European Study Group Mathematics with Industry: SWI 2013: Leiden, 28 Janurary - 1 February 2013 (pp. 59-78). Leiden: Universiteit Leiden, Studiegroep Wiskunde met de Industrie. [details]
2019
- Peters, H., & Regts, G. (2019). Een discrete vraag, een complexe oplossing. Nieuw Archief voor Wiskunde, 5/20(4), 245-247. [details]
Andere
- Patel, V. (participant) & Regts, G. (participant) (17-5-2021 - 21-5-2021). Extremal and Algorithmic Aspects of Partition Functions (organising a conference, workshop, ...).
- Patel, V. (participant) & Regts, G. (participant) (17-5-2021 - 21-5-2021). Extremal and Algorithmic Aspects of Partition Functions (organising a conference, workshop, ...).
- Peters, H. (organiser), Roeder, R. G. (organiser) & Regts, G. (participant) (17-5-2021 - 21-5-2021). Extremal and Algorithmic Aspects of Partition Functions (organising a conference, workshop, ...).
- Patel, V. S. (organiser) & Regts, G. (organiser) (23-8-2018 - 24-8-2018). 2-day Workshop on Algorithmic and Combinatorial Aspects of Partition Functions, Amsterdam. Topic: The study of various types of partition functions is a very active area of research and lies at the interface of combinatorics, probability, (…) (organising a conference, workshop, ...).
2022
2019
This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list. -
Nevenwerkzaamheden
- Geen nevenwerkzaamheden
Bencs, F., Csikvári, P., & Regts, G. (2021). Some Applications of Wagner's Weighted Subgraph Counting Polynomial. The Electronic Journal of Combinatorics, 28(4), [4-14].