Viresh Patel’s Homepage 

 

Contact

Address:

School of Engineering and Computing Sciences

 

Durham University

 

Science Laboratories

 

South Road

 

Durham

 

DH1 3LE

 

England

 

 

Office:

CS 1.09

Telephone:

+ 44 (0)191 33 41745

Fax:

+ 44 (0)191 33 41701

Email:

viresh.patel@durham.ac.uk

Research

My interests include

- extremal graph and hypergraph theory
- partially ordered sets
- algorithms

Publications and Preprints

 

On the Diameter of Reconfiguration Graphs for Vertex Colourings 

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

Submitted.

 

 

On Toughness and Hamiltonicity of 2K2-free Graphs

(joint work with Hajo Broersma and Artem Pyatkin).

Submitted.

 

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

(with Hajo Broersma and Petr Golovach).

Proceedings of International Symposium on Parameterized and Exact Computation 2011 - to appear.  (PDF)

Submitted.

 

The Complexity of Finding Uniform Sparsest Cuts in Various Graph Classes

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

Journal of Discrete Algorithms (Online)

 

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

Proceedings of the 18th Annual European Symposium (ESA 2010), Liverpool, UK, September 6-8, 2010, Lecture Notes in Computer Science 6346, 561-572 (PDF)

Submitted journal version can be found here.

 

Generalizing First-Fit to Obtain Online Ecological Colourings

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

Proceedings of the 5th International Computer Science Symposium in Russia(CSR 2010), Kazan, Russia, June 16-20, 2010, Lecture Notes in Computer Science 6072, 240-251 (PDF)

 

Average Relational Distance in Linear Extensions of Posets

(joint work with Graham Brightwell)

Discrete Mathematics (PDF)

 

Partitioning Posets

Order 25 (2008), no. 2, 131-152 (PS)

 

Cutting Two Graphs Simultaneously

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

 

Unions of Perfect Matchings in Cubic Graphs and Implications of the Berge-Fulkerson Conjecture - preprint can be found here

 

A Stability Result for 3-Uniform Hypergraphs - preprint (PDF)

A more complete (and more correct!) version appears in my thesis, below.

 

Poset Regularity preprint - preprint (PDF)

A more complete (and more correct!) version appears in my thesis, below.

 

Partitions of Combinatorial Structures - Thesis (PS)

 

Brief Biography

April 2009 - present: I am currently a postdoc in the School of Engineering and Computing Sciences at the University of Durham. I am working on an EPSRC-funded project entitled “Structural Vulnerability Measures for Networks and Graphs” with Hajo Broersma and Artem Pyatkin

 

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).