8 citations · 31 across the 9 of their papers we have counts for
15 papers
Faster Algorithm for Maximum Flow in Directed Planar Graphs with Vertex Capacities
Julian Enoch, Kyle Fox, Dor Mesica +1
We give an -time algorithm for computing maximum integer flows in planar graphs with integer arc {\em and vertex} capacities bounded by…
Approximating the (Continuous) Fréchet Distance
Connor Colombe, Kyle Fox
We describe the first strongly subquadratic time algorithm with subexponential approximation ratio for approximately computing the Fréchet distance between two polygonal chains. Sp…
Minimum Cuts in Surface Graphs
Erin W. Chambers, Jeff Erickson, Kyle Fox +1
We describe algorithms to efficiently compute minimum -cuts and global minimum cuts of undirected surface-embedded graphs. Given an edge-weighted undirected graph with $…
Approximating the Geometric Edit Distance
Kyle Fox, Xinyi Li
Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as si…
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread
Kyle Fox, Jiashuai Lu
The geometric transportation problem takes as input a set of points in -dimensional Euclidean space and a supply function . The goal is to find a transp…
Faster Algorithms for the Geometric Transportation Problem
Pankaj K. Agarwal, Kyle Fox, Debmalya Panigrahi +2
Let and be two point sets in , with and where is a constant. Next, let such that $\sum_{r \in R } λ(r) = \sum_…