Skip to main content
School of Mathematical Sciences

Dr Viresh Patel

Lecturer in Optimisation

Email: viresh.patel@qmul.ac.uk
Room Number: MB-G22

Research

Publications

  • Patel V, Regts G (2022). Approximate counting using Taylor's theorem: a survey journal nameOfConference.
  • Patel V, Stroh F (2022). A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHS SIAM Journal on Discrete Mathematics nameOfConference.
  • Huijben J, Patel V, Regts G (2022). Sampling from the low temperature Potts model through a Markov chain on flows Random Structures and Algorithms nameOfConference.
  • Buys P, Galanis A, Patel V et al. (2022). Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs Forum of Mathematics, Sigma nameOfConference.
  • Díaz AE, Patel V, Stroh F (2021). Path decompositions of random directed graphs journal nameOfConference.
  • Bencs F, Davies E, Patel V et al. (2021). On zero-free regions for the anti-ferromagnetic potts model on bounded-degree graphs Annales de l’Institut Henri Poincaré D nameOfConference.
  • Aravind NR, van Batenburg WC, Kang RJ et al. (2021). Structure and colour in triangle-free graphs Journal of Combinatorics nameOfConference.
  • Moreschi M, Patel V, Regts G et al. (2021). Improved bounds for zeros of the chromatic polynomial on bounded degree graphs journal nameOfConference.
  • Huijben J, Patel V, Regts G (2021). Sampling from the low temperature Potts model through a Markov chain on flows journal nameOfConference.
  • Buys P, Galanis A, Patel V et al. (2021). Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms nameOfConference.
  • Espuny Díaz A, Patel V, Stroh F (2021). Path Decompositions of Random Directed Graphs journal nameOfConference.
  • Kleer P, Patel V, Stroh F (2020). Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs journal nameOfConference.
  • Lo A, Patel V, Skokan J et al. (2020). Decomposing tournaments into paths Proceedings of the London Mathematical Society nameOfConference.
  • Patel V, Stroh F (2020). A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs journal nameOfConference.
  • Coulson M, Davies E, Kolla A et al. (2020). Statistical physics approaches to Unique Games Leibniz International Proceedings in Informatics, LIPIcs nameOfConference.
  • Buys P, Galanis A, Patel V et al. (2020). Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs journal nameOfConference.
  • Kleer P, Patel V, Stroh F (2020). Switch-based markov chains for sampling hamiltonian cycles in dense graphs Electronic Journal of Combinatorics nameOfConference.
  • Aravind NR, Cambie S, van Batenburg WC et al. (2019). Structure and colour in triangle-free graphs journal nameOfConference.
  • Coulson M, Davies E, Kolla A et al. (2019). Statistical physics approaches to Unique Games journal nameOfConference.
  • Patel V, Regts G (2019). Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph Algorithmica nameOfConference.
  • Lo A, Patel V, Skokan J et al. (2019). Decomposing tournaments into paths journal nameOfConference.
  • Kang RJ, Patel V, Regts G (2019). Discrepancy and large dense monochromatic subsets Journal of Combinatorics nameOfConference.
  • Bencs F, Davies E, Patel V et al. (2018). On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs journal nameOfConference.
  • Lo A, Patel V (2018). Hamilton cycles in sparse robustly expanding digraphs Electronic Journal of Combinatorics nameOfConference.
  • Choromanski K, Liebenau A, Falik D et al. (2018). Excluding hooks and their complements Electronic Journal of Combinatorics nameOfConference.
  • Kang RJ, Long E, Patel V et al. (2017). On a Ramsey-type problem of Erdős and Pach Bulletin of the London Mathematical Society nameOfConference.
  • Lo A, Patel V, Skokan J et al. (2017). Decomposing tournaments into paths Electronic Notes in Discrete Mathematics nameOfConference.
  • Patel V, Regts G (2017). Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials Electronic Notes in Discrete Mathematics nameOfConference.
  • Patel V, Regts G (2017). Computing the number of induced copies of a fixed graph in a bounded degree graph journal nameOfConference.
  • Patel V, Regts G (2017). Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials SIAM Journal on Computing nameOfConference.
  • Kang R, Patel V, Regts G (2016). Discrepancy and large dense monochromatic subsets journal nameOfConference.
  • Patel V, Regts G (2016). Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials journal nameOfConference.
  • Johnson M, Kratsch D, Kratsch S et al. (2016). Finding Shortest Paths Between Graph Colourings Algorithmica nameOfConference.
  • Kühn D, Osthus D, Patel V (2016). A domination algorithm for (0,1)-instances of the travelling salesman problem Random Structures and Algorithms nameOfConference.
  • Bordewich M, Greenhill C, Patel V (2016). Mixing of the Glauber dynamics for the ferromagnetic Potts model Random Structures and Algorithms nameOfConference.
  • Gutin G, Patel V (2016). Parameterized traveling salesman problem: Beating the average SIAM Journal on Discrete Mathematics nameOfConference.
  • Kang RJ, Patel V, Regts G (2015). On a Ramsey-type problem of Erdős and Pach Electronic Notes in Discrete Mathematics nameOfConference.
  • Kang RJ, Pach J, Patel V et al. (2015). A precise threshold for quasi-ramsey numbers SIAM Journal on Discrete Mathematics nameOfConference.
  • Hladký J, Máthé A, Patel V et al. (2015). Poset limits can be totally ordered Transactions of the American Mathematical Society nameOfConference.
  • Kang RJ, Long E, Patel V et al. (2014). On a Ramsey-type problem of Erdős and Pach journal nameOfConference.
  • Kuehn D, Lapinskas J, Osthus D et al. (2014). Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY nameOfConference.
  • Griffiths S, Kang RJ, Oliveira RI et al. (2014). Tight inequalities among set hitting times in Markov chains Proceedings of the American Mathematical Society nameOfConference.
  • Kang RJ, Pach J, Patel V et al. (2014). A precise threshold for quasi-Ramsey numbers journal nameOfConference.
  • Johnson M, Patel V, Paulusma D et al. (2014). Obtaining Online Ecological Colourings by Generalizing First-Fit Theory of Computing Systems nameOfConference.
  • Johnson M, Paulusma D, Kratsch D et al. (2014). Finding shortest paths between graph colourings Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) nameOfConference.
  • Broersma H, Patel V, Pyatkin A (2014). On toughness and hamiltonicity of 2K2-free graphs Journal of Graph Theory nameOfConference.
  • Bonamy M, Johnson M, Lignos I et al. (2014). Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs Journal of Combinatorial Optimization nameOfConference.
  • Patel V (2013). Determining edge expansion and other connectivity measures of graphs of bounded genus SIAM Journal on Computing nameOfConference.
  • Broersma H, Golovach PA, Patel V (2013). Tight complexity bounds for FPT subgraph problems parameterized by the clique-width Theoretical Computer Science nameOfConference.
  • Kühn D, Lapinskas J, Osthus D et al. (2013). Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments journal nameOfConference.
  • Bonsma P, Broersma H, Patel V et al. (2012). The complexity of finding uniform sparsest cuts in various graph classes Journal of Discrete Algorithms nameOfConference.
  • Broersma H, Golovach PA, Patel V (2012). Tight complexity bounds for FPT subgraph problems parameterized by clique-width Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) nameOfConference.
  • Bonamy M, Johnson M, Lignos I et al. (2011). On the diameter of reconfiguration graphs for vertex colourings Electronic Notes in Discrete Mathematics nameOfConference.
  • Bonsma P, Broersma H, Patel V et al. (2011). The complexity status of problems related to sparsest cuts Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) nameOfConference.
  • Patel V (2010). Determining edge expansion and other connectivity measures of graphs of bounded genus Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) nameOfConference.
  • Johnson M, Patel V, Paulusma D et al. (2010). Obtaining online ecological colourings by generalizing first-fit Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) nameOfConference.
  • Brightwell G, Patel V (2010). Average relational distance in linear extensions of posets Discrete Mathematics nameOfConference.
  • Patel V (2008). Partitioning posets Order nameOfConference.
  • Patel V (2008). Cutting two graphs simultaneously Journal of Graph Theory nameOfConference.
Back to top