Viresh Patel

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Hamilton cycles in dense regular digraphs and oriented graphs.
J. Comb. Theory B, January, 2024

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem.
J. Comb. Theory B, 2024

Orthogonal schedules in single round robin tournaments.
Oper. Res. Lett., September, 2023

Sampling from the low temperature Potts model through a Markov chain on flows.
Random Struct. Algorithms, 2023

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

A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs.
SIAM J. Discret. Math., 2022

Approximate counting using Taylor's theorem: a survey.
Bull. EATCS, 2022

Structure and Colour in Triangle-Free Graphs.
Electron. J. Comb., 2021

Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Switch-Based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs.
Electron. J. Comb., 2020

Statistical Physics Approaches to Unique Games.
Proceedings of the 35th Computational Complexity Conference, 2020

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

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

Hamilton Cycles in Sparse Robustly Expanding Digraphs.
Electron. J. Comb., 2018

Excluding Hooks and their Complements.
Electron. J. Comb., 2018

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials.
Electron. Notes Discret. Math., 2017

Decomposing tournaments into paths.
Electron. Notes Discret. Math., 2017

Parameterized Traveling Salesman Problem: Beating the Average.
SIAM J. Discret. Math., 2016

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

Mixing of the Glauber dynamics for the ferromagnetic Potts model.
Random Struct. Algorithms, 2016

Finding Shortest Paths Between Graph Colourings.
Algorithmica, 2016

A Precise Threshold for Quasi-Ramsey Numbers.
SIAM J. Discret. Math., 2015

On a Ramsey-type problem of Erdős and Pach.
Electron. Notes Discret. Math., 2015

Obtaining Online Ecological Colourings by Generalizing First-Fit.
Theory Comput. Syst., 2014

On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>-Free Graphs.
J. Graph Theory, 2014

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.
J. Comb. Optim., 2014

Parameterized TSP: Beating the Average.
CoRR, 2014

Colouring Reconfiguration Is Fixed-Parameter Tractable.
CoRR, 2014

Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.
Theor. Comput. Sci., 2013

Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus.
SIAM J. Comput., 2013

Modes preserving wavelet based multi-scale PCA algorithm for compression of smart grid data.
Proceedings of the International Conference on Advances in Computing, 2013

The complexity of finding uniform sparsest cuts in various graph classes.
J. Discrete Algorithms, 2012

On the diameter of reconfiguration graphs for vertex colourings.
Electron. Notes Discret. Math., 2011

Average relational distance in linear extensions of posets.
Discret. Math., 2010

The Complexity Status of Problems Related to Sparsest Cuts.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Partitioning Posets.
Order, 2008

Cutting two graphs simultaneously.
J. Graph Theory, 2008