Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
Chandra Chekuri, F. Bruce Shepherd, Christophe Wei...
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pir...