Viresh Patel’s Homepage 

Address:

School of Mathematical Sciences

Queen Mary, University of London

Mile End Road

London

E1 4NS

UK

Office:

Maths 252

Email:

viresh.patel@qmul.ac.uk

Publications and Preprints

Parameterised TSP: Beating the Average

(with Gregory Gutin).

(submitted). ( PDF )

A Precise Theshold for Quasi-Ramsey Numbers

(with Ross Kang, Janos Pach, and Guus Regts).

(submitted). ( PDF )

A Domination Algorithm for {0,1}-instances of the Travelling Salesman Problem

(with Daniela Kuhn and Deryk Osthus).

(submitted). ( PDF )

Mixing of the Glauber Dynamics for the Ferromagnetic Potts Model

(with Magnus Bordewich and Catherine Greenhill).

Random Structures and Algorithms (to appear). ( PDF )

Proof of a Conjecture of Thomassen on Hamilton Cycles in Highly Connected Tournaments

(with Daniela Kuhn, John Lapinskas, and Deryk Osthus).

Proceedings of the London Mathematical Society (to appear). ( PDF )

Poset Limits Can Be Totally Ordered

(with Jan Hladky, Andras Mathe, and Oleg Pikhurko).

Transactions of the American Mathematical Society (to appear). ( PDF )

Tight Inequalities Among Set Hitting Times in Markov Chains

(with Simon Griffiths, Ross Kang, and Roberto Oliveira).

Proceedings of the American Mathematical Society 142: 3285-3298 (2014). ( Arxiv )

 Reconfiguration Graphs for Vertex Colourings of Chordal and Chordal Bipartite Graphs 

(with Marthe Bonamy, Matthew Johnson, Ioannis Lignos, and Daniel Paulsma).

J. Combinatorial Optimization 27(1): 132-143 (2014). ( PDF )

On Toughness and Hamiltonicity of 2K₂-free Graphs

(with Hajo Broersma and Artem Pyatkin).

J. Graph Theory 75(3): 244-255 (2014). ( PDF )

Generalizing First-Fit to Obtain Online Ecological Colourings

(with Matthew Johnson, Daniel Paulusma, and Theophile Trunck)

Theory of Computing Systems 54(2): 244-260 (2014). ( PDF )

Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-width

(with Hajo Broersma and Petr Golovach).

Theoretical Computer Science 485: 69-84 (2013). ( PDF )

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

SIAM Journal on Computing 42(3): 1113-1131 (2013). ( PDF )

The Complexity of Finding Uniform Sparsest Cuts in Various Graph Classes

(with Hajo Broersma, Paul Bonsma, and Artem Pyatkin).

J. Discrete Algorithms 14 136-149 (2012). ( Online )

Average Relational Distance in Linear Extensions of Posets

(with Graham Brightwell)

Discrete Math. 310(5): 1016-1021 (2010). ( PDF )

Partitioning Posets

Order 25(2): 131-152 (2008). ( PS )

Cutting Two Graphs Simultaneously

J. Graph Theory 57(1): 19-32 (2008). ( PDF )

Unions of Perfect Matchings in Cubic Graphs and Implications of the Berge-Fulkerson Conjecture - preprint

Partitions of Combinatorial Structures - Thesis ( PS )

Brief Biography

Dec 2013 – Present: I am currently a postdoc at Queen Mary, University of London, as part of the Queen Mary – Warwick alliance. This is an independent postdoctoral position.

June 2012 – Dec 2013: I was a postdoc in the School of Mathematics at the University of Birmingham. I am working on an EPSRC project entitled “Edge Colourings and Hamilton Decompositions of Graphs” with Deryk Osthus.

November 2011 – June 2012: I was a postdoc in the School of Engineering and Computing Sciences at the University of Durham. I was working on an EPSRC project entitled “Approximation and Mixing Times in the Ferromagnetic Potts Model” with Magnus Bordewich.

April 2009 – November 2011: I was a postdoc in the School of Engineering and Computing Sciences at the University of Durham. I was working on an EPSRC project entitled “Structural Vulnerability Measures for Networks and Graphs” with Hajo Broersma.

2005-2009: I was a PhD student at the London School of Economics under the supervision of Graham Brightwell and Jan van den Heuvel.

2001-2005: I was an undergraduate in mathematics at the University of Cambridge, where I also did Part III Mathematics (Certificate of Advanced Studies in Mathematics).