Pankaj K. Agarwal

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A subquadratic algorithm for computing the L₁-distance between two terrains2026-08-11Paper
Optimal motion planning for two square robots in a rectilinear environment2026-08-11Paper
Near-optimal min-sum multi-robot motion planning in a planar polygonal environment2026-07-13Paper
Computing the heaviest disk and related problems2026-07-13Paper
Segment proximity graphs and nearest neighbor queries amid disjoint segments
Algorithmica
2026-07-13Paper
Semi-algebraic off-line range searching and biclique partitions in the plane
Discrete & Computational Geometry
2026-07-03Paper
Efficient approximation algorithm for computing Wasserstein barycenter under euclidean metric2026-07-03Paper
Lower envelopes of surface patches in 3-space2026-05-26Paper
Segment proximity graphs and nearest neighbor queries amid disjoint segments2026-05-26Paper
Approximating shortest paths on a nonconvex polyhedron2026-05-21Paper
An output-sensitive algorithm for computing the union of cubes and fat boxes in 3D2026-05-12Paper
Dynamic enumeration of similarity joins2026-05-12Paper
On the complexity of many faces in arrangements of circles2026-05-08Paper
Clustering under perturbation stability in near-linear time2026-03-23Paper
Semi-algebraic off-line range searching and biclique partitions in the plane2025-11-24Paper
Computing data distribution from query selectivities2025-11-11Paper
Parametric and kinetic minimum spanning trees2025-10-29Paper
Intersection queries for flat semi-algebraic objects in three dimensions and related problems
ACM Transactions on Algorithms
2025-10-01Paper
On two-handed planar assembly partitioning with connectivity constraints
ACM Transactions on Algorithms
2025-07-22Paper
On range searching with semialgebraic sets. II2025-05-05Paper
Computing instance-optimal kernels in two dimensions
Discrete & Computational Geometry
2025-03-19Paper
Line intersection searching amid unit balls in 3-space
Algorithmica
2025-02-14Paper
Vertical decomposition in 3D and 4D with applications to line nearest-neighbor searching in 3D2024-11-28Paper
Fast and accurate approximations of the optimal transport in semi-discrete and discrete settings2024-11-28Paper
Fast approximation algorithms for piercing boxes by points2024-11-28Paper
Near-optimal min-sum motion planning for two square robots in a polygonal environment2024-11-28Paper
Decomposing the complement of the union of cubes and boxes in three dimensions
Discrete & Computational Geometry
2024-10-25Paper
Computing instance-optimal kernels in two dimensions2024-10-16Paper
Line intersection searching amid unit balls in 3-space2024-10-16Paper
Multi-robot motion planning for unit discs with revolving areas2024-09-11Paper
On reverse shortest paths in geometric proximity graphs2024-09-11Paper
An improved \(\varepsilon\)-approximation algorithm for geometric bipartite matching2024-05-27Paper
Intersection queries for flat semi-algebraic objects in three dimensions and related problems2024-05-14Paper
scientific article; zbMATH DE number 7788424 (Why is no real title available?)2024-01-15Paper
scientific article; zbMATH DE number 7788443 (Why is no real title available?)
(available as arXiv preprint)
2024-01-15Paper
Deterministic, near-linear <i>𝜀</i> -approximation algorithm for geometric bipartite matching
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
On reverse shortest paths in geometric proximity graphs
Computational Geometry
2023-11-23Paper
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead
ACM Transactions on Algorithms
2023-10-31Paper
Multi-robot motion planning for unit discs with revolving areas
Computational Geometry
2023-07-31Paper
Connected component and simple polygon intersection searching
Lecture Notes in Computer Science
2023-01-18Paper
Star unfolding of a polytope with applications
SWAT 90
2022-12-09Paper
Intersection queries in sets of disks
SWAT 90
2022-12-09Paper
Computing depth orders and related problems
Algorithm Theory — SWAT '94
2022-12-09Paper
Selection in monotone matrices and computing k th nearest neighbors
Algorithm Theory — SWAT '94
2022-12-09Paper
Maintaining the extent of a moving point set
Lecture Notes in Computer Science
2022-08-19Paper
On range searching with semialgebraic sets
Mathematical Foundations of Computer Science 1992
2022-08-18Paper
Approximate minimum-weight matching with outliers under translation
(available as arXiv preprint)
2022-07-21Paper
An efficient algorithm for generalized polynomial partitioning and its applications2022-07-18Paper
Efficient algorithms for geometric partial matching
(available as arXiv preprint)
2022-07-18Paper
Maintaining the union of unit discs under insertions with near-optimal overhead
(available as arXiv preprint)
2022-07-18Paper
Geometric optimization revisited2022-02-16Paper
Union of hypercubes and 3D Minkowski sums with random sizes2021-07-28Paper
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
SIAM Journal on Computing
2021-05-27Paper
Union of hypercubes and 3D Minkowski sums with random sizes
Discrete & Computational Geometry
2021-04-29Paper
Maintaining Reeb graphs of triangulated 2-manifolds2020-11-25Paper
A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
Journal of the ACM
2020-11-11Paper
Computing shortest paths in the plane with removable obstacles2020-08-25Paper
Improved dynamic geodesic nearest neighbor searching in a simple polygon
(available as arXiv preprint)
2020-08-18Paper
scientific article; zbMATH DE number 7204982 (Why is no real title available?)2020-05-27Paper
Near-linear algorithms for geometric hitting sets and set covers
Discrete & Computational Geometry
2020-01-31Paper
Computing the discrete Fréchet distance in subquadratic time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Algorithms for the transportation problem in geometric settings2019-05-10Paper
Approximate Euclidean shortest paths amid convex obstacles2019-05-06Paper
An efficient algorithm for computing high-quality paths amid polygonal obstacles
ACM Transactions on Algorithms
2019-03-28Paper
Computing the Gromov-Hausdorff distance for metric trees
ACM Transactions on Algorithms
2018-11-13Paper
Nearest-neighbor searching under uncertainty. II
ACM Transactions on Algorithms
2018-11-05Paper
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms
2018-11-05Paper
Algorithms for center and Tverberg points
ACM Transactions on Algorithms
2018-11-05Paper
Faster algorithms for the geometric transportation problem
(available as arXiv preprint)
2018-08-13Paper
Efficient Algorithms for k-Regret Minimizing Sets
(available as arXiv preprint)
2018-08-13Paper
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-16Paper
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
An Efficient Algorithm for Placing Electric Vehicle Charging Stations.2018-04-19Paper
Range-max queries on uncertain data
Journal of Computer and System Sciences
2018-04-18Paper
Simplex Range Searching and Its Variants: A Review
A Journey Through Discrete Mathematics
2018-02-26Paper
Approximating dynamic time warping and edit distance for a pair of point sequences
(available as arXiv preprint)
2018-01-30Paper
Nearest-neighbor searching under uncertainty. I
Discrete & Computational Geometry
2017-10-25Paper
Guarding a terrain by two watchtowers
Proceedings of the twenty-first annual symposium on Computational geometry
2017-10-20Paper
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
2017-10-20Paper
Maintaining contour trees of dynamic terrains2017-10-10Paper
Convex hulls under uncertainty
Algorithmica
2017-10-10Paper
Computing approximate shortest paths on convex polytopes
Proceedings of the sixteenth annual symposium on Computational geometry
2017-09-29Paper
On the number of congruent simplices in a point
Proceedings of the seventeenth annual symposium on Computational geometry
2017-09-29Paper
Box-trees and R-trees with near-optimal query time
Proceedings of the seventeenth annual symposium on Computational geometry
2017-09-29Paper
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
Hausdorff distance under translation for points and balls
Proceedings of the nineteenth annual symposium on Computational geometry
2017-09-29Paper
On lines avoiding unit balls in three dimensions
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
Algorithms for center and Tverberg points
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
A scalable simulator for forest dynamics
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
A 2D kinetic triangulation with near-quadratic topological changes
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
A near-linear constant-factor approximation for Euclidean bipartite matching?
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
Practical methods for shape fitting and kinetic data structures using core sets
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
Extreme elevation on a 2-manifold
Proceedings of the twentieth annual symposium on Computational geometry
2017-09-29Paper
I/O-efficient contour queries on terrains2017-09-29Paper
Linear approximation of simple objects
Information Processing Letters
2016-05-26Paper
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
Discrete & Computational Geometry
2016-02-03Paper
Computing the Gromov-Hausdorff distance for metric trees
Lecture Notes in Computer Science
2016-01-11Paper
Mergeable summaries
ACM Transactions on Database Systems
2015-09-03Paper
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms
2015-09-02Paper
scientific article; zbMATH DE number 6472587 (Why is no real title available?)2015-08-14Paper
← Previous 100   1   2   3   Next 100 →


Research outcomes over time


This page was built for person: Pankaj K. Agarwal