For best experience please turn on javascript and use a modern browser!
NL

dr. V.S. (Viresh) Patel

Faculty of Science
Korteweg-de Vries Instituut
Photographer: Patel, Viresh

Visiting address
  • Science Park 107
  • Room number:
Postal address
  • Postbus 94248
    1090 GE Amsterdam
Contact details
  • Publications

    2018

    • Lo, A., & Patel, V. (2018). Hamilton cycles in sparse robustly expanding digraphs. Electronic Journal of Combinatorics, 25(3), [P3.44]. [details]
    • Patel, V., & Regts, G. (2018). Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Algorithmica. DOI: 10.1007/s00453-018-0511-9
    • Choromanski, K., Falik, D., Liebenau, A., Patel, V., & Pilipczuk, M. (2018). Excluding Hooks and their Complements. The Electronic Journal of Combinatorics, 25(3), [P3.27 ]. [details]

    2017

    • Lo, A., Patel, V. S., Skokan, J., & Talbot, J. (2017). Decomposing tournaments into paths. Electronic Notes in Discrete Mathematics, 61, 813-818. https://doi.org/10.1016/j.endm.2017.07.040 [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. DOI: 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]
    • 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. DOI: 10.1112/blms.12094 [details]

    2016

    • Gutin, G., & Patel, V. (2016). Parameterized Traveling Salesman Problem: Beating the Average. SIAM Journal on Discrete Mathematics, 30(1), 220-238. DOI: 10.1137/140980946 [details]

    2015

    Others

    • 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.
  • Ancillary activities
    • No ancillary activities