| Publication | Date of Publication | Type |
|---|
Segment proximity graphs and nearest neighbor queries amid disjoint segments
Algorithmica | 2026-07-13 | Paper |
| Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs | 2026-05-29 | Paper |
| Segment proximity graphs and nearest neighbor queries amid disjoint segments | 2026-05-26 | Paper |
| Locality sensitive hashing for efficient similar polygon retrieval | 2026-04-21 | Paper |
| Caching connections in matchings | 2026-01-14 | Paper |
Competitive analysis with a sample and the secretary problem
SIAM Journal on Computing | 2025-12-17 | Paper |
| Improved bounds for geometric permutations | 2025-04-29 | Paper |
| Planning in hierarchical reinforcement learning: guarantees for using local policies | 2025-02-19 | Paper |
| Thompson sampling for adversarial bit prediction | 2025-02-19 | Paper |
| Optimal energetic paths for electric cars | 2025-01-06 | Paper |
| The unweighted and weighted reverse shortest path problem for disk graphs | 2025-01-06 | Paper |
| Expander decomposition with fewer inter-cluster edges using a spectral cut player | 2024-11-14 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2024-11-14 | Paper |
| Dynamic binary search trees: improved lower bounds for the greedy-future Algorithm | 2024-10-08 | Paper |
| Selection from heaps, row-sorted matrices, and X+Y using soft heaps | 2024-08-26 | Paper |
| Online weighted matching with a sample | 2024-07-19 | Paper |
| Simulating a stack using queues | 2024-07-19 | Paper |
Adversarially robust streaming algorithms via differential privacy
Journal of the ACM | 2024-06-06 | Paper |
| Insertion-only dynamic connectivity in general disk graphs | 2024-05-29 | Paper |
| Minimum-cost paths for electric cars | 2024-05-29 | Paper |
| Almost tight bounds for online facility location in the random-order model | 2024-05-14 | Paper |
| Dynamic connectivity in disk graphs | 2024-05-14 | Paper |
Dynamic connectivity in disk graphs
Discrete & Computational Geometry | 2024-01-09 | Paper |
Algorithms and complexity of sandwich problems in graphs (extended abstract)
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Locality Sensitive Hashing for Set-Queries, Motivated by Group Recommendations
(available as arXiv preprint) | 2023-11-02 | Paper |
How to Find a Point in the Convex Hull Privately
(available as arXiv preprint) | 2023-11-02 | Paper |
scientific article; zbMATH DE number 7650377 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Simple confluently persistent catenable lists
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
| Fast approximation of search trees on trees with centroid trees | 2022-09-16 | Paper |
Differentially private learning of geometric concepts
SIAM Journal on Computing | 2022-07-22 | Paper |
Approximate minimum-weight matching with outliers under translation
(available as arXiv preprint) | 2022-07-21 | Paper |
| Stabbing pairwise intersecting disks by five points | 2022-07-21 | Paper |
| A faster deterministic exponential time algorithm for energy games and mean payoff games | 2022-07-21 | Paper |
General techniques for approximate incidences and their application to the camera posing problem
(available as arXiv preprint) | 2022-07-18 | Paper |
Triangles and girth in disk graphs and transmission graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
| Separating adaptive streaming from oblivious streaming using the bounded storage model | 2022-04-22 | Paper |
Pairing heaps: the forward variant
(available as arXiv preprint) | 2021-08-04 | Paper |
Improved bounds for multipass pairing heaps and path-balanced binary search trees
(available as arXiv preprint) | 2021-08-04 | Paper |
| Min-cost bipartite perfect matching with delays | 2021-07-28 | Paper |
| Union of hypercubes and 3D Minkowski sums with random sizes | 2021-07-28 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Stabbing pairwise intersecting disks by five points
Discrete Mathematics | 2021-06-14 | Paper |
Clustering in hypergraphs to minimize average edge service time
ACM Transactions on Algorithms | 2021-05-03 | Paper |
Union of hypercubes and 3D Minkowski sums with random sizes
Discrete & Computational Geometry | 2021-04-29 | Paper |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
SIAM Journal on Computing | 2021-04-14 | Paper |
Competitive Analysis with a Sample and the Secretary Problem
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Output sensitive algorithms for approximate incidences and their applications
Computational Geometry | 2021-01-07 | Paper |
Output sensitive algorithms for approximate incidences and their applications
Computational Geometry | 2021-01-07 | Paper |
Restoration by path concatenation: fast recovery of MPLS paths
Distributed Computing | 2020-12-03 | Paper |
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
Discrete & Computational Geometry | 2020-10-23 | Paper |
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
Discrete & Computational Geometry | 2020-06-16 | Paper |
| Output sensitive algorithms for approximate incidences and their applications | 2020-05-27 | Paper |
| scientific article; zbMATH DE number 7205030 (Why is no real title available?) | 2020-05-27 | Paper |
| Clustering in Hypergraphs to Minimize Average Edge Service Time | 2020-05-27 | Paper |
Reachability oracles for directed transmission graphs
Algorithmica | 2020-04-01 | Paper |
Faster k-SAT algorithms using biased-PPSZ
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
Computational Geometry | 2019-10-25 | Paper |
A sort of an adversary
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Reporting neighbors in high-dimensional Euclidean space
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Computing the discrete Fréchet distance in subquadratic time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications | 2019-05-10 | Paper |
| Line transversals of convex polyhedra in \(\mathbb{R}^3\) | 2019-05-06 | Paper |
| A simpler implementation and analysis of Chazelle's soft heaps | 2019-05-06 | Paper |
| Stream sampling for variance-optimal estimation of subset sums | 2019-05-06 | Paper |
Adjacency labeling schemes and induced-universal graphs
SIAM Journal on Discrete Mathematics | 2019-01-16 | Paper |
Hollow heaps
ACM Transactions on Algorithms | 2018-11-12 | Paper |
Submatrix maximum queries in Monge matrices and partial Monge matrices, and their applications
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Thin heaps, thick heaps
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
ACM Transactions on Algorithms | 2018-11-05 | Paper |
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Spanners for directed transmission graphs
SIAM Journal on Computing | 2018-08-21 | Paper |
Upward max-min fairness
Journal of the ACM | 2018-08-02 | Paper |
Approximating the k-level in three-dimensional plane arrangements
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
(1 + )-approximate f-sensitive distance oracles
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved bounds for multipass pairing heaps and path-balanced binary search trees
(available as arXiv preprint) | 2018-06-22 | Paper |
| scientific article; zbMATH DE number 6876089 (Why is no real title available?) | 2018-05-29 | Paper |
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Routing in unit disk graphs
Algorithmica | 2018-04-11 | Paper |
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
(available as arXiv preprint) | 2018-03-15 | Paper |
| Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time | 2018-03-15 | Paper |
Approximating the k-Level in Three-Dimensional Plane Arrangements
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Minimum-cost flows in unit-capacity networks
Theory of Computing Systems | 2018-02-01 | Paper |
| scientific article; zbMATH DE number 6829368 (Why is no real title available?) | 2018-01-24 | Paper |
Guarding a terrain by two watchtowers
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
| Spanners and Reachability Oracles for Directed Transmission Graphs | 2017-10-10 | Paper |
The amortized cost of finding the minimum
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Average distance queries through weighted samples in graphs and metric spaces: high scalability with tight statistical guarantees
(available as arXiv preprint) | 2017-08-31 | Paper |
| Minimum cost flows in graphs with unit capacities | 2017-01-24 | Paper |
Unique maximum matching algorithms
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Exploiting regularities in web traffic patterns for cache replacement
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Connection caching
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Routing in unit disk graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Restoration by path concatenation, fast recovery of MPLS paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
Discrete & Computational Geometry | 2016-02-03 | Paper |
Faster and more dynamic maximum flow by incremental breadth-first search
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The Temp Secretary Problem
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Weak ε-nets and interval chains
Journal of the ACM | 2015-11-11 | Paper |
