dhr. 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
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]
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. 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
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]
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]
Andere
- 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, Netherlands. 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, ...).
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
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.