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

Flikkema, P. G., et al. “Model-driven dynamic control of embedded wireless sensor networks.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3993 LNCS-III, Jan. 2006, pp. 409–16. Scopus, doi:10.1007/11758532_55. Full Text

Agarwal, P. K., et al. “Faster algorithms for optimal Multiple Sequence Alignment based on pairwise comparisons.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3692 LNBI, Dec. 2005, pp. 315–27. Scopus, doi:10.1007/11557067_26. Full Text

Agarwal, P. K., et al. “Monitoring continuous band-join queries over dynamic data.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3827 LNCS, Dec. 2005, pp. 349–59. Scopus, doi:10.1007/11602613_36. Full Text

Agarwal, P. K., et al. “Guarding a terrain by two watchtowers.” Proceedings of the Annual Symposium on Computational Geometry, Dec. 2005, pp. 346–55. Scopus, doi:10.1145/1064092.1064145. Full Text

Agarwal, P. K., et al. “An optimal dynamic interval stabbing-max data structure?Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, July 2005, pp. 803–12.

Agarwal, P. K., et al. “Lower bound for sparse Euclidean spanners.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, July 2005, pp. 670–71.

Agarwal, P. K., and M. Sharir. “Pseudo-line arrangements: Duality, algorithms, and applications.” Siam Journal on Computing, vol. 34, no. 3, June 2005, pp. 526–52. Scopus, doi:10.1137/S0097539703433900. Full Text

Agarwal, P. K., et al. “Approximation algorithms for a k-line center.” Algorithmica (New York), vol. 42, no. 3–4, June 2005, pp. 221–30. Scopus, doi:10.1007/s00453-005-1166-x. Full Text

Agarwal, P. K., et al. “Near-linear time approximation algorithms for curve simplification.” Algorithmica (New York), vol. 42, no. 3–4, June 2005, pp. 203–19. Scopus, doi:10.1007/s00453-005-1165-y. Full Text

Agarwal, P. K., et al. “I/O-efficient construction of constrained delaunay triangulations.” Lecture Notes in Computer Science, vol. 3669, Jan. 2005, pp. 355–66. Scopus, doi:10.1007/11561071_33. Full Text

Pages