Search results

    Filter results

  • Full text

  • Document type

  • Publication year

  • Organisation

Results: 26
Number of items: 26
  • Open Access
    Yildiz, M. A. (2025). Cycle partitions and path decompositions in directed graphs. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Lo, A., Patel, V., & Yıldız, M. A. (2024). Hamilton cycles in dense regular digraphs and oriented graphs. Journal of Combinatorial Theory. Series B, 164, 119-160. https://doi.org/10.1016/j.jctb.2023.09.004
  • Open Access
    Jenssen, M., Patel, V., & Regts, G. (2024). Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. Journal of Combinatorial Theory. Series B, 169, 233-252. https://doi.org/10.1016/j.jctb.2024.06.005
  • Open Access
    Patel, V., Regts, G., & Stam, A. (2024). A near-optimal zero-free disk for the Ising model. Combinatorial Theory, 4(2), Article 9. https://doi.org/10.5070/C64264237
  • Open Access
    Lambers, R., Briët, J., Patel, V., Spieksma, F., & Yıldız, M. A. (2023). Orthogonal schedules in single round robin tournaments. Operations Research Letters, 51(5), 528-532. https://doi.org/10.1016/j.orl.2023.08.002
  • Open Access
    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
  • 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
    Stroh, F. J. M. (2022). Hamilton cycles and algorithms. [Thesis, fully internal, Universiteit van Amsterdam].
  • 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
  • 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
Page 1 of 3