Skip to main content
Research

Publications: Dr Viresh Patel

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 and Algorithms
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 ,
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 vol. 8 , ( 3 ) 459 - 489 .
Aravind NR, van Batenburg WC, Kang RJ, Cambie S, de Verclos RDJ, Patel V ( 2021 ) . Structure and colour in triangle-free graphs . Journal of Combinatorics vol. 28 , ( 2 )
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 .
Espuny Díaz A, Patel V, Stroh F ( 2021 ) . Path Decompositions of Random Directed Graphs . Trends in Mathematics , vol. 14 ,
Kleer P, Patel V, Stroh F ( 2020 ) . Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense 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 .
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 .
Kleer P, Patel V, Stroh F ( 2020 ) . Switch-based markov chains for sampling hamiltonian cycles in dense graphs . Electronic Journal of Combinatorics vol. 27 , ( 4 ) 1 - 25 .
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 .
Patel V, Regts G ( 2019 ) . Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph . Algorithmica vol. 81 , ( 5 ) 1844 - 1858 .
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 . Electronic Journal of Combinatorics vol. 25 , ( 3 )
Choromanski K, Liebenau A, Falik D, Patel V, Pilipczuk M ( 2018 ) . Excluding hooks and their complements . Electronic Journal of Combinatorics vol. 25 , ( 3 )
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 .
Johnson M, Kratsch D, Kratsch S, Patel V, Paulusma D ( 2016 ) . Finding Shortest Paths Between Graph Colourings . Algorithmica vol. 75 , ( 2 ) 295 - 321 .
Kühn D, Osthus D, Patel V ( 2016 ) . A domination algorithm for (0,1)-instances of the travelling salesman problem . Random Structures and Algorithms vol. 48 , ( 3 ) 427 - 453 .
Bordewich M, Greenhill C, Patel V ( 2016 ) . Mixing of the Glauber dynamics for the ferromagnetic Potts model . Random Structures and Algorithms vol. 48 , ( 1 ) 21 - 52 .
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 .
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 .
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, Long E, Patel V, Regts G ( 2014 ) . On a Ramsey-type problem of Erdős and Pach .
Kuehn 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 , 733 - 762 .
Griffiths S, Kang RJ, Oliveira RI, 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 ( 2014 ) . Obtaining Online Ecological Colourings by Generalizing First-Fit . Theory of Computing Systems vol. 54 , ( 2 ) 244 - 260 .
Johnson M, Paulusma D, Kratsch D, Kratsch S, Patel V ( 2014 ) . Finding shortest paths between graph colourings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . vol. 8894 , 221 - 233 .
Broersma H, Patel V, Pyatkin A ( 2014 ) . On toughness and hamiltonicity of 2K<inf>2</inf>-free graphs . Journal of Graph Theory vol. 75 , ( 3 ) 244 - 255 .
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 .
Patel V ( 2013 ) . Determining edge expansion and other connectivity measures of graphs of bounded genus . SIAM Journal on Computing vol. 42 , ( 3 ) 1113 - 1131 .
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 .
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 ,
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 .
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) . vol. 7112 LNCS , 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 . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . vol. 6460 LNCS , 125 - 135 .
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) . vol. 6346 LNCS , 561 - 572 .
Johnson M, Patel V, Paulusma D, Trunck T ( 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) . vol. 6072 LNCS , 240 - 251 .
Brightwell G, Patel V ( 2010 ) . Average relational distance in linear extensions of posets . Discrete Mathematics vol. 310 , ( 5 ) 1016 - 1021 .
Patel V ( 2008 ) . Partitioning posets . Order vol. 25 , ( 2 ) 131 - 152 .
Patel V ( 2008 ) . Cutting two graphs simultaneously . Journal of Graph Theory vol. 57 , ( 1 ) 19 - 32 .