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. “Subscriber assignment for wide-area content-based publish/subscribe.” Proceedings  International Conference on Data Engineering, June 2011, pp. 267–78. Scopus, doi:10.1109/ICDE.2011.5767882. Full Text

Abam, M. A., et al. “Out-of-order event processing in kinetic data structures.” Algorithmica (New York), vol. 60, no. 2, June 2011, pp. 250–73. Scopus, doi:10.1007/s00453-009-9335-y. Full Text

Agarwal, P. K., et al. “I/O-efficieiit contour queries on terrains.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, May 2011, pp. 268–84.

Afshani, P., et al. “(Approximate) uncertain skylines.” Acm International Conference Proceeding Series, Mar. 2011, pp. 186–96. Scopus, doi:10.1145/1938551.1938576. Full Text

Beutel, A., et al. “Natural neighbor interpolation based grid DEM construction using a GPU.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, Dec. 2010, pp. 172–81. Scopus, doi:10.1145/1869790.1869817. Full Text

Agarwal, P. K., et al. “Network vulnerability to single, multiple, and probabilistic physical attacks.” Proceedings  Ieee Military Communications Conference Milcom, Dec. 2010, pp. 1824–29. Scopus, doi:10.1109/MILCOM.2010.5679556. Full Text

Agarwal, P. K., et al. “Stability of ε-kernels.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6346 LNCS, no. PART 1, Nov. 2010, pp. 487–99. Scopus, doi:10.1007/978-3-642-15775-2_42. Full Text

Agarwal, P. K., et al. “I/O-efficient batched union-find and its applications to terrain analysis.” Acm Transactions on Algorithms, vol. 7, no. 1, Nov. 2010. Scopus, doi:10.1145/1868237.1868249. Full Text

Agarwal, P. K., et al. “Guarding a terrain by two watchtowers.” Algorithmica (New York), vol. 58, no. 2, Oct. 2010, pp. 352–90. Scopus, doi:10.1007/s00453-008-9270-3. Full Text

Mølhave, T., et al. “Scalable algorithms for large high-resolution terrain data.” Acm International Conference Proceeding Series, Aug. 2010. Scopus, doi:10.1145/1823854.1823878. Full Text

Pages

Agarwal, P. K., and M. Van Kreveld. “Connected component and simple polygon intersection searching.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 709 LNCS, 1993, pp. 37–47.

Agarwal, P. K., and J. Matoušek. “Relative neighborhood graphs in three dimensions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129721, 1992, pp. 58–65.

Agarwal, P. K., et al. “Applications of parametric searching in geometric optimization.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129721, 1992, pp. 72–82.

Agarwal, P. K., and M. van Kreveld. “Implicit point location of line segments, with an arrangements an application to motion planning.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 652 LNCS, 1992, pp. 80–91.

Agarwal, P. K., and J. Matoušek. “On range searching with semialgebraic sets.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 629 LNCS, 1992, pp. 1–13.

Agarwal, P. K., et al. “Dynamic half-space reporting, geometric optimization, and minimum spanning trees.” Proceedings  Annual Ieee Symposium on Foundations of Computer Science, Focs, vol. 1992-October, 1992, pp. 80–89. Scopus, doi:10.1109/SFCS.1992.267816. Full Text

Agarwal, P. K., and M. Sharir. “Counting circular arc intersections.” Proceedings of the Annual Symposium on Computational Geometry, 1991, pp. 10–20. Scopus, doi:10.1145/109648.109650. Full Text

Agarwal, P. K., et al. “Intersection queries for curved objects.” Proceedings of the Annual Symposium on Computational Geometry, 1991, pp. 41–50. Scopus, doi:10.1145/109648.109653. Full Text

Agarwal, P. K., and M. Sharir. “Planar geometric location problems and maintaining the width of a planar set.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, 1991, pp. 449–58.

Agarwal, P. K., et al. “Farthest neighbors, maximum spanning trees and related problems in higher dimensions.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 519 LNCS, 1991, pp. 105–16. Scopus, doi:10.1007/BFb0028254. Full Text

Pages