Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco Distinguished Professor of Computer Science in Trinity College of Arts and Sciences
  • Professor of Computer Science
  • Professor of Mathematics (Secondary)
  • Faculty Network Member of The Energy Initiative
  • Bass Fellow
External address: D315 Lev Sci Res Ctr, Durham, NC 27708
Internal office address: Box 90129, Durham, NC 27708-0129
Phone: (919) 660-6548

Computational and combinatorial geometry, computational biology, robotics, spatial databases, geographic molecular information systems, and data structures.

Education & Training
  • Ph.D., New York University 1989

  • M.S., University of California - Santa Cruz 1986

  • B.S.E.E., Indian Institute of Technology (India) 1982

Agarwal, P. K., et al. “Geometric optimization revisited.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10000, 2019, pp. 66–84. Scopus, doi:10.1007/978-3-319-91908-9_5. Full Text

Agarwal, P. K. “Simplex range searching and its variants: A review.” A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, 2017, pp. 1–30. Scopus, doi:10.1007/978-3-319-44479-6_1. Full Text

Agarwal, P. K. “Range searching.” Handbook of Discrete and Computational Geometry, Third Edition, 2017, pp. 1057–92. Scopus, doi:10.1201/9781315119601. Full Text

Agarwal, P. K., et al. “Dynamic geometric set cover and hitting set.” Leibniz International Proceedings in Informatics, Lipics, vol. 164, June 2020. Scopus, doi:10.4230/LIPIcs.SoCG.2020.2. Full Text

Raghvendra, S., and P. K. Agarwal. “A Near-linear Time ϵ-Approximation Algorithm for Geometric Bipartite Matching.” Journal of the Acm, vol. 67, no. 3, May 2020. Scopus, doi:10.1145/3393694. Full Text

Agarwal, P. K., and J. Pan. “Near-Linear Algorithms for Geometric Hitting Sets and Set Covers.” Discrete and Computational Geometry, vol. 63, no. 2, Mar. 2020, pp. 460–82. Scopus, doi:10.1007/s00454-019-00099-6. Full Text

Lowe, A., and P. K. Agarwal. “Flood-risk analysis on terrains under the multiflow-direction model.” Acm Transactions on Spatial Algorithms and Systems, vol. 5, no. 4, Sept. 2019. Scopus, doi:10.1145/3340707. Full Text

Rav, M., et al. “Flood risk analysis on terrains.” Acm Transactions on Spatial Algorithms and Systems, vol. 5, no. 1, May 2019. Scopus, doi:10.1145/3295459. Full Text

Agarwal, P. K., et al. “An efficient algorithm for computing high-quality paths amid polygonal obstacles.” Acm Transactions on Algorithms, vol. 14, no. 4, Aug. 2018. Scopus, doi:10.1145/3230650. Full Text

Agarwal, P. K., et al. “Range-max queries on uncertain data.” Journal of Computer and System Sciences, vol. 94, June 2018, pp. 118–34. Scopus, doi:10.1016/j.jcss.2017.09.006. Full Text

Agarwal, PK, Arge, L, and Staals, F. "Improved dynamic geodesic nearest neighbor searching in a simple polygon." Leibniz International Proceedings in Informatics, Lipics 99 (June 1, 2018): 41-414. Full Text

Agarwal, P. K., et al. “Convex Hulls Under Uncertainty.” Algorithmica, vol. 79, no. 2, Oct. 2017, pp. 340–67. Scopus, doi:10.1007/s00453-016-0195-y. Full Text

Agarwal, P. K., et al. “Nearest-Neighbor Searching Under Uncertainty I.” Discrete and Computational Geometry, vol. 58, no. 3, Oct. 2017, pp. 705–45. Scopus, doi:10.1007/s00454-017-9903-x. Full Text

Pages

Agarwal, P. K., et al. “Efficient Indexes for Diverse Top-k Range Queries.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, 2020, pp. 213–27. Scopus, doi:10.1145/3375395.3387667. Full Text

Agarwal, P. K., et al. “An efficient algorithm for generalized polynomial partitioning and its applications.” Leibniz International Proceedings in Informatics, Lipics, vol. 129, 2019. Scopus, doi:10.4230/LIPIcs.SoCG.2019.5. Full Text

Agarwal, P. K., et al. “Maintaining the union of unit discs under insertions with near-optimal overhead.” Leibniz International Proceedings in Informatics, Lipics, vol. 129, 2019. Scopus, doi:10.4230/LIPIcs.SoCG.2019.26. Full Text

Agarwal, P. K., et al. “Efficient algorithms for geometric partial matching.” Leibniz International Proceedings in Informatics, Lipics, vol. 129, 2019. Scopus, doi:10.4230/LIPIcs.SoCG.2019.6. Full Text

Agarwal, P. K., et al. “Approximate minimum-weight matching with outliers under translation.” Leibniz International Proceedings in Informatics, Lipics, vol. 123, 2018. Scopus, doi:10.4230/LIPIcs.ISAAC.2018.26. Full Text

Lowe, A., and P. K. Agarwal. “Flood-risk analysis on terrains under the multiflow-direction model.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, 2018, pp. 53–62. Scopus, doi:10.1145/3274895.3274980. Full Text

Agarwal, P. K., et al. “Union of hypercubes and 3D minkowski sums with random sizes.” Leibniz International Proceedings in Informatics, Lipics, vol. 107, 2018. Scopus, doi:10.4230/LIPIcs.ICALP.2018.10. Full Text

Agarwal, P. K., et al. “Computing the gromov-hausdorff distance for metric trees.” Acm Transactions on Algorithms, vol. 14, no. 2, 2018. Scopus, doi:10.1145/3185466. Full Text

Agarwal, P. K., et al. “Computing shortest paths in the plane with removable obstacles.” Leibniz International Proceedings in Informatics, Lipics, vol. 101, 2018, pp. 51–515. Scopus, doi:10.4230/LIPIcs.SWAT.2018.5. Full Text

Agarwal, P. K., et al. “Subtrajectory clustering: Models and algorithms.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, 2018, pp. 75–87. Scopus, doi:10.1145/3196959.3196972. Full Text

Pages