Research Interests for Pankaj K. Agarwal

Research Interests:

Computational and combinatorial geometry, computational biology, robotics, spatial databases, geographic molecular information systems, and data structures.

Keywords:
Adaptation, Biological, Algorithms, Amino Acid Sequence, Approximation algorithms, Base Pair Mismatch, Bayes Theorem, Biodiversity, Chromosome Mapping, Computational Biology, Data Interpretation, Statistical, DNA Transposable Elements, Ecology, Ecosystem, Forecasting, Models, Biological, Models, Chemical, Models, Molecular, Models, Statistical, Models, Theoretical, Navigation, Plant Transpiration, Plants, Protein Conformation, Proteins, Sensitivity and Specificity, Sequence Alignment, Sequence Analysis, DNA, Sequence Analysis, Protein, Software, Species Specificity, Stochastic Processes, Time Factors, Visibility
Recent Publications
  1. Agarwal, PK; Kyle, FOX; Salzman, O, An efficient algorithm for computing high-quality paths amid polygonal obstacles, Acm Transactions on Algorithms, vol. 14 no. 4 (August, 2018) [doi[abs]
  2. Agarwal, PK; Kaplan, H; Sharir, M, Union of hypercubes and 3D minkowski sums with random sizes, Leibniz International Proceedings in Informatics, Lipics, vol. 107 (July, 2018), ISBN 9783959770767 [doi[abs]
  3. Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Range-max queries on uncertain data, Journal of Computer and System Sciences, vol. 94 (June, 2018), pp. 118-134 [doi[abs]
  4. Agarwal, PK; Arge, L; Staals, F, Improved dynamic geodesic nearest neighbor searching in a simple polygon, Leibniz International Proceedings in Informatics, Lipics, vol. 99 (June, 2018), pp. 41-414 [doi[abs]
  5. Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Computing shortest paths in the plane with removable obstacles, Leibniz International Proceedings in Informatics, Lipics, vol. 101 (June, 2018), pp. 51-515, ISBN 9783959770682 [doi[abs]