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

Lebeck, N., et al. “Computing highly occluded paths on a terrain.” Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, Dec. 2013, pp. 14–23. Scopus, doi:10.1145/2525314.2525363. Full Text

Shaharabani, D., et al. “Sparsification of motion-planning roadmaps by edge contraction.” Proceedings  Ieee International Conference on Robotics and Automation, Nov. 2013, pp. 4098–105. Scopus, doi:10.1109/ICRA.2013.6631155. Full Text

Agarwal, P. K., et al. “Mergeable summaries.” Acm Transactions on Database Systems, vol. 38, no. 4, Nov. 2013. Scopus, doi:10.1145/2500128. Full Text

Agarwal, P. K., et al. “The 2-center problem in three dimensions.” Computational Geometry: Theory and Applications, vol. 46, no. 6, Aug. 2013, pp. 734–46. Scopus, doi:10.1016/j.comgeo.2012.11.005. Full Text

Agarwal, P. K., et al. “Nearest neighbor searching under uncertainty II.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, July 2013, pp. 115–26. Scopus, doi:10.1145/2463664.2465219. Full Text

Agarwal, P. K., et al. “Embeddings of surfaces, curves, and moving points in euclidean space.” Siam Journal on Computing, vol. 42, no. 2, July 2013, pp. 442–58. Scopus, doi:10.1137/110830046. Full Text

Agarwal, P. K., et al. “Union of random minkowski sums and network vulnerability analysis.” Proceedings of the Annual Symposium on Computational Geometry, July 2013, pp. 177–86.

Agarwal, P. K., et al. “Computing the discrete Fréchet distance in subquadratic time.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, Apr. 2013, pp. 156–67.

Agarwal, P. K., et al. “Efficient external memory structures for range-aggregate queries.” Computational Geometry: Theory and Applications, vol. 46, no. 3, Apr. 2013, pp. 358–70. Scopus, doi:10.1016/j.comgeo.2012.10.003. Full Text

Agarwal, P. K., et al. “The resilience of WDM networks to probabilistic geographical failures.” Ieee/Acm Transactions on Networking, vol. 21, no. 5, Jan. 2013, pp. 1525–38. Scopus, doi:10.1109/TNET.2012.2232111. Full Text

Pages

Rizvi, S. A. M., and P. Agarwal. “A time efficient algorithm for finding longest common subsequence from two molecular sequences.” Bioengineering, Proceedings of the Northeast Conference, 2007, pp. 302–06. Scopus, doi:10.1109/NEBC.2007.4413398. Full Text

Agarwal, P. K., et al. “Scalable continuous query processing by tracking hotspots.” Vldb 2006  Proceedings of the 32nd International Conference on Very Large Data Bases, 2006, pp. 31–42.

Rizvi, S. A. M., and P. Agarwal. “A new bucket-based algorithm for finding LCS from two given molecular sequences.” Proceedings  Third International Conference Oninformation Technology: New Generations, Itng 2006, vol. 2006, 2006, pp. 560–61. Scopus, doi:10.1109/ITNG.2006.12. Full Text

Agarwal, P. K., et al. “Computing a center-transversal line.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4337 LNCS, 2006, pp. 93–104.

Agarwal, P. K., et al. “Staying in the middle: Exact and approximate medians in R1 and R2 for moving points.” Proceedings of the 17th Canadian Conference on Computational Geometry, Cccg 2005, 2005, pp. 43–46.

Agarwal, P. K., et al. “Range searching in categorical data: Colored range searching on grid.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, 2002, pp. 17–28.

Procopiuc, C. M., et al. “Star-tree: An efficient self-adjusting index for moving objects.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2409, 2002, pp. 178–93.

Agarwal, P. K., et al. “Near-linear time approximation algorithms for curve simplification.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, 2002, pp. 29–41.

Agarwal, P. K., and M. Sharir. “Pseudo-line arrangements: Duality, algorithms, and applications.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. 06-08-January-2002, 2002, pp. 800–09.

Agarwal, P. K., et al. “Computing the writhing number of a polygonal knot.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. 06-08-January-2002, 2002, pp. 791–99.

Pages