In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
We develop a general theory of the swelling kinetics of polymer gels, with the view that a polymer gel is a two-phase fluid. The model we propose is a free boundary problem and ca...
James P. Keener, Sarthok Sircar, Aaron L. Fogelson
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...