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. “Mergeable summaries.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, June 2012, pp. 23–34. Scopus, doi:10.1145/2213556.2213562. Full Text

Agarwal, P. K., et al. “An optimal dynamic data structure for stabbing-semigroup queries.” Siam Journal on Computing, vol. 41, no. 1, June 2012, pp. 104–27. Scopus, doi:10.1137/10078791X. Full Text

Agarwal, P. K., et al. “Near-linear approximation algorithms for geometric hitting sets.” Algorithmica, vol. 63, no. 1–2, June 2012, pp. 1–25. Scopus, doi:10.1007/s00453-011-9517-2. Full Text

Sharathkumar, R., and P. K. Agarwal. “Algorithms for the transportation problem in geometric settings.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Apr. 2012, pp. 306–17.

Beutel, A., et al. “TerraNNI: Natural neighbor interpolation on a 3D grid using a GPU.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, Dec. 2011, pp. 64–73. Scopus, doi:10.1145/2093973.2093984. Full Text

Agarwal, P. K., et al. “Distributed localization and clustering using data correlation and the Occam's razor principle.” 2011 International Conference on Distributed Computing in Sensor Systems and Workshops, Dcoss’11, Sept. 2011. Scopus, doi:10.1109/DCOSS.2011.5982164. Full Text

Agarwal, P. K., et al. “The resilience of WDM networks to probabilistic geographical failures.” Proceedings  Ieee Infocom, Aug. 2011, pp. 1521–29. Scopus, doi:10.1109/INFCOM.2011.5934942. Full Text

Agarwal, P. K., et al. “Exploiting temporal coherence in forest dynamics simulation.” Proceedings of the Annual Symposium on Computational Geometry, July 2011, pp. 77–86. Scopus, doi:10.1145/1998196.1998210. Full Text

Clark, James S., et al. “Inferential ecosystem models, from network data to prediction..” Ecological Applications : A Publication of the Ecological Society of America, vol. 21, no. 5, July 2011, pp. 1523–36. Epmc, doi:10.1890/09-1212.1. Full Text

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

Pages

Agarwal, P. K., et al. “Reporting intersecting pairs of polytopes in two and three dimensions.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2125, 2001, pp. 122–34. Scopus, doi:10.1007/3-540-44634-6_12. Full Text

Agarwal, P. K., et al. “Computing the penetration depth of two convex polytopes in 3d.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1851, 2000, pp. 328–38. Scopus, doi:10.1007/3-540-44985-X. Full Text

Agarwal, P. K., et al. “Polygon decomposition for efficient construction of Minkowski sums.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1879, 2000, pp. 20–31.

Agarwal, P. K., et al. “Output-sensitive algorithms for uniform partitions of points.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1741, 1999, pp. 403–14. Scopus, doi:10.1007/3-540-46632-0_41. Full Text

Murali, T. M., et al. “Constructing binary space partitions for orthogonal rectangles in practice.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1461 LNCS, 1998, pp. 211–22.

Agarwal, P. K., et al. “Maintaining the extent of a moving point set.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1272, 1997, pp. 31–44.

Wang, H., and P. K. Agarwal. “Approximation algorithms for curvature-constrained shortest paths.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129447, 1996, pp. 409–18.

Agarwal, P. K., et al. “Efficient generation of k-directional assembly sequences.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129447, 1996, pp. 122–31.

Agarwal, P. K., et al. “Quasi-planar graphs have a linear number of edges.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1027, 1996, pp. 1–7.

Agarwal, P. K., and M. Sharir. “Efficient randomized algorithms for some geometric optimization problems.” Proceedings of the Annual Symposium on Computational Geometry, vol. Part F129372, 1995, pp. 326–35. Scopus, doi:10.1145/220279.220314. Full Text

Pages