Dr Viresh Patel
Lecturer in Optimisation
School of Mathematical Sciences
Queen Mary University of London
Queen Mary University of London
Research
Extremal combinatorics, Probabilistic combinatorics, Graph polynomials / partition functions, Phase transitions, Approximation algorithms (for counting)
Publications of specific relevance to the Centre for Combinatorics, Algebra and Number Theory
2024
Jenssen M, Patel V and Regts G (2024). Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. Journal of Combinatorial Theory Series B, Elsevier vol. 169, 233-252. 01-11-2024
Lo A, Patel V and Yıldız MA (2024). Hamilton cycles in dense regular digraphs and oriented graphs. Journal of Combinatorial Theory Series B, Elsevier vol. 164, 119-160. 01-01-2024
2023
Lambers R, Briët J, Patel V, Spieksma F and Yıldız MA (2023). Orthogonal schedules in single round robin tournaments. Operations Research Letters, Elsevier vol. 51 (5), 528-532. 01-09-2023
Lo A, Patel V and Yildiz MA (2023). Cycle Partition of Dense Regular Digraphs and Oriented Graphs. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. 28-08-2023
2022
Patel V and Stroh F (2022). A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHS. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics vol. 36 (2), 1363-1393. 07-06-2022
Huijben J, Patel V and Regts G (2022). Sampling from the low temperature Potts model through a Markov chain on flows. Random Structures and Algorithms, Wiley 16-04-2022
Buys P, Galanis A, Patel V and Regts G (2022). Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs. Forum of Mathematics Sigma, Cambridge University Press (CUP) vol. 10 01-01-2022
2021
Bencs F, Davies E, Patel V and Regts G (2021). On zero-free regions for the anti-ferromagnetic potts model on bounded-degree graphs. Annales de l’Institut Henri Poincaré D, EMS Press vol. 8 (3), 459-489. 23-09-2021
Aravind NR, van Batenburg WC, Kang RJ, Cambie S, de Verclos RDJ and Patel V (2021). Structure and colour in triangle-free graphs. Journal of Combinatorics, Electronic Journal of Combinatorics vol. 28 (2) 18-06-2021
Buys P, Galanis A, Patel V and Regts G (2021). Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. 01-01-2021
Espuny Díaz A, Patel V and Stroh F (2021). Path Decompositions of Random Directed Graphs. Extended Abstracts EuroComb 2021 702-706. 01-01-2021
2020
Kleer P, Patel V and Stroh F (2020). Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. The Electronic Journal of Combinatorics, The Electronic Journal of Combinatorics vol. 27 (4) 13-11-2020
Coulson M, Davies E, Kolla A, Patel V and Regts G (2020). Statistical physics approaches to Unique Games. 01-07-2020
Lo A, Patel V, Skokan J and Talbot J (2020). Decomposing tournaments into paths. Proceedings of the London Mathematical Society, Wiley vol. 121 (2), 426-461. 29-04-2020
2019
Kang RJ, Patel V and Regts G (2019). Discrepancy and large dense monochromatic subsets. Journal of Combinatorics, International Press of Boston vol. 10 (1), 87-109. 01-01-2019
2018
Lo A and Patel V (2018). Hamilton Cycles in Sparse Robustly Expanding Digraphs. The Electronic Journal of Combinatorics, The Electronic Journal of Combinatorics vol. 25 (3) 07-09-2018
Patel V and Regts G (2018). Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Algorithmica, Springer Nature vol. 81 (5), 1844-1858. 05-09-2018
Choromanski K, Falik D, Liebenau A, Patel V and Pilipczuk M (2018). Excluding Hooks and their Complements. The Electronic Journal of Combinatorics, The Electronic Journal of Combinatorics vol. 25 (3) 24-08-2018
2017
Kang RJ, Long E, Patel V and Regts G (2017). On a Ramsey‐type problem of Erdős and Pach. Bulletin of the London Mathematical Society, Wiley vol. 49 (6), 991-999. 06-10-2017
Lo A, Patel V, Skokan J and Talbot J (2017). Decomposing tournaments into paths. Electronic Notes in Discrete Mathematics, Elsevier vol. 61, 813-818. 01-08-2017
Patel V and Regts G (2017). Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. Electronic Notes in Discrete Mathematics, Elsevier vol. 61, 971-977. 01-08-2017
Patel V and Regts G (2017). Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM Journal on Computing, Society for Industrial & Applied Mathematics (SIAM) vol. 46 (6), 1893-1919. 01-01-2017
2016
Gutin G and Patel V (2016). Parameterized Traveling Salesman Problem: Beating the Average. SIAM Journal on Discrete Mathematics, Society for Industrial & Applied Mathematics (SIAM) vol. 30 (1), 220-238. 01-01-2016
2015
Kang RJ, Patel V and Regts G (2015). On a Ramsey-type problem of Erdős and Pach. Electronic Notes in Discrete Mathematics, Elsevier vol. 49, 821-827. 01-11-2015
Kühn D, Osthus D and Patel V (2015). A domination algorithm for {0,1}‐instances of the travelling salesman problem. Random Structures and Algorithms, Wiley vol. 48 (3), 427-453. 08-10-2015
Johnson M, Kratsch D, Kratsch S, Patel V and Paulusma D (2015). Finding Shortest Paths Between Graph Colourings. Algorithmica, Springer Nature vol. 75 (2), 295-321. 12-05-2015
Hladký J, Máthé A, Patel V and Pikhurko O (2015). Poset limits can be totally ordered. Transactions of the American Mathematical Society, American Mathematical Society (AMS) vol. 367 (6), 4319-4337. 03-02-2015
Kang RJ, Pach J, Patel V and Regts G (2015). A Precise Threshold for Quasi-Ramsey Numbers. SIAM Journal on Discrete Mathematics, Society for Industrial & Applied Mathematics (SIAM) vol. 29 (3), 1670-1682. 01-01-2015
2014
Bordewich M, Greenhill C and Patel V (2014). Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Structures and Algorithms, Wiley vol. 48 (1), 21-52. 04-09-2014
Griffiths S, Kang RJ, Oliveira RI and Patel V (2014). Tight inequalities among set hitting times in Markov chains. Proceedings of the American Mathematical Society, American Mathematical Society (AMS) vol. 142 (9), 3285-3298. 21-05-2014
Kuehn D, Lapinskas J, Osthus D and Patel V (2014). Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments. PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY vol. 109, 733-762. 01-01-2014
Johnson M, Kratsch D, Kratsch S, Patel V and Paulusma D (2014). Finding Shortest Paths Between Graph Colourings. 01-01-2014
2013
Johnson M, Patel V, Paulusma D and Trunck T (2013). Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory of Computing Systems, Springer Nature vol. 54 (2), 244-260. 07-12-2013
Broersma H, Golovach PA and Patel V (2013). Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoretical Computer Science, Elsevier vol. 485, 69-84. 01-05-2013
Broersma H, Patel V and Pyatkin A (2013). On Toughness and Hamiltonicity of 2K2‐Free Graphs. Journal of Graph Theory, Wiley vol. 75 (3), 244-255. 19-02-2013
Patel V (2013). Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. SIAM Journal on Computing, Society for Industrial & Applied Mathematics (SIAM) vol. 42 (3), 1113-1131. 01-01-2013
Kühn D, Lapinskas J, Osthus D and Patel V (2013). Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments. The Seventh European Conference on Combinatorics, Graph Theory and Applications 471-476. 01-01-2013
2012
Bonsma P, Broersma H, Patel V and Pyatkin A (2012). The complexity of finding uniform sparsest cuts in various graph classes. 01-07-2012
Bonamy M, Johnson M, Lignos I, Patel V and Paulusma D (2012). Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. 26-04-2012
Broersma H, Golovach PA and Patel V (2012). Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. 01-01-2012
2011
Bonamy M, Johnson M, Lignos I, Patel V and Paulusma D (2011). On the diameter of reconfiguration graphs for vertex colourings. Electronic Notes in Discrete Mathematics, Elsevier vol. 38, 161-166. 01-12-2011
Bonsma P, Broersma H, Patel V and Pyatkin A (2011). The Complexity Status of Problems Related to Sparsest Cuts. 01-01-2011
2010
Brightwell G and Patel V (2010). Average relational distance in linear extensions of posets. Discrete Mathematics, Elsevier vol. 310 (5), 1016-1021. 01-03-2010
Patel V (2010). Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. 01-01-2010
Johnson M, Patel V, Paulusma D and Trunck T (2010). Obtaining Online Ecological Colourings by Generalizing First-Fit. 01-01-2010
2008
2007
Patel V (2007). Cutting two graphs simultaneously. Journal of Graph Theory, Wiley vol. 57 (1), 19-32. 22-10-2007