Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco Professor of Computer Science in Trinity College of Arts and Sciences
  • Professor of Computer Science
  • Chair 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 at Santa Cruz 1986

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

Yu, A., et al. “Top-k Preferences in High Dimensions.” Ieee Transactions on Knowledge and Data Engineering, vol. 28, no. 2, Feb. 2016, pp. 311–25. Scopus, doi:10.1109/TKDE.2015.2451630. Full Text

Agarwal, P. K., et al. “Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions.” Discrete and Computational Geometry, vol. 54, no. 4, Sept. 2015, pp. 871–904. Scopus, doi:10.1007/s00454-015-9729-3. Full Text

Agarwal, P. K., et al. “Stable Delaunay Graphs.” Discrete and Computational Geometry, vol. 54, no. 4, Sept. 2015, pp. 905–29. Scopus, doi:10.1007/s00454-015-9730-x. Full Text

Agarwal, P. K., et al. “Maintaining Contour Trees of Dynamic Terrains.” Leibniz International Proceedings in Informatics, Lipics, vol. 34, June 2015, pp. 796–811. Scopus, doi:10.4230/LIPIcs.SOCG.2015.796. Full Text

Agarwal, P. K., and R. Sharathkumar. “Streaming Algorithms for Extent Problems in High Dimensions.” Algorithmica, vol. 72, no. 1, May 2015, pp. 83–98. Scopus, doi:10.1007/s00453-013-9846-4. Full Text

Agarwal, P. K., et al. “Computing the Gromov-Hausdorff distance for metric trees.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9472, Jan. 2015, pp. 529–40. Scopus, doi:10.1007/978-3-662-48971-0_45. Full Text

Agarwal, P. K., and R. Sharathkumar. “Streaming Algorithms for Extent Problems in High Dimensions.” Algorithmica, vol. 72, no. 1, 2015, pp. 83–98. Scival, doi:10.1007/s00453-013-9846-4. Full Text

Sankararaman, S., et al. “On channel-discontinuity-constraint routing in wireless networks.” Ad Hoc Networks, vol. 13, no. PART A, Feb. 2014, pp. 153–69. Scopus, doi:10.1016/j.adhoc.2011.04.011. Full Text

Sankararaman, Swaminathan, et al. “On Channel-Discontinuity-Constraint Routing in Wireless Networks..” Ad Hoc Networks, vol. 13, no. Pt A, Feb. 2014, pp. 153–69. Epmc, doi:10.1016/j.adhoc.2011.04.011. Full Text

Salzman, O., et al. “Sparsification of motion-planning roadmaps by edge contraction.” International Journal of Robotics Research, vol. 33, no. 14, Jan. 2014, pp. 1711–25. Scopus, doi:10.1177/0278364914556517. Full Text

Pages

Agarwal, P. K., et al. “Efficient algorithms for k-regret minimizing sets.” Leibniz International Proceedings in Informatics, Lipics, vol. 75, 2017. Scopus, doi:10.4230/LIPIcs.SEA.2017.7. Full Text

Agarwal, P. K., et al. “Faster algorithms for the geometric transportation problem.” Leibniz International Proceedings in Informatics, Lipics, vol. 77, 2017, pp. 71–716. Scopus, doi:10.4230/LIPIcs.SoCG.2017.7. Full Text

Wu, Y., et al. “Finding diverse, high-value representatives on a surface of answers.” Proceedings of the Vldb Endowment, vol. 10, no. 7, 2017, pp. 793–804. Scopus, doi:10.14778/3067421.3067428. Full Text

Garg, N., et al. “GOASREP: Goal oriented approach for software requirements elicitation and prioritization using analytic hierarchy process.” Advances in Intelligent Systems and Computing, vol. 516, 2017, pp. 281–87. Scopus, doi:10.1007/978-981-10-3156-4_28. Full Text

Agarwal, P. K., et al. “An efficient algorithm for placing electric vehicle charging stations.” Leibniz International Proceedings in Informatics, Lipics, vol. 64, 2016, pp. 7.1-7.12. Scopus, doi:10.4230/LIPIcs.ISAAC.2016.7. Full Text

Nath, A., et al. “Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, 2016. Scopus, doi:10.1145/2996913.2996952. Full Text

Ying, R., et al. “A simple efficient approximation algorithm for dynamic time warping.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, 2016. Scopus, doi:10.1145/2996913.2996954. Full Text

Agarwal, P. K., et al. “Range-max queries on uncertain data.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, vol. 26-June-01-July-2016, 2016, pp. 465–76. Scopus, doi:10.1145/2902251.2902281. Full Text

Agarwal, P. K., et al. “Parallel algorithms for constructing range and nearest-neighbor searching data structures.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, vol. 26-June-01-July-2016, 2016, pp. 429–40. Scopus, doi:10.1145/2902251.2902303. Full Text

Agarwal, P. K., et al. “An efficient algorithm for computing high-quality paths amid polygonal obstacles.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. 2, 2016, pp. 1179–92.

Pages