| Publication | Date of Publication | Type |
|---|
| Approximating densest subgraph in geometric intersection graphs | 2026-06-24 | Paper |
| Two results on LPT: a near-linear time algorithm and parcel delivery using drones | 2026-06-12 | Paper |
| Simple multi-pass streaming algorithms for skyline points and extreme points | 2026-04-21 | Paper |
| Active learning a convex body in low dimensions | 2026-03-18 | Paper |
| Online and dynamic algorithms for geometric set cover and hitting set | 2024-10-16 | Paper |
| A simple polynomial time algorithm for max cut on laminar geometric intersection graphs | 2024-09-12 | Paper |
| 4D range reporting in the pointer machine model in almost-optimal time | 2024-05-14 | Paper |
Generic Techniques for Building Top- <i>k</i> Structures
ACM Transactions on Algorithms | 2023-10-31 | Paper |
| Orthogonal point location and rectangle stabbing queries in 3-d | 2023-06-05 | Paper |
| Searching for the closest-pair in a query translate | 2022-07-18 | Paper |
New bounds for range closest-pair problems
Discrete & Computational Geometry | 2022-06-03 | Paper |
Approximate range counting revisited
(available as arXiv preprint) | 2021-09-07 | Paper |
Orthogonal point location and rectangle stabbing queries in 3-d
(available as arXiv preprint) | 2021-07-28 | Paper |
Active-learning a convex body in low dimensions
Algorithmica | 2021-06-11 | Paper |
Searching for the closest-pair in a query translate
(available as arXiv preprint) | 2021-03-17 | Paper |
Range closest-pair search in higher dimensions
Computational Geometry | 2021-01-07 | Paper |
New bounds for range closest-pair problems
(available as arXiv preprint) | 2020-08-18 | Paper |
An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup>
Mathematics of Operations Research | 2020-04-30 | Paper |
Range closest-pair search in higher dimensions
Lecture Notes in Computer Science | 2020-01-16 | Paper |
| Approximate range counting revisited | 2018-08-13 | Paper |
| scientific article; zbMATH DE number 6876123 (Why is no real title available?) | 2018-05-29 | Paper |
Improved bounds for orthogonal point enclosure query and point location in orthogonal subdivisions in R^3
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
A bottleneck matching problem with edge-crossing constraints
International Journal of Computational Geometry & Applications | 2016-03-14 | Paper |
Range search on tuples of points
Journal of Discrete Algorithms | 2015-02-13 | Paper |
Data structures for range-aggregation over categories
International Journal of Foundations of Computer Science | 2012-08-29 | Paper |
Efficient top-k queries for orthogonal ranges
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Range-Aggregate Queries Involving Geometric Aggregation Operations
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
