Viresh Patel

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

In this paper, we give the first polynomial-time algorithm for determining the edge expansion for a graph of fixed orientable genus. We show that for a multigraph

A Precise Threshold For Quasi-Ramsey Numbers

G

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

with

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

m

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

edges and orientable genus

Parameterized Traveling Salesman Problem: Beating the Average

g

Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials

, the edge expansion of

Excluding Hooks and their Complements

G

Hamilton Cycles in Sparse Robustly Expanding Digraphs.

can be determined in time

Decomposing tournaments into paths

m^{O(g)}