| Publication | Date of Publication | Type |
|---|
| Clustering with faulty centers | 2024-09-11 | Paper |
| Computation of cycle bases in surface embedded graphs | 2024-09-11 | Paper |
scientific article; zbMATH DE number 7788645 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread | 2023-11-02 | Paper |
Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
ACM Transactions on Algorithms | 2023-10-23 | Paper |
A near-linear time approximation scheme for geometric transportation with arbitrary supplies and spread
(available as arXiv preprint) | 2023-06-05 | Paper |
Minimum Cuts in Surface Graphs
SIAM Journal on Computing | 2023-04-04 | Paper |
| Approximating the geometric edit distance | 2023-02-03 | Paper |
Approximating the geometric edit distance
Algorithmica | 2022-08-18 | Paper |
| Geometric optimization revisited | 2022-02-16 | Paper |
| Maintaining Reeb graphs of triangulated 2-manifolds | 2020-11-25 | Paper |
Trajectory planning for an articulated probe
Computational Geometry | 2020-10-23 | Paper |
Minimum cut and minimum \(k\)-cut in hypergraphs via branching contractions
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Holiest minimum-cost paths and flows in surface graphs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Non-clairvoyantly scheduling to minimize convex functions
Algorithmica | 2019-08-20 | Paper |
Energy Efficient Scheduling of Parallelizable Jobs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Shortest non-trivial cycles in directed and undirected surface graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Weighted flowtime on capacitated machines
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Global minimum cuts in surface embedded graphs | 2019-05-10 | Paper |
An efficient algorithm for computing high-quality paths amid polygonal obstacles
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Computing the Gromov-Hausdorff distance for metric trees
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Faster algorithms for the geometric transportation problem
(available as arXiv preprint) | 2018-08-13 | Paper |
An efficient algorithm for computing high-quality paths amid polygonal obstacles
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Energy efficient scheduling of parallelizable jobs
Theoretical Computer Science | 2018-04-16 | Paper |
Approximating dynamic time warping and edit distance for a pair of point sequences
(available as arXiv preprint) | 2018-01-30 | Paper |
| Minimum cycle and homology bases of surface embedded graphs | 2018-01-30 | Paper |
| Online scheduling on identical machines using SRPT | 2017-09-29 | Paper |
Online scheduling on identical machines using SRPT
(available as arXiv preprint) | 2017-09-29 | Paper |
Minimum cycle and homology bases of surface-embedded graphs
Journal of Computational Geometry | 2017-03-30 | Paper |
Integrating and sampling cuts in bounded treewidth graphs
Association for Women in Mathematics Series | 2016-11-16 | Paper |
Computing the Gromov-Hausdorff distance for metric trees
Lecture Notes in Computer Science | 2016-01-11 | Paper |
A polynomial-time bicriteria approximation scheme for planar bisection
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Counting and sampling minimum cuts in genus g graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Counting and sampling minimum cuts in genus \(g\) graphs
Discrete & Computational Geometry | 2014-11-14 | Paper |
| Spanning paths in Fibonacci-sum graphs | 2014-04-30 | Paper |
Online non-clairvoyant scheduling to simultaneously minimize all convex functions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Upper bounds for maximally greedy binary search trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
