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. “Improved algorithms for uniform partitions of points.” Algorithmica (New York), vol. 32, no. 4, Jan. 2002, pp. 521–39. Scopus, doi:10.1007/s00453-001-0084-9. Full Text

Agarwal, P. K., et al. “Computing approximate shortest paths on convex polytopes.” Algorithmica (New York), vol. 33, no. 2, Jan. 2002, pp. 227–42. Scopus, doi:10.1007/s00453-001-0111-x. Full Text

Agarwal, P. K., and C. M. Procopiuc. “Exact and approximation algorithms for clustering.” Algorithmica (New York), vol. 33, no. 2, Jan. 2002, pp. 201–26. Scopus, doi:10.1007/s00453-001-0110-y. Full Text

Procopiuc, C. M., et al. “A Monte Carlo algorithm for fast projective clustering.” Proceedings of the Acm Sigmod International Conference on Management of Data, Jan. 2002, pp. 418–27. Scopus, doi:10.1145/564736.564739. Full Text

Agarwal, P., et al. “Lenses in arrangements of pseudo-circles and their applications.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 2002, pp. 123–32.

Agarwal, P. K., and S. Hal-Peled. “Maintaining approximate extent measures of moving points.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Dec. 2001, pp. 148–57.

Agarwal, P. K., et al. “On the complexity of many faces in arrangements of circles.” Annual Symposium on Foundations of Computer Science  Proceedings, Jan. 2001, pp. 74–83. Scopus, doi:10.1109/sfcs.2001.959882. Full Text

Agarwal, P. K., et al. “Maintaining the extent of a moving point set.” Discrete and Computational Geometry, vol. 26, no. 3, Jan. 2001, pp. 353–74. Scopus, doi:10.1007/s00454-001-0019-x. Full Text

Agarwal, P. K., et al. “Exact and approximation algorithms for minimum-width cylindrical shells.” Discrete and Computational Geometry, vol. 26, no. 3, Jan. 2001, pp. 307–20. Scopus, doi:10.1007/s00454-001-0039-6. Full Text

Agarwal, P. K., et al. “Minimal trap design.” Proceedings  Ieee International Conference on Robotics and Automation, vol. 3, Jan. 2001, pp. 2243–48. Scopus, doi:10.1109/ROBOT.2001.932956. Full Text

Pages