Papers

Below are some of my recent publications and manuscripts. I hope to upload the rest sometime soon. In the meantime, please check my CV for the complete list.

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs

Proceedings of the 32nd Annual European Symposium on Algorithms (ESA), 56:1–56:14, 2024
pdf slides
Fréchet edit distance

Joint work with Amir Nayyeri, Jonathan James Perry, Benjamin Raichel

Proceedings of the 40th International Symposium on Computational Geometry (SoCG), 58:1–58:15, 2024
pdf
Clustering with faulty centers

Joint work with Hongyao Huang, Benjamin Raichel

Computational Geometry: Theory and Applications (CGTA), 117, Article 102052, 2024, special issue of invited papers from the 33rd International Symposium on Algorithms and Computation
pdf
A deterministic near-linear time approximation scheme for geometric transportation

Joint work with Jiashaui Lu

Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS), 1301–1315, 2023
pdf
Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions

Joint work with Debmalya Panigrahi, Fred Zhang

ACM Transactions on Algorithms (TALG), 19(2), Article No. 13, 2023
pdf
Minimum cuts in surface graphs

Joint work with Erin W. Chambers, Jeff Erickson, Amir Nayyeri

SIAM Journal on Computing (SICOMP), 52(1), 156--195, 2023
pdf
Computation of cycle bases in surface embedded graphs

Joint work with Thomas Stanley

Proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC), 13:1–10:13, 2022
pdf
Approximating the geometric edit distance

Joint work with Xinyi Li

Algorithmica, 84(9), 2395–2413, 2022
pdf
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread

Joint work with Jiashuai Lu

Journal of Computational Geometry, 13(1), 204–225
pdf
A faster algorithm for maximum flow in directed planar graphs with vertex capacities

Joint work with Julian Enoch, Dor Mesica, Shay Mozes

Proceedings of the 32nd International Symposium on Algorithms and Computation (ISAAC), 72:1–72:16, 2021
pdf
Approximating the (continuous) Fréchet distance

Joint work with Connor Colombe

Proceedings of the 37th International Symposium on Computational Geometry (SoCG), 26:1–26:14, 2021
pdf
Trajectory planning for an articulated probe

Ka Yaw Teo, Ovidiu Daescu, Kyle Fox

Computational Geometry: Theory and Applications (CGTA), 90, Article 101655, 2020, special issue of invited papers from the 30th Canadian Conference on Computational Geometry
pdf
Holiest minimum-cost paths and flows in surface graphs

Joint work with Jeff Erickson, Luvsandondov Lkhamsuren

Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC), 1319–1332, 2018
pdf