Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
Emden R. Gansner, Yifan Hu, Michael Kaufmann, Step...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica