Skip to main content
School of Mathematical Sciences
  1. School of Mathematical Sciences
  2. People
  3. Academic staff
  4. Profile

Dr Viresh Patel

Lecturer in Optimisation

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

Research

Publications

  • 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 nameOfConference.
  • Patel V, Regts G, Stam A (publicationYear). A near-optimal zero-free disk for the Ising model Combinatorial Theory nameOfConference.
  • Lo A, Patel V, Yıldız MA (2024). Hamilton cycles in dense regular digraphs and oriented graphs Journal of Combinatorial Theory Series B nameOfConference.
  • Lambers R, Briët J, Patel V et al. (2023). Orthogonal schedules in single round robin tournaments Operations Research Letters nameOfConference.
  • Lo A, Patel V, Yildiz MA (publicationYear). Cycle Partition of Dense Regular Digraphs and Oriented Graphs European Conference on Combinatorics Graph Theory and Applications Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications.
  • 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.
  • 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.
  • Espuny Díaz A, Patel V, Stroh F (2021). Path Decompositions of Random Directed Graphs journal nameOfConference.
  • Aravind NR, van Batenburg WC, Kang RJ et al. (2021). Structure and colour in triangle-free graphs Journal of Combinatorics 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.
  • Kleer P, Patel V, Stroh F (publicationYear). Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs The Electronic Journal of Combinatorics nameOfConference.
  • Coulson M, Davies E, Kolla A et al. (2020). Statistical physics approaches to Unique Games Leibniz International Proceedings in Informatics, LIPIcs nameOfConference.
  • Lo A, Patel V, Skokan J et al. (2020). Decomposing tournaments into paths Proceedings of the London Mathematical Society nameOfConference.
  • Kang RJ, Patel V, Regts G (2019). Discrepancy and large dense monochromatic subsets Journal of Combinatorics nameOfConference.
  • Lo A, Patel V (publicationYear). Hamilton Cycles in Sparse Robustly Expanding Digraphs The Electronic Journal of Combinatorics nameOfConference.
  • Patel V, Regts G (2019). Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph Algorithmica nameOfConference.
  • Choromanski K, Falik D, Liebenau A et al. (publicationYear). Excluding Hooks and their Complements The Electronic Journal of Combinatorics nameOfConference.
  • Patel V, Regts G (2017). Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials SIAM Journal on Computing 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.
  • 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.
  • 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.
  • Kang RJ, Pach J, Patel V et al. (2015). A Precise Threshold for Quasi-Ramsey Numbers SIAM Journal on Discrete Mathematics nameOfConference.
  • Johnson M, Kratsch D, Kratsch S et al. (2016). Finding Shortest Paths Between Graph Colourings Algorithmica nameOfConference.
  • Hladký J, Máthé A, Patel V et al. (2015). Poset limits can be totally ordered Transactions of the American Mathematical Society nameOfConference.
  • Johnson M, Kratsch D, Kratsch S et al. (2014). Finding Shortest Paths Between Graph Colourings Lecture Notes in Computer Science nameOfConference.
  • Bordewich M, Greenhill C, Patel V (2016). Mixing of the Glauber dynamics for the ferromagnetic Potts model Random Structures and Algorithms 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.
  • 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.
  • Johnson M, Patel V, Paulusma D et al. (2014). Obtaining Online Ecological Colourings by Generalizing First-Fit Theory of Computing Systems 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.
  • Broersma H, Patel V, Pyatkin A (2014). On Toughness and Hamiltonicity of 2K2‐Free Graphs Journal of Graph Theory 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.
  • 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.
  • Broersma H, Golovach PA, Patel V (2012). Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width Lecture Notes in Computer Science 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 nameOfConference.
  • Brightwell G, Patel V (2010). Average relational distance in linear extensions of posets Discrete Mathematics nameOfConference.
  • Patel V (2010). Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus Lecture Notes in Computer Science nameOfConference.
  • Johnson M, Patel V, Paulusma D et al. (2010). Obtaining Online Ecological Colourings by Generalizing First-Fit Lecture Notes in Computer Science nameOfConference.
  • Patel V (2008). Partitioning Posets Order nameOfConference.
  • Patel V (2008). Cutting two graphs simultaneously Journal of Graph Theory nameOfConference.
Back to top