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

Agarwal, P. K., et al. “Approximate Euclidean shortest paths amid convex obstacles.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Sept. 2009, pp. 283–92.

Agarwal, P. K., et al. “Efficient sensor placement for surveillance problems.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5516 LNCS, Aug. 2009, pp. 301–14. Scopus, doi:10.1007/978-3-642-02085-8_22. Full Text

Agarwal, P. K., et al. “Input-sensitive scalable continuous join query processing.” Acm Transactions on Database Systems, vol. 34, no. 3, Aug. 2009. Scopus, doi:10.1145/1567274.1567275. Full Text

Agarwal, P. K., et al. “Stabbing convex polygons with a segment or a polygon.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS, Dec. 2008, pp. 52–63. Scopus, doi:10.1007/978-3-540-87744-8-5. Full Text

Agarwal, P. K., and J. M. Phillips. “An efficient algorithm for 2D Euclidean 2-center with outliers.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS, Dec. 2008, pp. 64–75. Scopus, doi:10.1007/978-3-540-87744-8-6. Full Text

Agarwal, P. K., et al. “I/O-efflcient algorithms for computing contours on a terrain.” Proceedings of the Annual Symposium on Computational Geometry, Dec. 2008, pp. 129–38. Scopus, doi:10.1145/1377676.1377698. Full Text

Agarwal, P. K., et al. “Untangling triangulations through local explorations.” Proceedings of the Annual Symposium on Computational Geometry, Dec. 2008, pp. 288–97. Scopus, doi:10.1145/1377676.1377726. Full Text

Chandramouli, B., et al. “ProSem: Scalable wide-area publish/subscribe.” Proceedings of the Acm Sigmod International Conference on Management of Data, Dec. 2008, pp. 1315–17. Scopus, doi:10.1145/1376616.1376764. Full Text

Agarwal, P. K., et al. “Algorithms for center and Tverberg points.” Acm Transactions on Algorithms, vol. 5, no. 1, Nov. 2008. Scopus, doi:10.1145/1435375.1435380. Full Text

Agarwal, P. K., et al. “Kinetic and dynamic data structures for closest pair and all nearest neighbors.” Acm Transactions on Algorithms, vol. 5, no. 1, Nov. 2008. Scopus, doi:10.1145/1435375.1435379. Full Text

Pages