Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Viresh Patel
Observed name:
Patel, Viresh
Institution:
Queen Mary University of London
Observed institutions:
Queen Mary University of London,
Durham University,
University of Birmingham,
University of Amsterdam,
Université de Lorraine,
London School of Economics and Political Science
show all 6
ORCID:
0000-0001-8047-350X
Observed ORCID:
0000-0001-8047-350X
OpenAlex ID:
A5031655569
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
2017
·
Viresh Patel
, Guus Regts
·
SIAM Journal on Computing
·
198
PDF
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
2012
·
Marthe Bonamy
, Matthew Johnson
, et al.
·
Journal of Combinatorial Optimization
·
116
PDF
Finding Shortest Paths Between Graph Colourings
2015
·
Matthew Johnson
, Dieter Kratsch
, et al.
·
Algorithmica
·
57
PDF
On Toughness and Hamiltonicity of 2 K 2 ‐Free Graphs
2013
·
Hajo Broersma
, Viresh Patel
, et al.
·
Journal of Graph Theory
·
51
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
2014
·
Daniela Kühn
, John Lapinskas
, et al.
·
Proceedings of the London Mathematical Society
·
40
Mixing of the Glauber dynamics for the ferromagnetic Potts model
2014
·
Magnus Bordewich
, Catherine Greenhill
, et al.
·
Random Structures and Algorithms
·
37
PDF
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
2021
·
Ferenc Bencs
, Ewan Davies
, et al.
·
Annales de l’Institut Henri Poincaré D Combinatorics Physics and their Interactions
·
24
PDF
Tight inequalities among set hitting times in Markov chains
2014
·
Simon Griffiths
, Ross Kang
, et al.
·
Proceedings of the American Mathematical Society
·
24
PDF
On the diameter of reconfiguration graphs for vertex colourings
2011
·
Marthe Bonamy
, Matthew Johnson
, et al.
·
Electronic Notes in Discrete Mathematics
·
22
PDF
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
2013
·
Hajo Broersma
, Petr A. Golovach
, et al.
·
Theoretical Computer Science
·
20
PDF
Poset limits can be totally ordered
2015
·
Jan Hladký
, András Máthé
, et al.
·
Transactions of the American Mathematical Society
·
17
PDF
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
2017
·
Viresh Patel
, Guus Regts
·
Electronic Notes in Discrete Mathematics
·
16
Sampling from the low temperature Potts model through a Markov chain on flows
2022
·
Jeroen Huijben
, Viresh Patel
, et al.
·
Random Structures and Algorithms
·
15
PDF
Computing the Number of Induced Copies of a Fixed Graph in a Bounded Degree Graph
2018
·
Viresh Patel
, Guus Regts
·
Algorithmica
·
15
PDF
Parameterized Traveling Salesman Problem: Beating the Average
2016
·
Gregory Gutin
, Viresh Patel
·
SIAM Journal on Discrete Mathematics
·
15
PDF
Finding Shortest Paths Between Graph Colourings
2014
·
Matthew Johnson
, Dieter Kratsch
, et al.
·
Lecture notes in computer science
·
15
PDF
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
2013
·
Viresh Patel
·
SIAM Journal on Computing
·
15
PDF
The complexity of finding uniform sparsest cuts in various graph classes
2011
·
Paul Bonsma
, Hajo Broersma
, et al.
·
Journal of Discrete Algorithms
·
14
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width
2012
·
Hajo Broersma
, Petr A. Golovach
, et al.
·
Lecture notes in computer science
·
13
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
2024
·
Matthew Jenssen
, Viresh Patel
, et al.
·
Journal of Combinatorial Theory Series B
·
11
Hamilton Cycles in Sparse Robustly Expanding Digraphs
2018
·
Allan Lo
, Viresh Patel
·
The Electronic Journal of Combinatorics
·
11
Excluding Hooks and their Complements
2018
·
Krzysztof Choromanski
, Dvir Falik
, et al.
·
The Electronic Journal of Combinatorics
·
11
Approximate counting using Taylor's theorem: a survey
2022
·
Patel, Viresh
, Regts, Guus
·
arXiv (Cornell University)
·
10
PDF
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
2022
·
Pjotr Buys
, Andreas Galanis
, et al.
·
Forum of Mathematics Sigma
·
10
PDF
Decomposing tournaments into paths
2020
·
Allan Lo
, Viresh Patel
, et al.
·
Proceedings of the London Mathematical Society
·
10
PDF
Show more works
View as search
Works count:
64
Citation count:
891
H-index:
15
I10-index:
26
Year
Topic
Type