Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 52
Number of items: 52
  • Open Access
    de Boer, D. (2023). The Potts model and the independence polynomial: Uniqueness of the Gibbs measure and distributions of complex zeros. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Huijben, J. (2023). Chromatic polynomials: Zeros, algorithms and computational complexity. [Thesis, fully internal, Universiteit van Amsterdam].
  • Garijo, D., Goodall, A., Nešetřil, J., & Regts, G. (2022). Polynomials and graph homomorphisms. In J. Ellis-Monaghan, & I. Moffat (Eds.), Handbook of the Tutte Polynomial and Related Topics (pp. 405-422). CRC Press. https://doi.org/10.1201/9780429161612-22
  • Open Access
    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, Article e7. https://doi.org/10.1017/fms.2022.4
  • Open Access
    Patel, V., & Regts, G. (2022). Approximate counting using Taylor’s theorem: a survey. Bulletin of the EATC, (138). http://bulletin.eatcs.org/index.php/beatcs/article/view/725
  • Open Access
    Buys, P. (2022). Partition functions: Zeros, unstable dynamics and complexity. [Thesis, fully internal, Universiteit van Amsterdam].
  • Buys, P., Galanis, A., Patel, V., & Regts, G. (2021). Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. In D. Marx (Ed.), Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021): Alexandria, Virginia, USA, 10-13 January 2021 (pp. 1508-1519). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.91
  • 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
  • Open Access
    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 '21 (pp. 1508-1519). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.48550/arXiv.2006.14828, https://doi.org/10.1137/1.9781611976465.91
  • Open Access
    Bencs, F., Csikvári, P., & Regts, G. (2021). Some Applications of Wagner's Weighted Subgraph Counting Polynomial. The Electronic Journal of Combinatorics, 28(4), Article 4-14. https://doi.org/10.37236/10185
Page 2 of 6