Viresh Patel

According to our database, Viresh Patel authored at least 37 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Hamilton cycles in dense regular digraphs and oriented graphs.

Allan Lo, Viresh Patel, Mehmet Akif Yildiz

J. Comb. Theory, Ser. B, January, 2024

2023

Orthogonal schedules in single round robin tournaments.

Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz

Oper. Res. Lett., September, 2023

Sampling from the low temperature Potts model through a Markov chain on flows.

Jeroen Huijben, Viresh Patel, Guus Regts

Random Struct. Algorithms, 2023

A near-optimal zero-free disk for the Ising model.

Viresh Patel, Guus Regts, Ayla Stam

CoRR, 2023

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.

Matthew Jenssen, Viresh Patel, Guus Regts

CoRR, 2023

2022

A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs.

Viresh Patel, Fabian Stroh

SIAM J. Discret. Math., 2022

Approximate counting using Taylor's theorem: a survey.

Viresh Patel, Guus Regts

Bull. EATCS, 2022

2021

Structure and Colour in Triangle-Free Graphs.

N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel

Electron. J. Comb., 2021

Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs.

Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.

Pieter Kleer, Viresh Patel, Fabian Stroh

Electron. J. Comb., 2020

Statistical Physics Approaches to Unique Games.

Matthew Coulson, Ewan Davies, Alexandra Kolla, Viresh Patel, Guus Regts

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph.

Viresh Patel, Guus Regts

Algorithmica, 2019

2018

On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs.

Ferenc Bencs, Ewan Davies, Viresh Patel, Guus Regts

CoRR, 2018

Hamilton Cycles in Sparse Robustly Expanding Digraphs.

Allan Lo, Viresh Patel

Electron. J. Comb., 2018

Excluding Hooks and their Complements.

Krzysztof Choromanski, Dvir Falik, Anita Liebenau, Viresh Patel, Marcin Pilipczuk

Electron. J. Comb., 2018

2017

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.

Viresh Patel, Guus Regts

Electron. Notes Discret. Math., 2017

Decomposing tournaments into paths.

Allan Lo, Viresh Patel, Jozef Skokan, John M. Talbot

Electron. Notes Discret. Math., 2017

2016

Parameterized Traveling Salesman Problem: Beating the Average.

Gregory Z. Gutin, Viresh Patel

SIAM J. Discret. Math., 2016

A domination algorithm for {0, 1}-instances of the travelling salesman problem.

Daniela Kühn, Deryk Osthus, Viresh Patel

Random Struct. Algorithms, 2016

Mixing of the Glauber dynamics for the ferromagnetic Potts model.

Magnus Bordewich, Catherine S. Greenhill, Viresh Patel

Random Struct. Algorithms, 2016

Finding Shortest Paths Between Graph Colourings.

Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma

Algorithmica, 2016

2015

A Precise Threshold for Quasi-Ramsey Numbers.

Ross J. Kang, János Pach, Viresh Patel, Guus Regts

SIAM J. Discret. Math., 2015

On a Ramsey-type problem of Erdős and Pach.

Ross J. Kang, Viresh Patel, Guus Regts

Electron. Notes Discret. Math., 2015

2014

Obtaining Online Ecological Colourings by Generalizing First-Fit.

Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck

Theory Comput. Syst., 2014

On Toughness and Hamiltonicity of 2<i>K</i>₂-Free Graphs.

Hajo Broersma, Viresh Patel, Artem V. Pyatkin

J. Graph Theory, 2014

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.

Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma

J. Comb. Optim., 2014

Parameterized TSP: Beating the Average.

Gregory Z. Gutin, Viresh Patel

CoRR, 2014

Colouring Reconfiguration Is Fixed-Parameter Tractable.

Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma

CoRR, 2014

2013

Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.

Hajo Broersma, Petr A. Golovach, Viresh Patel

Theor. Comput. Sci., 2013

Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus.

Viresh Patel

SIAM J. Comput., 2013

Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data.

Rachit Mehra, Viresh Patel, Faruk Kazi, Navdeep M. Singh, S. R. Wagh

Proceedings of the International Conference on Advances in Computing, 2013

2012

The complexity of finding uniform sparsest cuts in various graph classes.

Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin

J. Discrete Algorithms, 2012

2011

On the diameter of reconfiguration graphs for vertex colourings.

Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma

Electron. Notes Discret. Math., 2011

2010

Average relational distance in linear extensions of posets.

Graham R. Brightwell, Viresh Patel

Discret. Math., 2010

The Complexity Status of Problems Related to Sparsest Cuts.

Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2008

Partitioning Posets.

Viresh Patel

Order, 2008

Cutting two graphs simultaneously.

Viresh Patel

J. Graph Theory, 2008