Skip to main content
Research
  1. Queen Mary University of London
  2. Research
  3. Publications

Publications: DR Viresh Patel

Back to Search
Lo A, Patel V, Yıldız MA ( 2025 ) . Cycle Partitions in Dense Regular Digraphs and Oriented Graphs . Forum of Mathematics, Sigma vol. 13 , Article e79 ,
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 vol. 169 , 233 - 252 .
Patel V, Regts G, Stam A ( 2024 ) . A near-optimal zero-free disk for the Ising model . Combinatorial Theory vol. 4 , ( 2 )
Lo A, Patel V, Yıldız MA ( 2024 ) . Hamilton cycles in dense regular digraphs and oriented graphs . Journal of Combinatorial Theory, Series B vol. 164 , 119 - 160 .
Patel V, Regts G, Stam A ( 2023 ) . A near-optimal zero-free disk for the Ising model .
Jenssen M, Patel V, Regts G ( 2023 ) . Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem .
Lambers R, Briët J, Patel V, Spieksma F, Yıldız MA ( 2023 ) . Orthogonal schedules in single round robin tournaments . Operations Research Letters vol. 51 , ( 5 ) 528 - 532 .
Lo A, Patel V, Yildiz M ( 2023 ) . Cycle Partition of Dense Regular Digraphs and Oriented Graphs . Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications . Conference: European Conference on Combinatorics, Graph Theory and Applications from: 28/08/2023 to: 01/09/2023 , 717 - 724 .
Patel V, Stroh F ( 2022 ) . A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs . SIAM Journal on Discrete Mathematics vol. 36 , ( 2 ) 1363 - 1393 .
Huijben J, Patel V, Regts G ( 2022 ) . Sampling from the low temperature Potts model through a Markov chain on flows . Random Structures & Algorithms vol. 62 , ( 1 ) 219 - 239 .
Buys P, Galanis A, Patel V, Regts G ( 2022 ) . Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs . Forum of Mathematics, Sigma vol. 10 , Article e7 ,
Patel V, Regts G ( 2022 ) . Approximate counting using Taylor's theorem: a survey . BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE ( 138 ) 39 - 70 .
Díaz AE, Patel V, Stroh F ( 2021 ) . Path decompositions of random directed graphs .
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, Combinatorics, Physics and their Interactions vol. 8 , ( 3 ) 459 - 489 .
Espuny Díaz A, Patel V, Stroh F ( 2021 ) . Path Decompositions of Random Directed Graphs . Trends in Mathematics , Springer International Publishing
Aravind NR, Cambie S, Cames van Batenburg W, De Joannis de Verclos R, Kang RJ, Patel V ( 2021 ) . Structure and Colour in Triangle-Free Graphs . The Electronic Journal of Combinatorics vol. 28 , ( 2 ) Article P2.47 ,
Moreschi M, Patel V, Regts G, Stam A ( 2021 ) . Improved bounds for zeros of the chromatic polynomial on bounded degree graphs .
Huijben J, Patel V, Regts G ( 2021 ) . Sampling from the low temperature Potts model through a Markov chain on flows .
Buys P, Galanis A, Patel V, Regts G ( 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 . 1508 - 1519 .
Kleer P, Patel V, Stroh F ( 2020 ) . Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs .
Kleer P, Patel V, Stroh F ( 2020 ) . Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs . The Electronic Journal of Combinatorics vol. 27 , ( 4 ) Article P4.29 ,
Patel V, Stroh F ( 2020 ) . A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs .
Coulson M, Davies E, Kolla A, Patel V, Regts G ( 2020 ) . Statistical physics approaches to Unique Games . Leibniz International Proceedings in Informatics Lipics . vol. 169 ,
Buys P, Galanis A, Patel V, Regts G ( 2020 ) . Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs .
Lo A, Patel V, Skokan J, Talbot J ( 2020 ) . Decomposing tournaments into paths . Proceedings of the London Mathematical Society vol. 121 , ( 2 ) 426 - 461 .
Aravind NR, Cambie S, van Batenburg WC, de Verclos RDJ, Kang RJ, Patel V ( 2019 ) . Structure and colour in triangle-free graphs .
Coulson M, Davies E, Kolla A, Patel V, Regts G ( 2019 ) . Statistical physics approaches to Unique Games .
Lo A, Patel V, Skokan J, Talbot J ( 2019 ) . Decomposing tournaments into paths .
Kang RJ, Patel V, Regts G ( 2019 ) . Discrepancy and large dense monochromatic subsets . Journal of Combinatorics vol. 10 , ( 1 ) 87 - 109 .
Bencs F, Davies E, Patel V, Regts G ( 2018 ) . On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs .
Lo A, Patel V ( 2018 ) . Hamilton Cycles in Sparse Robustly Expanding Digraphs . The Electronic Journal of Combinatorics vol. 25 , ( 3 ) Article P3.44 ,
Patel V, Regts G ( 2018 ) . Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph . Algorithmica vol. 81 , ( 5 ) 1844 - 1858 .
Kang RJ, Long E, Patel V, Regts G ( 2017 ) . On a Ramsey-type problem of Erdős and Pach . Bulletin of the London Mathematical Society vol. 49 , ( 6 ) 991 - 999 .
Lo A, Patel V, Skokan J, Talbot J ( 2017 ) . Decomposing tournaments into paths . Electronic Notes in Discrete Mathematics vol. 61 , 813 - 818 .
Patel V, Regts G ( 2017 ) . Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials . Electronic Notes in Discrete Mathematics vol. 61 , 971 - 977 .
Patel V, Regts G ( 2017 ) . Computing the number of induced copies of a fixed graph in a bounded degree graph .
Patel V, Regts G ( 2017 ) . Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials . SIAM Journal on Computing vol. 46 , ( 6 ) 1893 - 1919 .
Kang R, Patel V, Regts G ( 2016 ) . Discrepancy and large dense monochromatic subsets .
Patel V, Regts G ( 2016 ) . Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials .
Gutin G, Patel V ( 2016 ) . Parameterized Traveling Salesman Problem: Beating the Average . SIAM Journal on Discrete Mathematics vol. 30 , ( 1 ) 220 - 238 .
Kang RJ, Patel V, Regts G ( 2015 ) . On a Ramsey-type problem of Erdős and Pach . Electronic Notes in Discrete Mathematics vol. 49 , 821 - 827 .
Kühn D, Osthus D, Patel V ( 2015 ) . A domination algorithm for {0,1}‐instances of the travelling salesman problem . Random Structures & Algorithms vol. 48 , ( 3 ) 427 - 453 .
Choromanski K, Falik D, Liebenau A, Patel V, Pilipczuk M ( 2015 ) . Excluding hooks and their complements .
Johnson M, Kratsch D, Kratsch S, Patel V, Paulusma D ( 2015 ) . Finding Shortest Paths Between Graph Colourings . Algorithmica vol. 75 , ( 2 ) 295 - 321 .
Hladký J, Máthé A, Patel V, Pikhurko O ( 2015 ) . Poset limits can be totally ordered . Transactions of the American Mathematical Society vol. 367 , ( 6 ) 4319 - 4337 .
Kang RJ, Pach J, Patel V, Regts G ( 2015 ) . A Precise Threshold for Quasi-Ramsey Numbers . SIAM Journal on Discrete Mathematics vol. 29 , ( 3 ) 1670 - 1682 .
Johnson M, Kratsch D, Kratsch S, Patel V, Paulusma D ( 2014 ) . Finding Shortest Paths Between Graph Colourings . 221 - 233 .
Kang RJ, Long E, Patel V, Regts G ( 2014 ) . On a Ramsey-type problem of Erdős and Pach .
Bordewich M, Greenhill C, Patel V ( 2014 ) . Mixing of the Glauber dynamics for the ferromagnetic Potts model . Random Structures & Algorithms vol. 48 , ( 1 ) 21 - 52 .
Kühn D, Lapinskas J, Osthus D, Patel V ( 2014 ) . Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments . Proceedings of the London Mathematical Society vol. 109 , ( 3 ) 733 - 762 .
Griffiths S, Kang R, Oliveira R, Patel V ( 2014 ) . Tight inequalities among set hitting times in Markov chains . Proceedings of the American Mathematical Society vol. 142 , ( 9 ) 3285 - 3298 .
Kang RJ, Pach J, Patel V, Regts G ( 2014 ) . A precise threshold for quasi-Ramsey numbers .
Johnson M, Patel V, Paulusma D, Trunck T ( 2013 ) . Obtaining Online Ecological Colourings by Generalizing First-Fit . Theory of Computing Systems vol. 54 , ( 2 ) 244 - 260 .
Broersma H, Golovach PA, Patel V ( 2013 ) . Tight complexity bounds for FPT subgraph problems parameterized by the clique-width . Theoretical Computer Science vol. 485 , 69 - 84 .
Broersma H, Patel V, Pyatkin A ( 2013 ) . On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs . Journal of Graph Theory vol. 75 , ( 3 ) 244 - 255 .
Patel V ( 2013 ) . Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus . SIAM Journal on Computing vol. 42 , ( 3 ) 1113 - 1131 .
Kühn D, Lapinskas J, Osthus D, 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 , Scuola Normale Superiore
Bonsma P, Broersma H, Patel V, Pyatkin A ( 2012 ) . The complexity of finding uniform sparsest cuts in various graph classes . Journal of Discrete Algorithms . vol. 14 , 136 - 149 .
Bonamy M, Johnson M, Lignos I, Patel V, Paulusma D ( 2014 ) . Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs . Journal of Combinatorial Optimization . vol. 27 , 132 - 143 .
Broersma H, Golovach PA, Patel V ( 2012 ) . Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width . 207 - 218 .
Bonamy M, Johnson M, Lignos I, Patel V, Paulusma D ( 2011 ) . On the diameter of reconfiguration graphs for vertex colourings . Electronic Notes in Discrete Mathematics vol. 38 , 161 - 166 .
Bonsma P, Broersma H, Patel V, Pyatkin A ( 2011 ) . The Complexity Status of Problems Related to Sparsest Cuts . 125 - 135 .
Brightwell G, Patel V ( 2010 ) . Average relational distance in linear extensions of posets . Discrete Mathematics vol. 310 , ( 5 ) 1016 - 1021 .
Patel V ( 2010 ) . Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus . 561 - 572 .
Johnson M, Patel V, Paulusma D, Trunck T ( 2010 ) . Obtaining Online Ecological Colourings by Generalizing First-Fit . 240 - 251 .
Patel V ( 2008 ) . Partitioning Posets . Order vol. 25 , ( 2 ) 131 - 152 .
Patel V ( 2007 ) . Cutting two graphs simultaneously . Journal of Graph Theory vol. 57 , ( 1 ) 19 - 32 .
Back to Search