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. “The Resilience of WDM Networks to Probabilistic Geographical Failures.” Ieee/Acm Transactions on Networking, 2013.

Agarwal, P. K., et al. “On range searching with semialgebraic sets II.” Proceedings  Annual Ieee Symposium on Foundations of Computer Science, Focs, Dec. 2012, pp. 420–29. Scopus, doi:10.1109/FOCS.2012.32. Full Text

Wu, Y., et al. “On "one of the few" objects.” Proceedings of the Acm Sigkdd International Conference on Knowledge Discovery and Data Mining, Sept. 2012, pp. 1487–95. Scopus, doi:10.1145/2339530.2339762. Full Text

Agarwal, P. K., et al. “Range searching on uncertain data.” Acm Transactions on Algorithms, vol. 8, no. 4, Sept. 2012. Scopus, doi:10.1145/2344422.2344433. Full Text

Yu, A., et al. “Subscriber assignment for wide-area content-based publish/subscribe.” Ieee Transactions on Knowledge and Data Engineering, vol. 24, no. 10, Aug. 2012, pp. 1833–47. Scopus, doi:10.1109/TKDE.2012.65. Full Text

Yu, A., et al. “Processing and notifying range top-k subscriptions.” Proceedings  International Conference on Data Engineering, July 2012, pp. 810–21. Scopus, doi:10.1109/ICDE.2012.67. Full Text

Yu, A., et al. “Processing a large number of continuous preference top-k queries.” Proceedings of the Acm Sigmod International Conference on Management of Data, June 2012, pp. 397–408. Scopus, doi:10.1145/2213836.2213882. Full Text

Agarwal, P. K., et al. “Nearest-neighbor searching under uncertainty.” Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, June 2012, pp. 225–36. Scopus, doi:10.1145/2213556.2213588. Full Text

Sharathkumar, R., and P. K. Agarwal. “A near-linear time ε-approximation algorithm for geometric bipartite matching.” Proceedings of the Annual Acm Symposium on Theory of Computing, June 2012, pp. 385–94. Scopus, doi:10.1145/2213977.2214014. Full Text

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

Pages

Agarwal, P. K., et al. “Translating a planar object to maximize point containment.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, 2002, pp. 42–53.

Agarwal, P. K., et al. “Approximation algorithms for k-line center.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, 2002, pp. 54–63.

Agarwal, P. K., et al. “Kinetic medians and kd-trees.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461, 2002, pp. 5–17.

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., et al. “A framework for index bulk loading and dynamization.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2076 LNCS, 2001, pp. 115–27.

Agarwal, P. K., et al. “Time responsive external data structures for moving points.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2125, 2001, pp. 50–61. Scopus, doi:10.1007/3-540-44634-6_6. Full Text

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

Pages