Viresh Patel

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 35

Top Topics

Approximation Algorithms

Power Distribution

Bounded Treewidth

Top Venues

Electron. J. Comb.

SIAM J. Discret. Math.

Random Struct. Algorithms

Publications

Allan Lo, Viresh Patel, Mehmet Akif Yildiz
Hamilton cycles in dense regular digraphs and oriented graphs. J. Comb. Theory, Ser. B 164 (2024)
Matthew Jenssen, Viresh Patel, Guus Regts
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. J. Comb. Theory B 169 (2024)
Matthew Jenssen, Viresh Patel, Guus Regts
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem. CoRR (2023)
Viresh Patel, Guus Regts, Ayla Stam
A near-optimal zero-free disk for the Ising model. CoRR (2023)
Jeroen Huijben, Viresh Patel, Guus Regts
Sampling from the low temperature Potts model through a Markov chain on flows. Random Struct. Algorithms 62 (1) (2023)
Viresh Patel, Soumyajit Ghosh, Saikat Chakrabarti, Ankush Sharma, Sanjeev Pannala
Neural Network Based Fault Location in Power Distribution System. ISGT Asia (2023)
Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz
Orthogonal schedules in single round robin tournaments. Oper. Res. Lett. 51 (5) (2023)
Viresh Patel, Guus Regts
Approximate counting using Taylor's theorem: a survey. CoRR (2022)
Viresh Patel, Guus Regts
Approximate counting using Taylor's theorem: a survey. Bull. EATCS 138 (2022)
Viresh Patel, Fabian Stroh
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs. SIAM J. Discret. Math. 36 (2) (2022)
Jeroen Huijben, Viresh Patel, Guus Regts
Sampling from the low temperature Potts model through a Markov chain on flows. CoRR (2021)
Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. SODA (2021)
N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28 (2) (2021)
Viresh Patel, Fabian Stroh
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs. CoRR (2020)
Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts
Statistical Physics Approaches to Unique Games. Computational Complexity Conference (2020)
Pieter Kleer, Viresh Patel, Fabian Stroh
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. CoRR (2020)
Pieter Kleer, Viresh Patel, Fabian Stroh
Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs. Electron. J. Comb. 27 (4) (2020)
Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs. CoRR (2020)
Viresh Patel, Guus Regts
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph. Algorithmica 81 (5) (2019)
Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts
Statistical physics approaches to Unique Games. CoRR (2019)
N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel
Structure and colour in triangle-free graphs. CoRR (2019)
Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk
Excluding Hooks and their Complements. Electron. J. Comb. 25 (3) (2018)
Allan Lo, Viresh Patel
Hamilton Cycles in Sparse Robustly Expanding Digraphs. Electron. J. Comb. 25 (3) (2018)
Ferenc Bencs, Ewan Davies, Viresh Patel, Guus Regts
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs. CoRR (2018)
Viresh Patel, Guus Regts
Computing the number of induced copies of a fixed graph in a bounded degree graph. CoRR (2017)
Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot
Decomposing tournaments into paths. Electron. Notes Discret. Math. 61 (2017)
Viresh Patel, Guus Regts
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. Electron. Notes Discret. Math. 61 (2017)
Viresh Patel, Guus Regts
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM J. Comput. 46 (6) (2017)
Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48 (1) (2016)
Viresh Patel, Guus Regts
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. CoRR (2016)
Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
Finding Shortest Paths Between Graph Colourings. Algorithmica 75 (2) (2016)
Daniela Kühn, Deryk Osthus, Viresh Patel
A domination algorithm for {0, 1}-instances of the travelling salesman problem. Random Struct. Algorithms 48 (3) (2016)
Gregory Z. Gutin, Viresh Patel
Parameterized Traveling Salesman Problem: Beating the Average. SIAM J. Discret. Math. 30 (1) (2016)
Ross J. Kang, János Pach, Viresh Patel, Guus Regts
A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. 29 (3) (2015)
Ross J. Kang, Viresh Patel, Guus Regts
On a Ramsey-type problem of Erdős and Pach. Electron. Notes Discret. Math. 49 (2015)
Daniela Kühn, Deryk Osthus, Viresh Patel
A domination algorithm for $\{0, 1\}$-instances of the travelling salesman problem. CoRR (2014)
Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR (2014)
Gregory Z. Gutin, Viresh Patel
Parameterized TSP: Beating the Average. CoRR (2014)
Hajo Broersma, Viresh Patel, Artem V. Pyatkin
-Free Graphs. J. Graph Theory 75 (3) (2014)
Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
Finding Shortest Paths Between Graph Colourings. IPEC (2014)
Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27 (1) (2014)
Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. 54 (2) (2014)
Rachit Mehra, Viresh Patel, Faruk Kazi, Navdeep M. Singh, S. R. Wagh
Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data. ICACCI (2013)
Viresh Patel
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. SIAM J. Comput. 42 (3) (2013)
Magnus Bordewich, Catherine S. Greenhill, Viresh Patel
Mixing of the Glauber dynamics for the ferromagnetic Potts model CoRR (2013)
Hajo Broersma, Petr A. Golovach, Viresh Patel
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485 (2013)
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14 (2012)
Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. 38 (2011)
Hajo Broersma, Petr A. Golovach, Viresh Patel
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC (2011)
Graham R. Brightwell, Viresh Patel
Average relational distance in linear extensions of posets. Discret. Math. 310 (5) (2010)
Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR (2010)
Viresh Patel
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus. ESA (1) (2010)
Viresh Patel
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus CoRR (2010)
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA (2010)
Viresh Patel
Partitioning Posets. Order 25 (2) (2008)
Viresh Patel
Cutting two graphs simultaneously. J. Graph Theory 57 (1) (2008)