Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 26
Number of items: 26
  • 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., 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
  • Open Access
    Lo, A., Patel, V., Skokan, J., & Talbot, J. (2020). Decomposing tournaments into paths. Proceedings of the London Mathematical Society, 121(2), 426-461. https://doi.org/10.1112/plms.12328
  • Open Access
    Kleer, P., Patel, V. S., & Stroh, F. J. M. (2020). Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. The Electronic Journal of Combinatorics, 27(4), Article P4.29 . https://doi.org/10.37236/9503
  • Open Access
    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) Article 13 (Leibniz International Proceedings in Informatics; Vol. 169). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2020.13
  • Open Access
    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
  • Open Access
    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
  • Open Access
    Choromanski, K., Falik, D., Liebenau, A., Patel, V., & Pilipczuk, M. (2018). Excluding Hooks and their Complements. The Electronic Journal of Combinatorics, 25(3), Article P3.27 . https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p27
  • Open Access
    Lo, A., & Patel, V. (2018). Hamilton cycles in sparse robustly expanding digraphs. Electronic Journal of Combinatorics, 25(3), Article P3.44. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p44
  • 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
Page 2 of 3