Pankaj K. Agarwal
- RJR Nabisco Distinguished 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
Computational and combinatorial geometry, computational biology, robotics, spatial databases, geographic molecular information systems, and data structures.
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. “I/O-efficient construction of constrained delaunay triangulations.” Lecture Notes in Computer Science, vol. 3669, Oct. 2005, pp. 355–66.
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. “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