Pankaj K. Agarwal

Pankaj K. Agarwal
  • RJR Nabisco Distinguished 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., and C. M. Procopiuc. “Approximation algorithms for projective clustering.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 2000, pp. 538–47.

Agarwal, P. K., et al. “Computing approximate shortest paths on convex polytopes.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 2000, pp. 270–79.

Agarwal, P. K., et al. “Indexing moving points.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, Jan. 2000, pp. 175–86.

Agarwal, P. K., et al. “Lower Bounds for Kinetic Planar Subdivisions.” Discrete and Computational Geometry, vol. 24, no. 4, Jan. 2000, pp. 721–33. Scopus, doi:10.1007/s4540010060. Full Text

Agarwal, P. K., et al. “Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications.” Siam Journal on Computing, vol. 29, no. 3, Dec. 1999, pp. 912–53.

Agarwal, P. K., and M. Sharir. “Motion planning of a ball amid segments in three dimensions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 1999, pp. 21–30.

Agarwal, P. K., and J. O’Rourke. “Open Problems Presented at SCG'98.” Journal of Algorithms, vol. 30, no. 2, Jan. 1999, pp. 449–53.

Agarwal, P. K., et al. “I/O-efficient dynamic point location in monotone planar subdivisions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 1999, pp. 11–20.

Varadarajan, K. R., and P. K. Agarwal. “Approximation algorithms for bipartite and non-bipartite matching in the plane.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Jan. 1999, pp. 805–14.

Agarwal, P. K., et al. “Lower bounds for kinetic planar subdivisions.” Proceedings of the Annual Symposium on Computational Geometry, Jan. 1999, pp. 247–54.

Pages