Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke





.......................

.......................


Publications of Pankaj K. Agarwal    :chronological  alphabetical  combined  bibtex listing:

Books

  1. P.K. Agarwal, Robotics: The Algorithmic Perspective, edited by L. Kavraki and M. Mason (1998), A. K. Peters, Wellesley
  2. M. Sharir and P.K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications (1995), Cambridge University Press, Cambridge-New York-Melbourne
  3. J. Pach and P.K. Agarwal, Combinatorial Geometry (1995), John Wiley and Sons, New York
  4. P. K. Agarwal, Intersection and Decomposition Algorithms for Planar Arrangements, (1991), Cambridge University Press, Cambridge-New York-Melbourne

Papers Published

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. Agarwal, PK; Fox, K; Munagala, K; Nath, A; Pan, J; Taylor, E, Subtrajectory clustering: Models and algorithms, Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems (May, 2018), pp. 75-87, ISBN 9781450347068 [doi]  [abs]
  6. Agarwal, PK; Fox, K; Nath, A, Maintaining reeb graphs of triangulated 2-manifolds, Leibniz International Proceedings in Informatics, Lipics, vol. 93 (January, 2018), ISBN 9783959770552 [doi]  [abs]
  7. Rav, M; Lowe, A; Agarwal, PK, Flood Risk Analysis on Terrains, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems, vol. 2017-November (November, 2017), ISBN 9781450354905 [doi]  [abs]
  8. Agarwal, PK; Har-Peled, S; Suri, S; Yıldız, H; Zhang, W, Convex Hulls Under Uncertainty, Algorithmica, vol. 79 no. 2 (October, 2017), pp. 340-367 [doi]
  9. Agarwal, PK; Rubin, N; Sharir, M, Approximate nearest neighbor search amid higher-dimensional flats, Leibniz International Proceedings in Informatics, Lipics, vol. 87 (September, 2017), ISBN 9783959770491 [doi]  [abs]
  10. Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Efficient algorithms for k-regret minimizing sets, Leibniz International Proceedings in Informatics, Lipics, vol. 75 (August, 2017), ISBN 9783959770361 [doi]  [abs]
  11. Agarwal, PK; Fox, K; Panigrahi, D; Varadarajan, KR; Xiao, A, Faster algorithms for the geometric transportation problem, Leibniz International Proceedings in Informatics, Lipics, vol. 77 (June, 2017), pp. 71-716, ISBN 9783959770385 [doi]  [abs]
  12. Wu, Y; Agarwal, PK; Li, C; Yang, J; Yu, C, Computational Fact Checking through Query Perturbations, Acm Transactions on Database Systems, vol. 42 no. 1 (January, 2017), pp. 1-41 [doi]
  13. Wu, Y; Gao, J; Agarwal, PK; Yang, J, Finding diverse, high-value representatives on a surface of answers, Proceedings of the Vldb Endowment, vol. 10 no. 7 (January, 2017), pp. 793-804  [abs]
  14. Garg, N; Sadiq, M; Agarwal, P, GOASREP: Goal oriented approach for software requirements elicitation and prioritization using analytic hierarchy process, Advances in Intelligent Systems and Computing, vol. 516 (January, 2017), pp. 281-287, ISBN 9789811031557 [doi]  [abs]
  15. Agarwal, PK; Pan, J; Victor, W, An efficient algorithm for placing electric vehicle charging stations, Leibniz International Proceedings in Informatics, Lipics, vol. 64 (December, 2016), pp. 7.1-7.12, ISBN 9783959770262 [doi]  [abs]
  16. Ying, R; Pan, J; Fox, K; Agarwal, PK, A simple efficient approximation algorithm for dynamic time warping, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (October, 2016), ISBN 9781450345897 [doi]  [abs]
  17. Nath, A; Fox, K; Agarwal, PK; Munagala, K, Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (October, 2016), ISBN 9781450345897 [doi]  [abs]
  18. Agarwal, PK; Aronov, B; Har-Peled, S; Phillips, JM; Yi, K; Zhang, W, Nearest-Neighbor Searching Under Uncertainty II, ACM Transactions on Algorithms, vol. 13 no. 1 (October, 2016), pp. 1-25 [doi]
  19. Agarwal, PK; Beutel, A; Mølhave, T, TerraNNI, Acm Transactions on Spatial Algorithms and Systems, vol. 2 no. 2 (June, 2016), pp. 1-31 [doi]
  20. Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Range-max queries on uncertain data, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, vol. 26-June-01-July-2016 (June, 2016), pp. 465-476, ISBN 9781450341912 [doi]  [abs]
  21. Agarwal, PK; Fox, K; Munagala, K; Nath, A, Parallel algorithms for constructing range and nearest-neighbor searching data structures, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, vol. 26-June-01-July-2016 (June, 2016), pp. 429-440, ISBN 9781450341912 [doi]  [abs]
  22. Agarwal, PK; Fox, K; Pan, J; Ying, R, Approximating dynamic time warping and edit distance for a pair of point sequences, Leibniz International Proceedings in Informatics, Lipics, vol. 51 (June, 2016), pp. 6.1-6.16 [doi]  [abs]
  23. Yu, A; Agarwal, PK; Yang, J, Top-$k$ Preferences in High Dimensions, Ieee Transactions on Knowledge and Data Engineering, vol. 28 no. 2 (February, 2016), pp. 311-325, ISSN 1041-4347 [doi]
  24. Agarwal, PK; Fox, K; Salzman, O, An efficient algorithm for computing high-quality paths amid polygonal obstacles, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2 (January, 2016), pp. 1179-1192, ISBN 9781510819672  [abs]
  25. Pan, J; Rao, V; Agarwal, PK; Gelfand, AE, Markov-modulated marked poisson processes for check-in data, 33rd International Conference on Machine Learning, ICML 2016, vol. 5 (January, 2016), pp. 3311-3320, ISBN 9781510829008  [abs]
  26. Agarwal, PK; Gao, J; Guibas, LJ; Kaplan, H; Rubin, N; Sharir, M, Stable Delaunay Graphs, Discrete & Computational Geometry, vol. 54 no. 4 (December, 2015), pp. 905-929, ISSN 0179-5376 [doi]
  27. Agarwal, PK; Kaplan, H; Rubin, N; Sharir, M, Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions, Discrete & Computational Geometry, vol. 54 no. 4 (December, 2015), pp. 871-904, ISSN 0179-5376 [doi]
  28. Zhang, W; Agarwal, PK; Mukherjee, S, Contour trees of uncertain terrains, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems, vol. 03-06-November-2015 (November, 2015), ISBN 9781450339674 [doi]  [abs]
  29. Agarwal, PK; Mølhave, T; Revsbæk, M; Safa, I; Wang, Y; Yang, J, Maintaining Contour Trees of Dynamic Terrains, Leibniz International Proceedings in Informatics, Lipics, vol. 34 (June, 2015), pp. 796-811, ISSN 1868-8969 [doi]  [abs]
  30. Agarwal, PK; Fox, K; Nath, A; Sidiropoulos, A; Wang, Y, Computing the Gromov-Hausdorff distance for metric trees, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9472 (January, 2015), pp. 529-540, ISSN 0302-9743 [doi]  [abs]
  31. Gupta, P; Agarwal, P, Experimental study & analysis of genetic operators for alignment of multiple biological sequences, Conference Proceeding - 2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015 (January, 2015), pp. 643-648, ISBN 9781467369114 [doi]  [abs]
  32. Garg, N; Agarwal, P; Khan, S, Recent advancements in requirement elicitation and prioritization techniques, Conference Proceeding - 2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015 (January, 2015), pp. 237-240, ISBN 9781467369114 [doi]  [abs]
  33. Sekhon, A; Agarwal, P, Face recognition using back propagation neural network technique, Conference Proceeding - 2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015 (January, 2015), pp. 226-230, ISBN 9781467369114 [doi]  [abs]
  34. Agarwal, P, Message from program chair, Conference Proceeding - 2015 International Conference on Advances in Computer Engineering and Applications, ICACEA 2015 (January, 2015), ISBN 9781467369114 [doi]
  35. Agarwal, PK; Sharathkumar, R, Streaming Algorithms for Extent Problems in High Dimensions, Algorithmica, vol. 72 no. 1 (2015), pp. 83-98, ISSN 0178-4617 [doi]  [abs]
  36. Salzman, O; Shaharabani, D; Agarwal, PK; Halperin, D, Sparsification of motion-planning roadmaps by edge contraction, International Journal of Robotics Research, vol. 33 no. 14 (December, 2014), pp. 1711-1725, ISSN 0278-3649 [doi]
  37. Lebeck, N; Mølhave, T; Agarwal, PK, Computing highly occluded paths using a sparse network, Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems, vol. 04-07-November-2014 (November, 2014), pp. 3-12, ISBN 9781450331319 [doi]  [abs]
  38. Agarwal, PK; Har-Peled, S; Kaplan, H; Sharir, M, Union of Random Minkowski Sums and Network Vulnerability Analysis, Discrete & Computational Geometry, vol. 52 no. 3 (October, 2014), pp. 551-582, ISSN 0179-5376 [doi]
  39. Wu, Y; Agarwal, PK; Li, C; Yang, J; Yu, C, Toward computational fact-checking, Proceedings of the Vldb Endowment, vol. 7 no. 7 (March, 2014), pp. 589-600, ISSN 2150-8097 [doi]
  40. Sankararaman, S; Efrat, A; Ramasubramanian, S; Agarwal, PK, On channel-discontinuity-constraint routing in wireless networks, Ad Hoc Networks, vol. 13 no. PART A (February, 2014), pp. 153-169, ISSN 1570-8705 [doi]  [abs]
  41. Agarwal, PK; Pan, J, Near-linear algorithms for geometric hitting sets and set covers, Proceedings of the Annual Symposium on Computational Geometry (January, 2014), pp. 271-279 [doi]  [abs]
  42. Agarwal, PK; Sharathkumar, R, Approximation algorithms for bipartite matching with metric and geometric costs, Proceedings of the Annual Acm Symposium on Theory of Computing (January, 2014), pp. 555-564, ISSN 0737-8017 [doi]  [abs]
  43. Wu, Y; Walenz, B; Li, P; Shim, A; Sonmez, E; Agarwal, PK; Li, C; Yang, J; Yu, C, ICheck: Computationally combating "lies, D - Ned Lies, and statistics", Proceedings of the Acm Sigmod International Conference on Management of Data (January, 2014), pp. 1063-1066, ISSN 0730-8078 [doi]  [abs]
  44. Agarwal, PK; Har-Peled, S; Suri, S; YIldIz, H; Zhang, W, Convex hulls under uncertainty, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8737 LNCS (January, 2014), pp. 37-48, ISSN 0302-9743, ISBN 9783662447765 [doi]  [abs]
  45. Yu, A; Agarwal, PK; Yang, J, Top-k preferences in high dimensions, Proceedings International Conference on Data Engineering (January, 2014), pp. 748-759, ISSN 1084-4627 [doi]  [abs]
  46. Agarwal, PK; Avraham, RB; Kaplan, H; Sharir, M, Computing the Discrete Fréchet Distance in Subquadratic Time, Siam Journal on Computing, vol. 43 no. 2 (January, 2014), pp. 429-449 [1204.5333v1], [doi]  [abs]
  47. Agarwal, PK; Aronov, B; Van Kreveld, M; Löffler, M; Silveira, RI, Computing correlation between piecewise-linear functions, Siam Journal on Computing, vol. 42 no. 5 (December, 2013), pp. 1867-1887, ISSN 0097-5397 [doi]  [abs]
  48. Agarwal, PK; Matoušek, J; Sharir, M, On range searching with semialgebraic sets. II, Siam Journal on Computing, vol. 42 no. 6 (December, 2013), pp. 2039-2062, ISSN 0097-5397 [doi]  [abs]
  49. Lebeck, N; Mølhave, T; Agarwal, PK, Computing highly occluded paths on a terrain, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (December, 2013), pp. 14-23 [doi]  [abs]
  50. Sankararaman, S; Agarwal, PK; Mølhave, T; Pan, J; Boedihardjo, AP, Model-driven matching and segmentation of trajectories, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (December, 2013), pp. 234-243 [doi]  [abs]
  51. Agarwal, PK; Cormode, G; Huang, Z; Phillips, JM; Wei, Z; Yi, K, Mergeable summaries, Acm Transactions on Database Systems, vol. 38 no. 4 (November, 2013), ISSN 0362-5915 [doi]  [abs]
  52. Agarwal, PK; Efrat, A; Ganjugunte, SK; Hay, D; Sankararaman, S; Zussman, G, The resilience of WDM networks to probabilistic geographical failures, Ieee/Acm Transactions on Networking, vol. 21 no. 5 (January, 2013), pp. 1525-1538, ISSN 1063-6692 [doi]  [abs]
  53. Agarwal, PK; Sharathkumar, R; Agarwal, PK; Sharathkumar, R, Streaming Algorithms for Extent Problems in High DimensionsStreaming Algorithms for Extent Problems in High Dimensions, Algorithmica (2013), pp. 1-16, ISSN 0178-4617 [doi]  [abs]
  54. Agarwal, PK; Aronov, B; Har-Peled, S; Phillips, JM; Yi, K; Zhang, W, Nearest neighbor searching under uncertainty II, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2013), pp. 115-126 [doi]  [abs]
  55. Agarwal, PK; Kaplan, H; Sharir, M, Union of random minkowski sums and network vulnerability analysis, Proceedings of the Annual Symposium on Computational Geometry (2013), pp. 177-186  [abs]
  56. Agarwal, PK; Har-Peled, S; Yu, H, EMBEDDINGS OF SURFACES, CURVES, AND MOVING POINTS IN EUCLIDEAN SPACE, Siam Journal on Computing, vol. 42 no. 2 (2013), pp. 442-458, ISSN 0097-5397 [Gateway.cgi], [doi]
  57. Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) Uncertain Skylines, Theory of Computing Systems, vol. 52 no. 3 (2013), pp. 342-366, ISSN 1432-4350 [doi]  [abs]
  58. Agarwal, PK; Efrat, A; Ganjugunte, SK; Hay, D; Sankararaman, S; Zussman, G, The Resilience of WDM Networks to Probabilistic Geographical Failures, Ieee/Acm Transactions on Networking (2013), ISSN 1063-6692 [doi]  [abs]
  59. Agarwal, PK; Arge, L; Govindarajan, S; Yang, J; Yi, K, Efficient external memory structures for range-aggregate queries, Computational Geometry, vol. 46 no. 3 (2013), pp. 358-370, ISSN 0925-7721 [doi]  [abs]
  60. Agarwal, P; Gupta, R; Maheswari, T; Agarwal, P; Yadav, S; Bali, V, A genetic algorithm for alignment of multiple DNA sequences, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol. 108 LNICST (December, 2012), pp. 437-443, ISBN 9783642356148 [doi]  [abs]
  61. Shaharabani, D; Salzman, O; Agarwal, PK; Halperin, D, Sparsification of Motion-Planning Roadmaps by Edge Contraction (September, 2012) [1209.4463v1]  [abs]
  62. Agarwal, PK; Cormode, G; Huang, Z; Phillips, J; Wei, Z; Yi, K, Mergeable summaries, Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems (June, 2012), pp. 23-34 [doi]  [abs]
  63. Agarwal, PK; Matoušek, J; Sharir, M, On range searching with semialgebraic sets II, Annual Symposium on Foundations of Computer Science (Proceedings) (2012), pp. 420-429, ISSN 0272-5428 [doi]  [abs]
  64. Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) Uncertain Skylines, Theory of Computing Systems (2012), pp. 1-25, ISSN 1432-4350 [doi]  [abs]
  65. Sharathkumar, R; Agarwal, PK, Algorithms for the transportation problem in geometric settings, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2012), pp. 306-317  [abs]
  66. Agarwal, PK; Arge, L; Kaplan, H; Molad, E; Tarjan, RE; Yi, K, An optimal dynamic data structure for stabbing-semigroup queries, Siam Journal on Computing, vol. 41 no. 1 (2012), pp. 104-127, ISSN 0097-5397 [doi]  [abs]
  67. Agarwal, PK; Efrat, A; Sankararaman, S; Zhang, W, Nearest-neighbor searching under uncertainty, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2012), pp. 225-236 [doi]  [abs]
  68. Sharathkumar, R; Agarwal, PK, A near-linear time ε-approximation algorithm for geometric bipartite matching, Proceedings of the Annual Acm Symposium on Theory of Computing (2012), pp. 385-394, ISSN 0737-8017 [doi]  [abs]
  69. Yu, A; Agarwal, PK; Yang, J, Processing a large number of continuous preference top-k queries, Proceedings of the Acm Sigmod International Conference on Management of Data (2012), pp. 397-408, ISSN 0730-8078 [doi]  [abs]
  70. Yu, A; Agarwal, PK; Yang, J, Processing and notifying range top-k subscriptions, Proceedings International Conference on Data Engineering (2012), pp. 810-821, ISSN 1084-4627 [doi]  [abs]
  71. Yu, A; Agarwal, PK; Yang, J, Subscriber assignment for wide-area content-based publish/subscribe, Ieee Transactions on Knowledge and Data Engineering, vol. 24 no. 10 (2012), pp. 1833-1847, ISSN 1041-4347 [doi]  [abs]
  72. Agarwal, PK; Avraham, RB; Sharir, M, The 2-center problem in three dimensions, Computational Geometry (2012), ISSN 0925-7721 [doi]  [abs]
  73. Agarwal, PK; Ezra, E; Sharir, M, Near-linear approximation algorithms for geometric hitting sets, Algorithmica, vol. 63 no. 1-2 (2012), pp. 1-25, ISSN 0178-4617 [doi]  [abs]
  74. Agarwal, PK; Cheng, S-W; Yi, K, Range searching on uncertain data, ACM Transactions on Algorithms, vol. 8 no. 4 (2012), ISSN 1549-6325 [doi]  [abs]
  75. Wu, Y; Agarwal, PK; Li, C; Yang, J; Yu, C, On "one of the few" objects, Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2012), pp. 1487-1495 [doi]  [abs]
  76. Clark, JS; Agarwal, P; Bell, DM; Flikkema, PG; Gelfand, A; Nguyen, X; Ward, E; Yang, J, 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-1536, ISSN 1051-0761 [21830699]  [abs]
  77. Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) uncertain skylines, ACM International Conference Proceeding Series (2011), pp. 186-196 [doi]  [abs]
  78. Agarwal, PK; Mølhave, T; Sadri, B, I/O-efficieiit contour queries on terrains, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2011), pp. 268-284  [abs]
  79. Yu, A; Agarwal, PK; Yang, J, Subscriber assignment for wide-area content-based publish/subscribe, Proceedings International Conference on Data Engineering (2011), pp. 267-278, ISSN 1084-4627 [doi]  [abs]
  80. Agarwal, PK; Mølhave, T; Yu, H; Clark, JS, Exploiting temporal coherence in forest dynamics simulation, Proceedings of the Annual Symposium on Computational Geometry (2011), pp. 77-86 [doi]  [abs]
  81. Agarwal, PK; Efrat, A; Gniady, C; Mitchell, JSB; Polishchuk, V; Sabhnani, GR, 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 (2011) [doi]  [abs]
  82. Agarwal, PK; Efrat, A; Ganjugunte, S; Hay, D; Sankararaman, S; Zussman, G, The resilience of WDM networks to probabilistic geographical failures, Proceedings Ieee Infocom (2011), pp. 1521-1529, ISSN 0743-166X [doi]  [abs]
  83. Beutel, A; Mølhave, T; Agarwal, PK; Boedihardjo, AP; Shine, JA, TerraNNI: Natural neighbor interpolation on a 3D grid using a GPU, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (2011), pp. 64-73 [doi]  [abs]
  84. Abam, MA; Agarwal, PK; Berg, MD; Yu, H, Out-of-order event processing in kinetic data structures, Algorithmica, vol. 60 no. 2 (2011), pp. 250-273, ISSN 0178-4617 [doi]  [abs]
  85. Agarwal, PK; Sharathkumar, R, Streaming algorithms for extent problems in high dimensions, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2010), pp. 1481-1489  [abs]
  86. Agarwal, PK; Efrat, A; Sharathkumar, R; Yu, H, On approximate geodesic-distance queries amid deforming point clouds, Springer Tracts in Advanced Robotics, vol. 57 (2010), pp. 351-365, ISSN 1610-7438 [doi]  [abs]
  87. Sankararaman, S; Efrat, A; Ramasubramanian, S; Agarwal, PK, On channel-discontinuity-constraint routing in wireless networks, Proceedings Ieee Infocom (2010), ISSN 0743-166X [doi]  [abs]
  88. Agarwal, PK; Phillips, JM; Sadri, B, Lipschitz unimodal and isotonic regression on paths and trees, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6034 LNCS (2010), pp. 384-396, ISSN 0302-9743 [doi]  [abs]
  89. Agarwal, PK; Aronov, B; Kreveld, MV; Löffler, M; Silveira, RI, Computing similarity between piecewise-linear functions, Proceedings of the Annual Symposium on Computational Geometry (2010), pp. 375-383 [doi]  [abs]
  90. Agarwal, PK, An improved algorithm for computing the volume of the union of cubes, Proceedings of the Annual Symposium on Computational Geometry (2010), pp. 230-239 [doi]  [abs]
  91. Agarwal, PK; Gao, J; Guibas, LJ; Kaplan, H; Koltun, V; Rubin, N; Sharir, M, Kinetic stable Delaunay graphs, Proceedings of the Annual Symposium on Computational Geometry (2010), pp. 127-136 [doi]  [abs]
  92. Agarwal, PK; Ben-Avraham, R; Sharir, M, The 2-center problem in three dimensions, Proceedings of the Annual Symposium on Computational Geometry (2010), pp. 87-96 [doi]  [abs]
  93. Agarwal, PK; Phillips, JM; Yu, H, Stability of ε-kernels, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6346 LNCS no. PART 1 (2010), pp. 487-499, ISSN 0302-9743 [doi]  [abs]
  94. Mølhave, T; Agarwal, PK; Arge, L; Revsbæk, M, Scalable algorithms for large high-resolution terrain data, ACM International Conference Proceeding Series (2010) [doi]  [abs]
  95. Beutel, A; Mølhave, T; Agarwal, PK, Natural neighbor interpolation based grid DEM construction using a GPU, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (2010), pp. 172-181 [doi]  [abs]
  96. Agarwal, PK; Efrat, A; Ganjugunte, SK; Hay, D; Sankararaman, S; Zussman, G, Network vulnerability to single, multiple, and probabilistic physical attacks, Proceedings - IEEE Military Communications Conference MILCOM (2010), pp. 1824-1829 [doi]  [abs]
  97. Agarwal, PK; Har-Peled, S; Sharir, M; Wang, Y, Hausdorff distance under translation for points and balls, ACM Transactions on Algorithms, vol. 6 no. 4 (2010), ISSN 1549-6325 [doi]  [abs]
  98. Agarwal, PK; Arge, L; Yi, K, I/O-efficient batched union-find and its applications to terrain analysis, ACM Transactions on Algorithms, vol. 7 no. 1 (2010), ISSN 1549-6325 [doi]  [abs]
  99. Agarwal, PK; Bereg, S; Daescu, O; Kaplan, H; Ntafos, S; Sharir, M; Zhu, B, Guarding a terrain by two watchtowers, Algorithmica, vol. 58 no. 2 (2010), pp. 352-390, ISSN 0178-4617 [doi]  [abs]
  100. Agarwal, PK; Sharathkumar, R; Yu, H, Approximate Euclidean shortest paths amid convex obstacles, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2009), pp. 283-292  [abs]
  101. Agarwal, PK; Ezra, E; Ganjugunte, SK, Efficient sensor placement for surveillance problems, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5516 LNCS (2009), pp. 301-314, ISSN 0302-9743 [doi]  [abs]
  102. Agarwal, PK; Xie, J; Yang, J; Yu, H, Input-sensitive scalable continuous join query processing, Acm Transactions on Database Systems, vol. 34 no. 3 (2009), ISSN 0362-5915 [doi]  [abs]
  103. Agarwal, PK; Cheng, S-W; Tao, Y; Yi, K, Indexing uncertain data, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2009), pp. 137-146 [doi]  [abs]
  104. Agarwal, PK; Ezra, E; Sharir, M, Near-linear approximation algorithms for geometric hitting sets, Proceedings of the Annual Symposium on Computational Geometry (2009), pp. 23-32 [doi]  [abs]
  105. Agarwal, P; Rizvi, SAM, A technique based on neural network for predicting the secondary structure of proteins, Proceedings - International Conference on Computational Intelligence and Multimedia Applications, ICCIMA 2007, vol. 2 (March, 2008), pp. 382-386, ISBN 0769530508 [doi]  [abs]
  106. Agarwal, PK; Klein, R; Knauer, C; Langerman, S; Morin, P; Sharir, M; Soss, M, Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D, Discrete & Computational Geometry, vol. 39 no. 1-3 (March, 2008), pp. 17-37, ISSN 0179-5376 [doi]  [abs]
  107. Agarwal, PK; Hurtado, F; Toussaint, GT; Trias, J, On polyhedra induced by point sets in space, Discrete Applied Mathematics, vol. 156 no. 1 (2008), pp. 42-54, ISSN 0166-218X [doi]  [abs]
  108. Chandramouli, B; Yang, J; Agarwal, PK; Yu, A; Zheng, Y, ProSem: Scalable wide-area publish/subscribe, Proceedings of the Acm Sigmod International Conference on Management of Data (2008), pp. 1315-1317, ISSN 0730-8078 [doi]  [abs]
  109. Agarwal, PK; Sadri, B; Yu, H, Untangling triangulations through local explorations, Proceedings of the Annual Symposium on Computational Geometry (2008), pp. 288-297 [doi]  [abs]
  110. Agarwal, PK; Arge, L; Moølhave, T; Sadri, B, I/O-efflcient algorithms for computing contours on a terrain, Proceedings of the Annual Symposium on Computational Geometry (2008), pp. 129-138 [doi]  [abs]
  111. Agarwal, PK; Phillips, JM, An efficient algorithm for 2D Euclidean 2-center with outliers, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS (2008), pp. 64-75, ISSN 0302-9743 [doi]  [abs]
  112. Agarwal, PK; Chen, DZ; Ganjugunte, SK; Misiołek, E; Sharir, M; Tang, K, Stabbing convex polygons with a segment or a polygon, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS (2008), pp. 52-63, ISSN 0302-9743 [doi]  [abs]
  113. Agarwal, PK; Har-Peled, S; Yu, H, Robust shape fitting via peeling and grating coresets, Discrete & Computational Geometry, vol. 39 no. 1-3 (2008), pp. 38-58, ISSN 0179-5376 [doi]  [abs]
  114. Yu, H; Agarwal, PK; Poreddy, R; Varadarajan, KR, Practical methods for shape fitting and kinetic data structures using coresets, Algorithmica, vol. 52 no. 3 (2008), pp. 378-402, ISSN 0178-4617 [doi]  [abs]
  115. Agarwal, PK; Kaplan, H; Sharir, M, Kinetic and dynamic data structures for closest pair and all nearest neighbors, ACM Transactions on Algorithms, vol. 5 no. 1 (2008), ISSN 1549-6325 [doi]  [abs]
  116. Agarwal, PK; Sharir, M; Welzl, E, Algorithms for center and Tverberg points, ACM Transactions on Algorithms, vol. 5 no. 1 (2008), ISSN 1549-6325 [doi]  [abs]
  117. Rizvi, SAM; Agarwal, P, A time efficient algorithm for finding longest common subsequence from two molecular sequences, Proceedings of the IEEE ... annual Northeast Bioengineering Conference. IEEE Northeast Bioengineering Conference (December, 2007), pp. 302-306, ISBN 1424410339 [doi]  [abs]
  118. Clark, JS; Dietze, M; Chakraborty, S; Agarwal, PK; Ibanez, I; LaDeau, S; Wolosin, M, Resolving the biodiversity paradox., Ecology Letters, vol. 10 no. 8 (August, 2007), pp. 647-659 [17594418], [doi]  [abs]
  119. Agarwal, PK; Mustafa, NH; Wang, Y, Fast molecular shape matching using contact maps., Journal of Computational Biology : a Journal of Computational Molecular Cell Biology, vol. 14 no. 2 (March, 2007), pp. 131-143, ISSN 1066-5277 [17456012], [doi]  [abs]
  120. Agarwal, PK; Yu, H, A space-optimal data-stream algorithm for coresets in the plane, Proceedings of the Annual Symposium on Computational Geometry (2007), pp. 1-10 [doi]  [abs]
  121. Agarwal, PK; Kaplan, H; Sharir, M, Computing the volume of the union of cubes, Proceedings of the Annual Symposium on Computational Geometry (2007), pp. 294-301 [doi]  [abs]
  122. Agarwal, PK; Har-Peled, S; Yu, H, Embeddings of surfaces, curves, and moving points in euclidean space, Proceedings of the Annual Symposium on Computational Geometry (2007), pp. 381-389 [doi]  [abs]
  123. Agarwal, PK; Apfelbaum, R; Purdy, G; Sharir, M, Similar simplices in a d-dimensional point set, Proceedings of the Annual Symposium on Computational Geometry (2007), pp. 232-238 [doi]  [abs]
  124. Danner, A; Mølhave, T; Yi, K; Agarwal, PK; Arge, L; Mitasova, H, TerraStream: From elevation data to watershed hierarchies, GIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems (2007), pp. 212-219 [doi]  [abs]
  125. Agarwal, PK, Modeling and analyzing massive terrain data sets, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4835 LNCS (2007), pp. 1-, ISSN 0302-9743  [abs]
  126. Flikkema, PG; Agarwal, PK; Clark, JS; Ellis, C; Gelfand, A; Munagala, K; Yang, J, From data reverence to data relevance: Model-mediated wireless sensing of the physical environment, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4487 LNCS (2007), pp. 988-994, ISSN 0302-9743  [abs]
  127. Clark, JS; Agarwal, PK, Rejoinder to Clark et al. (2007): Response to Chesson and Rees, Ecology Letters, vol. 10 no. 8 (2007), pp. 661-662, ISSN 1461-023X [doi]
  128. Govindarajan, S; Dietze, MC; Agarwal, PK; Clark, JS, A scalable algorithm for dispersing population, Journal of Intelligent Information Systems, vol. 29 no. 1 (2007), pp. 39-61, ISSN 0925-9902 [doi]  [abs]
  129. Zheng, Y; Brady, DJ; Agarwal, PK, Localization using boundary sensors: An analysis based on graph theory, ACM Transactions on Sensor Networks, vol. 3 no. 4 (2007), ISSN 1550-4859 [doi]  [abs]
  130. Agarwal, PK; Arge, L; Danner, A, From point cloud to grid DEM: A scalable approach, Progress in Spatial Data Handling - 12th International Symposium on Spatial Data Handling, SDH 2006 (December, 2006), pp. 771-788 [doi]  [abs]
  131. Agarwal, PK; Xie, J; Yang, J; Yu, H, Scalable continuous query processing by tracking hotspots, edited by Dayal, U; Whang, K-Y; Lomet, DB; Alonso, G; Lohman, GM; Kersten, ML; Cha, SK; Kim, Y-K, VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases (December, 2006), pp. 31-42, ACM, ISBN 1595933859 [citation.cfm]  [abs]
  132. Rizvi, SAM; Agarwal, P, 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 (November, 2006), pp. 560-561, ISBN 0769524974 [doi]  [abs]
  133. Bilu, Y; Agarwal, PK; Kolodny, R, Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons., Ieee/Acm Transactions on Computational Biology and Bioinformatics, vol. 3 no. 4 (October, 2006), pp. 408-422, ISSN 1545-5963 [17085849], [doi]  [abs]
  134. Agarwal, PK; Har-Peled, S; Yu, H, Robust shape fitting via peeling and grating coresets, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2006), pp. 182-191 [doi]  [abs]
  135. Flikkema, PG; Agarwal, PK; Clark, JS; Ellis, C; Gelfand, A; Munagala, K; Yang, J, Model-driven dynamic control of embedded wireless sensor networks, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3993 LNCS - III (2006), pp. 409-416, ISSN 0302-9743 [doi]  [abs]
  136. Agarwal, PK; Arge, L; Yi, K, I/O-efficient batched union-find and its applications to terrain analysis, Proceedings of the Annual Symposium on Computational Geometry, vol. 2006 (2006), pp. 167-176  [abs]
  137. Phillips, JM; Rudolph, J; Agarwal, PK, Segmenting motifs in protein-protein interface surfaces, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4175 LNBI (2006), pp. 207-218, ISSN 0302-9743  [abs]
  138. Agarwal, PK; Aronov, B; Koltun, V, Efficient algorithms for bichromatic separability, ACM Transactions on Algorithms, vol. 2 no. 2 (2006), pp. 209-227, ISSN 1549-6325 [doi]  [abs]
  139. Agarwal, PK; Overmars, M; Sharir, M, Computing maximally separated sets in the plane, Siam Journal on Computing, vol. 36 no. 3 (2006), pp. 815-834, ISSN 0097-5397 [doi]  [abs]
  140. Abam, MA; Agarwal, PK; Berg, MD; Yu, H, Out-of-order event processing in kinetic data structures, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4168 LNCS (2006), pp. 624-635, ISSN 0302-9743  [abs]
  141. Agarwal, PK; Mustafa, NH, Independent set of intersection graphs of convex objects in 2D, Computational Geometry, vol. 34 no. 2 (2006), pp. 83-95, ISSN 0925-7721 [doi]  [abs]
  142. Agarwal, PK; Brady, D; Matoušek, J, Segmenting object space by geometric reference structures, ACM Transactions on Sensor Networks, vol. 2 no. 4 (2006), pp. 455-465, ISSN 1550-4859 [doi]  [abs]
  143. Agarwal, PK; Wang, Y; Yu, H, A two-dimensional kinetic triangulation with near-quadratic topological changes, Discrete & Computational Geometry, vol. 36 no. 4 (2006), pp. 573-592, ISSN 0179-5376 [doi]  [abs]
  144. Agarwal, PK; Edelsbrunner, H; Harer, J; Wang, Y, Extreme elevation on a 2-manifold, Discrete & Computational Geometry, vol. 36 no. 4 (2006), pp. 553-572, ISSN 0179-5376 [doi]  [abs]
  145. Agarwal, PK; Cabello, S; Sellarès, JA; Sharir, M, Computing a Center-Transversal Line., edited by Arun-Kumar, S; Garg, N, FSTTCS, vol. 4337 (2006), pp. 93-104, SPRINGER, ISBN 3-540-49994-6 [doi]
  146. Wang, Y; Agarwal, PK; Brown, P; Edelsbrunner, H; Rudolph, J, Coarse and reliable geometric alignment for protein docking. (2005), pp. 64-75, ISSN 2335-6936 [15759614]  [abs]
  147. Agarwal, PK; Wang, Y; Yin, P, Lower bound for sparse Euclidean spanners, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2005), pp. 670-671  [abs]
  148. Agarwal, PK; Arge, L; Yi, K, An optimal dynamic interval stabbing-max data structure?, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2005), pp. 803-812  [abs]
  149. Agarwal, PK; Sharir, M, Pseudo-line arrangements: Duality, algorithms, and applications, Siam Journal on Computing, vol. 34 no. 3 (2005), pp. 526-552, ISSN 0097-5397 [doi]  [abs]
  150. Agarwal, PK; Bereg, S; Daescu, O; Kaplan, H; Ntafos, S; Zhu, B, Guarding a terrain by two watchtowers, Proceedings of the Annual Symposium on Computational Geometry (2005), pp. 346-355 [doi]  [abs]
  151. Agarwal, PK; Arge, L; Yi, K, I/O-efficient construction of constrained delaunay triangulations, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3669 (2005), pp. 355-366, ISSN 0302-9743  [abs]
  152. Agarwal, PK; Xie, J; Yang, J; Yu, H, 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 (2005), pp. 349-359, ISSN 0302-9743 [doi]  [abs]
  153. Agarwal, PK; Bilu, Y; Kolodny, R, Faster algorithms for optimal Multiple Sequence Alignment based on pairwise comparisons, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3692 LNBI (2005), pp. 315-327, ISSN 0302-9743 [doi]  [abs]
  154. Agarwal, PK; Akutsu, T; Amihood, A; Apostolico, A; Benham, C; Benson, G; Blanchette, M; El-Mabrouk, N; Gascuel, O; Giancarlo, R; Guigo, R; Hallet, M; Huson, D; Kucherov, G; Lacey, M; Lagergren, J; Lancia, G; Landau, GM; Lecroq, T; Moret, B; Morishita, S; Mossel, E; Moulton, V; Pachter, L; Reinert, K; Rigoutsos, I; Sagot, M-F; Sankoff, D; Schbath, S; Segal, E; Semple, C; Setubal, JC; Sharan, R; Skiena, S; Stoye, J; Ukkonen, E; Vawter, L; Valencia, A; Warnow, T; Wang, L; Casadio, R; Myers, G, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3692 LNBI (2005), pp. V-VI, ISSN 0302-9743, ISBN 3540290087
  155. Agarwal, PK; Berretty, R-P; Collins, AD, A near-quadratic algorithm for fence design, Discrete and Computanional Geometry, vol. 33 no. 3 (2005), pp. 463-481 [doi]  [abs]
  156. Agarwal, PK; Har-Peled, S; Mustafa, NH; Wang, Y, Near-linear time approximation algorithms for curve simplification, Algorithmica (New York), vol. 42 no. 3-4 (2005), pp. 203-219 [doi]  [abs]
  157. Agarwal, PK; Aronov, B; Koltun, V; Sharir, M, Lines avoiding unit balls in three dimensions, Discrete and Computanional Geometry, vol. 34 no. 2 (2005), pp. 231-250 [doi]  [abs]
  158. Agarwal, PK; Procopiuc, CM; Varadarajan, KR, Approximation algorithms for a k-line center, Algorithmica (New York), vol. 42 no. 3-4 (2005), pp. 221-230 [doi]  [abs]
  159. P.K. Agarwal,, Reporting all intersecting pairs of polytopes in two and three dimensions (2004)  [abs]
  160. Agarwal, PK; Aronov, B; Koltun, V, Efficient Algorithms for Bichromatic Separability, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 15 (2004), pp. 675-683  [abs]
  161. Agarwal, PK; Overmars, M; Sharir, M, Computing Maximally Separated Sets in the Plane and Independent Sets in the Intersection Graph of Unit Disks, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 15 (2004), pp. 509-518  [abs]
  162. Yu, H; Agarwal, PK; Poreddy, R; Varadarajan, KR, Practical methods for shape fitting and kinetic data structures using core sets, Proceedings of the Annual Symposium on Computational Geometry (2004), pp. 263-272  [abs]
  163. Agarwal, PK; Edelsbrunner, H; Harer, J; Wang, Y, Extreme elevation on a 2-manifold, Proceedings of the Annual Symposium on Computational Geometry (2004), pp. 357-365  [abs]
  164. Govindarajan, S; Dietze, M; Agarwal, PK; Clark, JS, A scalable simulator for forest dynamics, Proceedings of the Annual Symposium on Computational Geometry (2004), pp. 106-115  [abs]
  165. Agarwal, PK; Aronov, B; Koltun, V; Sharir, M, On lines avoiding unit balls in three dimensions, Proceedings of the Annual Symposium on Computational Geometry (2004), pp. 36-45  [abs]
  166. Agarwal, PK; Varadarajan, KR, A near-linear constant-factor approximation for euclidean bipartite matching?, Proceedings of the Annual Symposium on Computational Geometry (2004), pp. 247-252  [abs]
  167. Agarwal, PK; Sharir, M; Welzl, E, Algorithms for center and tverberg points, Proceedings of the Annual Symposium on Computational Geometry (2004), pp. 61-67  [abs]
  168. Choi, V; Agarwal, PK; Edelsbrunner, H; Rudolph, J, Local search heuristic for rigid protein docking, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3240 (2004), pp. 218-229, ISSN 0302-9743  [abs]
  169. Agarwal, PK; Nevo, E; Pach, J; Pinchasi, R; Sharir, M; Smorodinsky, S, Lenses in arrangements of pseudo-circles and their applications, Journal of the Acm, vol. 51 no. 2 (2004), pp. 139-186, ISSN 0004-5411 [doi]  [abs]
  170. Agarwal, PK; Edelsbrunner, H; Wang, Y, Computing the writhing number of a polygonal knot, Discrete and Computanional Geometry, vol. 32 no. 1 (2004), pp. 37-53 [doi]  [abs]
  171. Agarwal, P; Guibas, L; Nguyen, A; Russel, D; Zhang, L, Collision detection for deforming necklaces, Computational Geometry, vol. 28 no. 2-3 SPEC. ISS. (2004), pp. 137-163, ISSN 0925-7721 [doi]  [abs]
  172. Agarwal, PK; Har-Peled, S; Varadarajan, KR, Approximating extent measures of points, Journal of the Acm, vol. 51 no. 4 (2004), pp. 606-635, ISSN 0004-5411 [doi]  [abs]
  173. Agarwal, PK; Mustafa, NH, K-means projective clustering, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, vol. 23 (2004), pp. 155-165  [abs]
  174. Agarwal, PK; Wang, Y; Yu, H, A 2D kinetic triangulation with near-quadratic topological changes, Proceedings of the Annual Symposium on Computational Geometry (2004), pp. 180-189  [abs]
  175. Agarwal, PK; Mustafa, NH, Independent set of intersection graphs of convex objects in 2D, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3111 (2004), pp. 127-137, ISSN 0302-9743  [abs]
  176. Agarwal, PK; Berretty, R-P; Collins, AD, A near-quadratic algorithm for fence design, Springer Tracts in Advanced Robotics, vol. 7 STAR (2004), pp. 347-362, ISSN 1610-7438 [doi]  [abs]
  177. Agarwal, PK; Arge, L; Erickson, J; Yu, H, Efficient tradeoff schemes in data structures for querying moving objects, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3221 (2004), pp. 4-15, ISSN 0302-9743  [abs]
  178. Agarwal, PK; Arge, L; Yang, J; Yi, K, I/O-efficient structures for orthogonal range-max and stabbing-max queries, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2832 (2003), pp. 7-18, ISSN 0302-9743  [abs]
  179. Collins, AD; Agarwal, PK; Harer, JL, HPRM: A hierarchical PRM, Proceedings - IEEE International Conference on Robotics and Automation, vol. 3 (2003), pp. 4433-4438  [abs]
  180. Agarwal, PK; Procopiuc, CM; Varadarajan, KR, A (1+ε)-approximation algorithm for 2-line-center, Computational Geometry, vol. 26 no. 2 (2003), pp. 119-128, ISSN 0925-7721 [doi]  [abs]
  181. Agarwal, PK; Arge, L, Editorial, Computational Geometry, vol. 24 no. 2 (2003), pp. 49-, ISSN 0925-7721 [doi]
  182. Agarwal, PK; Har-Peled, S; Sharir, M; Wang, Y, Hausdorff distance under translation for points and balls, Proceedings of the Annual Symposium on Computational Geometry (2003), pp. 282-291  [abs]
  183. Agarwal, PK; Arge, L; Danner, A; Holland-Minkley, B, Cache-oblivious data structures for orthogonal range searching, Proceedings of the Annual Symposium on Computational Geometry (2003), pp. 237-245  [abs]
  184. Agarwal, PK; Krishnan, S; Mustafa, NH; Venkatasubramanian, S, Streaming geometric optimization using graphics hardware, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2832 (2003), pp. 544-555, ISSN 0302-9743  [abs]
  185. Govindarajan, S; Agarwal, PK; Arge, L, CRB-tree: An efficient indexing scheme for range-aggregate queries, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2572 (2003), pp. 143-157, ISSN 0302-9743  [abs]
  186. Agarwal, PK; Flato, E; Halperin, D, Polygon decomposition for efficient construction of Minkowski sums, Computational Geometry, vol. 21 no. 1-2 (January, 2002), pp. 39-61, ISSN 0925-7721 [doi]  [abs]
  187. Agarwal, P; Nevo, E; Pach, J; Pinchasi, R; Pinchasi, R; Smorodinsky, S, Lenses in arrangements of pseudo-circles and their applications, Proceedings of the Annual Symposium on Computational Geometry (January, 2002), pp. 123-132  [abs]
  188. P.K. Agarwal, C. M. Procopiuc, and S. Har-Peled, STAR-tree: An efficent self-adjusting index for moving points, in Fourth Workshop on Algorithms Engineering and Experiments (2002)
  189. P.K. Agarwal, C. M. Procopiuc, M. Jones, and T.M. Murali, Classifcation using projective clustering, ACM SIGMOD International Conference on Management of Data (2002)
  190. Agarwal, PK; Hagerup, T; Ray, R; Sharir, M; Smid, MHM; Welzl, E, Translating a Planar Object to Maximize Point Containment., in T. Hagerup, R. Ray, M. Sharir, and M. Smid, edited by Möhring, RH; Raman, R, ESA, vol. 2461 (2002), pp. 42-53, SPRINGER, ISBN 3-540-44180-8 (submitted for publication.) [html], [doi]
  191. Procopiuc, CM; Jones, M; Agarwal, PK; Murali, TM, A Monte Carlo algorithm for fast projective clustering, Proceedings of the Acm Sigmod International Conference on Management of Data (2002), pp. 418-427, ISSN 0730-8078  [abs]
  192. Agarwal, PK; Bhattacharya, BK; Sen, S, Improved algorithms for uniform partitions of points, Algorithmica (New York), vol. 32 no. 4 (2002), pp. 521-539  [abs]
  193. Agarwal, PK; Berg, MD; Har-Peled, S; Overmars, MH; Sharir, M; Vahrenhold, J, Reporting intersecting pairs of convex polytopes in two and three dimensions, Computational Geometry, vol. 23 no. 2 (2002), pp. 195-207, ISSN 0925-7721  [abs]
  194. Agarwal, PK; Sharir, M, The number of congruent simplices in a point set, Discrete & Computational Geometry, vol. 28 no. 2 (2002), pp. 123-150, ISSN 0179-5376 [doi]  [abs]
  195. Agarwal, PK; Basch, J; Guibas, LJ; Hershberger, J; Zhang, L, Deformable free-space tilings for kinetic collision detection, International Journal of Robotics Research, vol. 21 no. 3 (2002), pp. 179-197 [doi]  [abs]
  196. Agarwal, PK; Har-Peled, S; Mustafa, NH; Wang, Y, Near-Linear Time Approximation Algorithms for Curve Simplification., edited by Möhring, RH; Raman, R, ESA, vol. 2461 (2002), pp. 29-41, SPRINGER, ISBN 3-540-44180-8 [html], [doi]
  197. Procopiuc, CM; Agarwal, PK; Har-Peled, S, STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects., edited by Mount, DM; Stein, C, ALENEX, vol. 2409 (2002), pp. 178-193, SPRINGER, ISBN 3-540-43977-3 [html], [doi]
  198. Agarwal, PK; Govindarajan, S; Muthukrishnan, S, Range Searching in Categorical Data: Colored Range Searching on Grid., edited by Möhring, RH; Raman, R, ESA, vol. 2461 (2002), pp. 17-28, SPRINGER, ISBN 3-540-44180-8 [html], [doi]
  199. Agarwal, PK; Gao, J; Guibas, LJ, Kinetic Medians and kd-Trees., edited by Möhring, RH; Raman, R, ESA, vol. 2461 (2002), pp. 5-16, SPRINGER, ISBN 3-540-44180-8 [html], [doi]
  200. Agarwal, PK; Procopiuc, CM; Varadarajan, KR, Approximation Algorithms for k-Line Center., edited by Möhring, RH; Raman, R, ESA, vol. 2461 (2002), pp. 54-63, SPRINGER, ISBN 3-540-44180-8 [html], [doi]
  201. Agarwal, PK; Sharir, M, Pseudo-line arrangements: duality, algorithms, and applications., in Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Eppstein, D, SODA (2002), pp. 800-809, ACM/SIAM, ISBN 0-89871-513-X [citation.cfm]
  202. Agarwal, PK; Edelsbrunner, H; Wang, Y, Computing the writhing number of a polygonal knot., in Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Eppstein, D, SODA (2002), pp. 791-799, ACM/SIAM, ISBN 0-89871-513-X [citation.cfm]
  203. L. Guibas, J. Hershberger, E. Veach, and P.K. Agarwal, Maintaining structures for moving points, Discrete and Computational Geometry, vol. 26 (2001), pp. 253-374
  204. K. R. Varadarajan and P.K. Agarwal, Approximating shortest paths on polyhedral terrains, SIAM Journal on Computing, vol. 30 (2001), pp. 1321-1340
  205. H. Wang and P.K. Agarwal, Approximation algorithms for shortest paths with bounded curvature, SIAM Journal on Computing, vol. 30 (2001), pp. 1739-1772
  206. J. Basch, L. J. Guibas, J. Hershberger, L. Zhang and P.K. Agarwal, Deformable free space tiling for kinetic collision detection, in Algorithmic Foundations of Robotics, edited by B. Donald, K. Lynch, and D. Russ (2001), pp. 83-96, A.K. Peters, Natick, MA,
  207. S. Sen and P.K. Agarwal, Randomized algorithms for geometric optimization, in Handbook of Randomized Computation, edited by J. Pardalos, S. Rajasekaran, J. Reif, and J. Rolim (2001), pp. 151-201, Kluwar Academic Press, The Netherlands
  208. P.K. Agarwal, L. Arge and J. Vahrenhold, Time responsive indexing schemes for moving points, in Seventh Workshop on Algorithms and Data Structures (2001)
  209. P.K. Agarwal, D. Halperin, and R. Pollack, Guest editors' foreword, Discrete and Computational Geometry, vol. 25 (2001), pp. 505-506
  210. P.K. Agarwal, Guest editors' foreword, Discrete and Computational Geometry, vol. 26 (2001), pp. 185-186
  211. P.K. Agarwal, On the numbers of congruent simplices in a point set, in Seventeenth Annual Symposium on Computational Geometry (2001)
  212. P.K. Agarwal, M. de Berg, S. Har-Peled, M. Overmars, M. Sharir, and J. Vahrenhold, Reporting all intersecting pairs of polytopes in two and three dimensions, in Seventh Workshop on Algorithms and Data Structures (2001)
  213. P.K. Agarwal, S. Har-Peled, and Y.Wang, Occlusion culling for fast walkthrough in urban areas, in Eurographics (2001)
  214. P.K. Agarwal, M. Dietze, S. Govindarajan, and J. Clark, The extinction debt revisited: population dynamics in a continuous space model, in Ecological Society of America Annual Meeting (2001)
  215. Agarwal, PK; Sharir, M, On the number of congruent simplices in a point set, Proceedings of the Annual Symposium on Computational Geometry (2001), pp. 1-9  [abs]
  216. Agarwal, PK; Aronov, B; Sharir, M, Exact and approximation algorithms for minimum-width cylindrical shells, Discrete and Computanional Geometry, vol. 26 no. 3 (2001), pp. 307-320  [abs]
  217. Agarwal, PK; Guibas, LJ; Hershberger, J; Veach, E, Maintaining the extent of a moving point set, Discrete and Computanional Geometry, vol. 26 no. 3 (2001), pp. 353-374  [abs]
  218. Agarwal, PK; Arge, L; Procopiuc, O; Vitter, JS, A Framework for Index Bulk Loading and Dynamization., in Twenty-Eighth International Colloquium on Automata, Languages, and Programming, edited by Orejas, F; Spirakis, PG; Leeuwen, JV, ICALP, vol. 2076 (2001), pp. 115-127, SPRINGER, ISBN 3-540-42287-0 [html], [doi]
  219. Agarwal, PK; Hal-Peled, S, Maintaining approximate extent measures of moving points, in Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2001), pp. 148-157  [abs]
  220. Agarwal, PK; Berg, MD; Gudmundsson, J; Hammar, M; Haverkort, HJ, Box-trees and R-trees with near-optimal query time, in Seventeenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (2001), pp. 124-133  [abs]
  221. Agarwal, PK; Collins, AD; Harer, JL, Minimal trap design, in IEEE Conference on Robotics and Automation, Proceedings - IEEE International Conference on Robotics and Automation, vol. 3 (2001), pp. 2243-2248  [abs]
  222. Agarwal, PK; Aronov, B; Sharir, M, On the complexity of many faces in arrangements of circles, in Forty Second Annual Symposium on Foundations of Computer Science, Annual Symposium on Foundations of Computer Science - Proceedings (2001), pp. 74-83  [abs]
  223. Agarwal, PK; Arge, L; Vahrenhold, J, Time Responsive External Data Structures for Moving Points., edited by Dehne, FKHA; Sack, J-R; Tamassia, R, WADS, vol. 2125 (2001), pp. 50-61, SPRINGER, ISBN 3-540-42423-7 [html], [doi]
  224. Agarwal, PK; Berg, MD; Har-Peled, S; Overmars, MH; Sharir, M; Vahrenhold, J, Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions., edited by Dehne, FKHA; Sack, J-R; Tamassia, R, WADS, vol. 2125 (2001), pp. 122-134, SPRINGER, ISBN 3-540-42423-7 [html], [doi]
  225. Agarwal, PK; Guibas, LJ; Har-Peled, S; Rabinovitch, A; Sharir, M, Computing the penetration depth of two convex polytopes in 3d, in Seventh Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1851 (2000), pp. 328-338, ISSN 0302-9743, ISBN 3540676902 [doi]  [abs]
  226. L. J. Guibas, S. Har-Peled, A. Rabinovitch, M. Sharir, and P.K. Agarwal, Computing the penetration depth of two convex polytopes in 3D, Nordic J. Computing, vol. 7 (2000), pp. 227-240
  227. B. Aronov, S. Har-Peled, M. Sharir, and P.K. Agarwal, Exact and approximation algorithms for the minimum width annuli and shells, Discrete and Computational Geometry, vol. 24 (2000), pp. 687-705
  228. M. Sharir and P.K. Agarwal, Davenport-Schinzel sequences and their geometric applications, in Handbook of Computational Geometry, edited by J.-R. Sack and J. Urrutia (2000), pp. 1-47, North-Holland, New York
  229. M. Sharir and P.K. Agarwal, Arrangements and their applications, in Handbook of Computational Geometry, edited by J.-R. Sack and J. Urrutia (2000), pp. 49-119, North-Holland, New York
  230. L. Knipping, M. van Kreveld, T. Strijk, A. Wolff and P.K. Agarwal, A simple and eÆcient algorithm for high quality line labeling, in Innovations in GIS VII: GeoComputation, edited by P. M. Atkinson and D. Martin (2000), pp. 147-159, Taylor and Francis, London
  231. K. R. Varadarajan and P.K. Agarwal, Efficient algorithms for polygon simplification, Discrete and Computational Geometry, vol. 23 (2000), pp. 273-291
  232. P.K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang, Deformable free space tiling for kinetic collision detection, in Fourth Workshop on Algorithmic Foundations of Robotics (2000)
  233. Agarwal, PK; Basch, J; Berg, MD; Guibas, LJ; Hershberger, J, Lower Bounds for Kinetic Planar Subdivisions., Discrete & Computational Geometry, vol. 24 (2000), pp. 721-733 [doi]
  234. Varadarajan, KR; Agarwal, PK, Approximating shortest paths on a nonconvex polyhedron, Siam Journal on Computing, vol. 30 no. 4 (2000), pp. 1321-1340, ISSN 0097-5397  [abs]
  235. Agarwal, PK; Wanq, H, Approximation algorithms for curvature-constrained shortest paths, Siam Journal on Computing, vol. 30 no. 6 (2000), pp. 1739-1772, ISSN 0097-5397  [abs]
  236. Agarwal, PK; Varadarajan, KR, Efficient algorithms for approximating polygonal chains, Discrete and Computanional Geometry, vol. 23 no. 2 (2000), pp. 273-291  [abs]
  237. Agarwal, PK; Guibas, LJ; Murali, TM; Vitter, JS, Cylindrical static and kinetic binary space partitions, Computational Geometry: Theory and Applications, vol. 16 no. 2 (2000), pp. 103-127  [abs]
  238. Agarwal, PK; Grove, EF; Murali, TM; Vitter, JS, Binary space partitions for fat rectangles, SIAM Journal on Computing, vol. 29 no. 5 (2000), pp. 1422-1448 [doi]  [abs]
  239. Agarwal, PK; Sharir, M, Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions, Discrete and Computanional Geometry, vol. 24 no. 4 (2000), pp. 645-685  [abs]
  240. Agarwal, PK; Arge, L; Erickson, J; Franciosa, PG; Vitter, JS, Efficient searching with linear constraints, Journal of Computer and System Sciences, vol. 61 no. 2 (2000), pp. 194-216 [doi]  [abs]
  241. Agarwal, PK; Aronov, B; Har-Peled, S; Sharir, M, Approximation Algorithms for Minimum-Width Annuli and Shells, Discrete and Computanional Geometry, vol. 24 no. 4 (2000), pp. 687-705  [abs]
  242. Agarwal, PK; Flato, E; Halperin, D, Polygon Decomposition for Efficient Construction of Minkowski Sums., in Eighth European Symposium on Algorithms, edited by Paterson, M, ESA, vol. 1879 (2000), pp. 20-31, SPRINGER, ISBN 3-540-41004-X [html], [doi]
  243. Agarwal, PK; Arge, L; Erickson, J, Indexing moving points, in Nineteenth Annual Symposium on Principles of Database Systems, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2000), pp. 175-186  [abs]
  244. Agarwal, PK; Har-Peled, S; Karia, M, Computing approximate shortest paths on convex polytopes, in Sixteenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (2000), pp. 270-279  [abs]
  245. Agarwal, PK; Procopiuc, CM, Approximation algorithms for projective clustering, in Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 538-547  [abs]
  246. Agarwal, PK; Desikan, PK, Approximation algorithms for layered manufacturing, in Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 528-537  [abs]
  247. Agarwal, PK; Aronov, B; Sharir, M, Exact and approximation algorithms for minimum-width cylindrical shells, in Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (2000), pp. 510-517  [abs]
  248. Agarwal, PK; Bhattacharya, BK; Sen, S, Output-sensitive algorithms for uniform partitions of points, in Tenth Annual International Symposium on Algorithms and Computation, edited by Aggarwal, A; Rangan, CP, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1741 (1999), pp. 403-414, SPRINGER, ISBN 3540669167 [html], [doi]  [abs]
  249. P.K. Agarwal, L. Arge, G. Brodal, and J. S. Vitter, I/O-efficient dynamic point location in monotone subdivisions, in Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (1999)
  250. P.K. Agarwal and S. A. Cook, Guest editors' foreword, Journal of Computer and Systems Sciences, vol. 58 (1999), pp. 259
  251. P.K. Agarwal, Guest editors' foreword, International Journal of Computational Geometry and Applications, vol. 9 (1999), pp. 325
  252. P.K. Agarwal, L. Knipping, M. van Kreveld, T. Strijk, and A.Wolff, A simple and efficient algorithm for high quality line labeling, in GIS Research UK: 7th National Conference (1999) (Also appears in the Fifteenth European Workshop on Computational Geometry, 1999.)
  253. P.K. Agarwal, B. Aronov, S. Har-Peled, and M. Sharir, Exact and approximation algorithms for the minimum width annuli and shells, in Fifteenth Annual Symposium on Computational Geometry (1999)
  254. Agarwal, PK; Aronov, B; Har-Peled, S; Sharir, M, Approximation and exact algorithms for minimum-width annuli and shells, Proceedings of the Annual Symposium on Computational Geometry (1999), pp. 380-389  [abs]
  255. Agarwal, PK; Arge, L; Brodal, GS; Vitter, JS, I/O-efficient dynamic point location in monotone planar subdivisions, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (1999), pp. 11-20  [abs]
  256. Agarwal, PK; O'Rourke, J, Open Problems Presented at SCG'98, Journal of Algorithms, vol. 30 no. 2 (1999), pp. 449-453  [abs]
  257. Agarwal, PK; Aronov, B; Sharir, M, Line transversals of balls and smallest enclosing cylinders in three dimensions, Discrete & Computational Geometry, vol. 21 no. 3 (1999), pp. 373-388, ISSN 0179-5376  [abs]
  258. Agarwal, PK; Efrat, A; Sharir, M, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, SIAM Journal on Computing, vol. 29 no. 3 (1999), pp. 912-953  [abs]
  259. Agarwal, PK; Aronov, B; Sharir, M, Motion planning for a convex polygon in a polygonal environment, Discrete & Computational Geometry, vol. 22 no. 2 (1999), pp. 201-221, ISSN 0179-5376  [abs]
  260. Agarwal, PK; Sharir, M, Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions, in Fifteenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (1999), pp. 143-153  [abs]
  261. Agarwal, PK; Basch, J; Berg, MD; Guibas, LJ; Hershberger, J, Lower bounds for kinetic planar subdivisions, in Fifteenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (1999), pp. 247-254  [abs]
  262. Varadarajan, KR; Agarwal, PK, Approximation algorithms for bipartite and non-bipartite matching in the plane, in Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (1999), pp. 805-814  [abs]
  263. Agarwal, PK; Sharir, M, Motion planning of a ball amid segments in three dimensions, in Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (1999), pp. 21-30  [abs]
  264. Agarwal, PK; Erickson, J; Guibas, LJ, Kinetic binary space partitions for intersecting segments and disjoint triangles, in Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms (1998), pp. 107-116  [abs]
  265. Agarwal, PK; Eppstein, D; Guibas, LJ; Henzinger, MR, Parametric and kinetic minimum spanning trees, in Thirty Ninth Annual Symposium on Foundations of Computer Science, Annual Symposium on Foundations of Computer Science (Proceedings) (1998), pp. 596-605  [abs]
  266. J. Erickson and P.K. Agarwal, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, edited by B. Chazelle, J. Goodman, and R. Pollack (1998), pp. 1-56, American Mathematical Society, Providence
  267. P.K. Agarwal, T. M. Murali, and J. S. Vitter, A new algorithm for constructing binary space partitions for orthogonal rectangles, in Sixth European Symposium on Algorithms (1998)
  268. Agarwal, PK; Sharir, M; Welzl, E, The discrete 2-center problem, Discrete & Computational Geometry, vol. 20 no. 3 (1998), pp. 287-305, ISSN 0179-5376  [abs]
  269. Agarwal, PK; Aronov, B; Chan, TM; Sharir, M, On levels in arrangements of lines, segments, planes, and triangles, Discrete & Computational Geometry, vol. 19 no. 3 (1998), pp. 315-331, ISSN 0179-5376  [abs]
  270. Agarwal, PK; O'Rourke, J, Computational geometry column 34, International Journal of Computational Geometry and Applications, vol. 8 no. 5-6 (1998), pp. 637-642 (Also appeared in SIGACT News, 29 (1998), 27- 33.)  [abs]
  271. Agarwal, PK; Kreveld, MV; Suri, S, Label placement by maximum independent set in rectangles, Computational Geometry: Theory and Applications, vol. 11 no. 3-4 (1998), pp. 209-218  [abs]
  272. Agarwal, PK; Matoušek, J; Schwarzkopf, O, Computing many faces in arrangements of lines and segments, SIAM Journal on Computing, vol. 27 no. 2 (1998), pp. 491-505  [abs]
  273. Agarwal, PK, Surface approximation and geometric partitions, SIAM Journal on Computing, vol. 27 no. 4 (1998), pp. 1016-1035  [abs]
  274. Agarwal, PK; Berg, MD; Matoušek, J; Schwarzkopf, O, Constructing Levels in Arrangements and Higher Order Voronoi Diagrams, SIAM Journal on Computing, vol. 27 no. 3 (1998), pp. 654-667  [abs]
  275. Agarwal, PK; Sharir, M, Efficient algorithms for geometric optimization, ACM Computing Surveys, vol. 30 no. 4 (1998), pp. 448-458, ISSN 0360-0300  [abs]
  276. Agarwal, PK; Amenta, N; Sharir, M, Largest placement of one convex polygon inside another, Discrete & Computational Geometry, vol. 19 no. 1 (1998), pp. 95-104, ISSN 0179-5376  [abs]
  277. Murali, TM; Agarwal, PK; Vitter, JS, Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice., edited by Bilardi, G; Italiano, GF; Pietracaprina, A; Pucci, G, ESA, vol. 1461 (1998), pp. 211-222, SPRINGER, ISBN 3-540-64848-8 [html], [doi]
  278. Agarwal, PK; Biedl, T; Lazard, S; Robbins, S; Suri, S; Whitesides, S, Curvature-constrained shortest paths in a convex polygon, in Fourteenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (1998), pp. 392-401  [abs]
  279. Agarwal, PK; Arge, L; Erickson, J; Franciosa, PG; Vitter, JS, Efficient searching with linear constraints, in Seventeenth Annual Symposium on Principles of Database Systems, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1998), pp. 169-178  [abs]
  280. Agarwal, PK; Procopiuc, CM, Exact and approximation algorithms for clustering, in Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (1998), pp. 658-667  [abs]
  281. Agarwal, PK; Arge, L; Murali, TM; Varadarajan, KR; Vitter, JS, I/O-efficient algorithms for contour-line extraction and planar graph blocking, in Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (1998), pp. 117-126  [abs]
  282. N. Amenta, B. Aronov, M. Sharir, and P.K. Agarwal, Largest placements and motion planning of a convex polygon, in Algorithms for Robotic Motion and Manipulation, pp. 143-154, edited by J.-P. Laumond and M. Overmars (1997), A. K. Peters, Wellesley
  283. P.K. Agarwal, Range searching, in CRC Handbook of Discrete and Computational Geometry, edited by J. Goodman and J. O'Rourke (1997), pp. 575-598, CRC Press, NewYork
  284. P.K. Agarwal and P. K. Desikan, Fast algorithms for surface simpli cation and other related problems, in Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (1997)
  285. P.K. Agarwal, L. Guibas, T. M. Murali, and J. S. Vitter, Cylindrical kinetic and static binary space partitions, in Thirteenth Annual Symposium on Computational Geometry (1997)
  286. P.K. Agarwal, (short communication) with T. M. Murali and J. S. Vitter, Practical techniques for constructing binary space partitions of rectangles, in Thirteenth Annual Symposium on Computational Geometry (1997)
  287. P.K. Agarwal, M. Sharir, and E. Welzl, The discrete 2-center problem, in Thirteenth Annual Symposium on Computational Geometry (1997)
  288. P.K. Agarwal, L. Guibas, J. Hershberger, and E. Veach, Maintaining structures for moving points, in Fifth Workshop on Algorithms and Data Structures (1997)
  289. P.K. Agarwal, M. van Kreveld, and S. Suri, Label placement by maximum independent set in rectangles, in Ninth Canadian Conference on Computational Geometry (1997)
  290. P.K. Agarwal and K. R. Varadarajan, Approximating shortest paths on polyhedral terrains, in Thirty Eighth Annual Symposium on Foundations of Computer Science (1997)
  291. Agarwal, PK; Sharir, M; Welzl, E, Discrete 2-center problem, Proceedings of the Annual Symposium on Computational Geometry (1997), pp. 147-155  [abs]
  292. Agarwal, PK; Murali, TM; Vitter, JS, Practical techniques for constructing Binary Space Partitions for orthogonal rectangles, Proceedings of the Annual Symposium on Computational Geometry (1997), pp. 382-384  [abs]
  293. Agarwal, PK; Guibas, LJ; Murali, TM; Vitter, JS, Cylindrical static and kinetic binary space partitions, Proceedings of the Annual Symposium on Computational Geometry (1997), pp. 39-48  [abs]
  294. Agarwal, PK; Desikan, PK, Efficient algorithm for terrain simplification, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (1997), pp. 139-147  [abs]
  295. Varadarajan, KR; Agarwal, PK, Approximating shortest paths on a nonconvex polyhedron, Annual Symposium on Foundations of Computer Science - Proceedings (1997), pp. 182-191  [abs]
  296. Agarwal, PK; Aronov, B; Pach, J; Pollack, R; Sharir, M, Quasi-planar graphs have a linear number of edges, Combinatorica, vol. 17 no. 1 (1997), pp. 1-9  [abs]
  297. Agarwal, PK; Har-Peled, S; Sharir, M; Varadarajan, KR, Approximating shortest paths on a convex polytope in three dimensions, Journal of the ACM, vol. 44 no. 4 (1997), pp. 567-584  [abs]
  298. Varadarajan, KR; Agarwal, PK, Linear approximation of simple objects, Information Processing Letters, vol. 62 no. 2 (1997), pp. 89-94  [abs]
  299. Agarwal, PK; Aronov, B; Sharir, M, Computing envelopes in four dimensions with applications, SIAM Journal on Computing, vol. 26 no. 6 (1997), pp. 1714-1732  [abs]
  300. Agarwal, PK; Aronov, B; O'Rourke, J; Schevon, CA, Star unfolding of a polytope with applications, SIAM Journal on Computing, vol. 26 no. 6 (1997), pp. 1689-1713  [abs]
  301. Agarwal, PK; Latombe, J-C; Motwani, R; Raghavan, P, Nonholonomic path planning for pushing a disk among obstacles, in IEEE Conference on Robotics and Automation, Proceedings - IEEE International Conference on Robotics and Automation, vol. 4 (1997), pp. 3124-3129 (Also appears in the abstracts of the First CGC Workshop on Computational Geometry.)  [abs]
  302. Agarwal, PK; Aronov, B; Sharir, M, On levels in arrangements of lines, segments, planes, and triangles, in Thirteenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (1997), pp. 30-38  [abs]
  303. Agarwal, PK; Aronov, B; Sharir, M, Line transversals of balls and smallest enclosing cylinders in three dimensions, in Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (1997), pp. 483-492  [abs]
  304. Agarwal, PK; Guibas, LJ; Hershberger, J; Veach, E, Maintaining the Extent of a Moving Point Set., edited by Dehne, FKHA; Rau-Chaplin, A; Sack, J-R; Tamassia, R, WADS, vol. 1272 (1997), pp. 31-44, SPRINGER, ISBN 3-540-63307-3 [html], [doi]
  305. P.K. Agarwal and H. Wang, Approximation algorithms for shortest paths with bounded curvature, in Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (1996)
  306. P.K. Agarwal and S. Suri, Simple and practical geometric algorithms, ACM Computing Surveys, vol. 28 (1996)
  307. P.K. Agarwal and S. Suri, Simple and practical geometric algorithms, ACM Computing Surveys, vol. 28 (1996)
  308. P.K. Agarwal, M. de Berg, D. Halperin, and M. Sharir, Computing depth orders in multiple directions, in Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (1996)
  309. P.K. Agarwal and H. Wang, Approximation algorithms for shortest paths with bounded curvature, in Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (1996)
  310. P.K. Agarwal, N. Amenta, B. Aronov, and M. Sharir, Largest placements and motion planning of a convex polygon, in Second International Workshop on Algorithmic Foundations of Robotics (1996)
  311. Frey, HC; Agarwal, P, Probabilistic analysis and optimization of new power generation technologies: a case study for the externally-fired combined cycle, Proceedings of the American Power Conference, vol. 1 (1996), pp. 52-57  [abs]
  312. Agarwal, PK; Kreveld, MV, Connected Component and Simple Polygon Intersection Searching, Algorithmica (New York), vol. 15 no. 6 (1996), pp. 626-660  [abs]
  313. Agarwal, PK; Schwarzkopf, O; Sharir, M, The overlay of lower envelopes and its applications, Discrete & Computational Geometry, vol. 15 no. 1 (1996), pp. 1-13, ISSN 0179-5376  [abs]
  314. Agarwal, PK; Sharir, M, Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions, SIAM Journal on Computing, vol. 25 no. 1 (1996), pp. 100-116  [abs]
  315. Frey, HC; Agarwal, P, Probabilistic modeling and optimization of clean coal technologies: case studies of the externally-fired combined cycle, Proceedings of the Air & Waste Management Association's Annual Meeting & Exhibition (1996), pp. 16pp  [abs]
  316. Agarwal, PK; Sen, S, Selection in Monotone Matrices and Computing kth Nearest Neighbors, Journal of Algorithms, vol. 20 no. 3 (1996), pp. 581-601 [doi]  [abs]
  317. Agarwal, PK; Sharir, M, Ray Shooting Amidst Convex Polygons in 2D, Journal of Algorithms, vol. 21 no. 3 (1996), pp. 508-519 [doi]  [abs]
  318. Agarwal, PK; Sharir, M, Efficient randomized algorithms for some geometric optimization problems, Discrete & Computational Geometry, vol. 16 no. 4 (1996), pp. 317-337, ISSN 0179-5376  [abs]
  319. Tamassia, R; Agarwal, PK; Amato, N; Chen, DZ; Dobkin, D; Drysdale, S; Fortune, S; Goodrich, MT; Hershberger, J; O'Rourke, J; Preparata, FP; Sack, J-R; Suri, S; Tollis, I; Vitter, JS; Whitesides, S, Strategic directions in computational geometry, ACM Computing Surveys, vol. 28 no. 4 (1996), pp. 591-606
  320. Agarwal, PK; Grove, EF; Murali, TM; Vitter, JS, Binary space partitions for fat rectangles, in Thirty Seventh Annual Symposium on Foundations of Computer Science, Annual Symposium on Foundations of Computer Science - Proceedings (1996), pp. 482-491  [abs]
  321. Cohen, J; Varshney, A; Manocha, D; Turk, G; Weber, H; Agarwal, P; Brooks, F; Wright, W, Simplification envelopes, in SIGGRAPH, Proceedings of the ACM SIGGRAPH Conference on Computer Graphics (1996), pp. 119-128  [abs]
  322. Agarwal, PK; Berg, MD; Halperin, D; Sharir, M, Efficient Generation of k-Directional Assembly Sequences., edited by Tardos, É, SODA (1996), pp. 122-131, ACM/SIAM, ISBN 0-89871-366-8
  323. Wang, H; Agarwal, PK, Approximation Algorithms for Curvature-Constrained Shortest Paths., edited by Tardos, É, SODA (1996), pp. 409-418, ACM/SIAM, ISBN 0-89871-366-8
  324. M. Sharir and P.K. Agarwal, Algorithmic techniques for geometric optimization, in Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science, vol. 1000; pp. 234-253, edited by J. van Leeuwen (1995), Springer-Verlag, Berlin
  325. J. Matousek and P.K. Agarwal, Dynamic half-space searching and its applications, Algorithmica, vol. 14 (1995), pp. 325-345
  326. P.K. Agarwal, P. Raghavan, and H. Tamaki, Motion planning for a steering-constrained robot through moderate obstacles, in Twenty Seventh Annual ACM Symposium on Theory of Computing (1995)
  327. P.K. Agarwal, B. Aronov and S. Suri, Line stabbing bounds on triangulations in 3D, in Eleventh Annual Symposium on Computational Geometry (1995)
  328. P.K. Agarwal, O. Schwarzkopf, and M. Sharir, The overlay of envelopes and their applications, in Eleventh Annual Symposium on Computational Geometry (1995)
  329. P.K. Agarwal and K. R. Varadarajan, Linear approximation of convex objects, in Seventh Canadian Conference on Computational Geometry (1995)
  330. Agarwal, P, Cellular segregation and engulfment simulations using the cell programming language, Journal of Theoretical Biology, vol. 176 no. 1 (1995), pp. 79-89, ISSN 0022-5193 [doi]  [abs]
  331. Agarwal, PK; Matoušek, J, Dynamic half-space range reporting and its applications, Algorithmica, vol. 13 no. 4 (1995), pp. 325-345, ISSN 0178-4617 [doi]  [abs]
  332. Agarwal, PK; Katz, MJ; Sharir, M, Computing depth orders for fat objects and related problems, Computational Geometry, vol. 5 no. 4 (1995), pp. 187-206, ISSN 0925-7721  [abs]
  333. Agarwal, PK; Schwarzkopf, O; Sharir, M, The Overlay of Lower Envelopes in Three Dimensions and Its Applications., edited by Snoeyink, J, Symposium on Computational Geometry (1995), pp. 182-189, ACM, ISBN 0-89791-724-3 [doi]
  334. Agarwal, PK; Efrat, A; Sharir, M, Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications., in Eleventh Annual Symposium on Computational Geometry, edited by Snoeyink, J, Symposium on Computational Geometry (1995), pp. 39-50, ACM, ISBN 0-89791-724-3 [doi]
  335. Agarwal, PK; Aronov, B; Suri, S, Stabbing Triangulations by Lines in 3D., edited by Snoeyink, J, Symposium on Computational Geometry (1995), pp. 267-276, ACM, ISBN 0-89791-724-3 [doi]
  336. Agarwal, PK; Sharir, M, Efficient Randomized Algorithms for Some Geometric Optimization Problems., in Eleventh Annual Symposium on Computational Geometry, edited by Snoeyink, J, Symposium on Computational Geometry (1995), pp. 326-335, ACM, ISBN 0-89791-724-3 [doi]
  337. Agarwal, PK; Aronov, B; Pach, J; Pollack, R; Sharir, M, Quasi-Planar Graphs Have a Linear Number of Edges., in Symposium on Graph Drawing, edited by Brandenburg, F-J, Graph Drawing, vol. 1027 (1995), pp. 1-7, SPRINGER, ISBN 3-540-60723-4 [html], [doi]
  338. M. van Kreveld and P.K. Agarwal, Implicit point location in arrangement segments with application to motion planning, International Journal of Computational Geometry and Applications, vol. 4 (1994), pp. 369-383
  339. J. Matousek and P.K. Agarwal, Range searching with semialgebraic sets, Discrete and Computational Geometry, vol. 11 (1994), pp. 393-418
  340. P.K. Agarwal and S. Suri, Surface approximation and disjoint geometric covers, in Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (1994)
  341. P.K. Agarwal and S. Sen, Selection in monotone matrices and kth nearest neighbors, in Fourth Scandinavian Workshop on Algorithm Theory (1994)
  342. Agarwal, P, Simulation of aggregation in Dictyostelium using the cell programming language, Computer Applications in the Biosciences, vol. 10 no. 6 (1994), pp. 647-655  [abs]
  343. Agarwal, P; Sharir, M, Planar geometric location problems, Algorithmica (New York), vol. 11 no. 2 (1994), pp. 185-195  [abs]
  344. Agarwal, PK, On stabbling lines for convex polyhedra in 3D, Computational Geometry, vol. 4 no. 4 (1994), pp. 177-189, ISSN 0925-7721  [abs]
  345. Agarwal, PK; Sharir, M; Toledo, S, Applications of Parametric Searching in Geometric Optimization, Journal of Algorithms, vol. 17 no. 3 (1994), pp. 292-318, ISSN 0196-6774 [doi]  [abs]
  346. Agarwal, PK; Matousek, J, On range searching with semialgebraic sets, Discrete & Computational Geometry, vol. 11 no. 1 (1994), pp. 393-418, ISSN 0179-5376 [doi]  [abs]
  347. Agarwal, PK; Alon, N; Aronov, B; Suri, S, Can visibility graphs Be represented compactly?, Discrete & Computational Geometry, vol. 12 no. 1 (1994), pp. 347-365, ISSN 0179-5376 [doi]  [abs]
  348. Agarwal, PK; Sharir, M, On the number of views of polyhedral terrains, Discrete & Computational Geometry, vol. 12 no. 1 (1994), pp. 177-182, ISSN 0179-5376 [doi]  [abs]
  349. Agarwal, PK; Suri, S, Surface approximation and geometric partitions, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (1994), pp. 24-33  [abs]
  350. Agarwal, PK; Berg, MD; Matousek, J; Schwarzkopf, O, Constructing levels in arrangements and higher order Voronoi diagrams, in Tenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (1994), pp. 67-75  [abs]
  351. Agarwal, PK; Aronov, B; Sharir, M, Computing envelopes in four dimensions with applications, in Tenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (1994), pp. 348-358  [abs]
  352. Agarwal, PK; Matousek, J; Schwarzkopf, O, Computing many faces in arrangements of lines and segments, in Tenth Annual Symposium on Computational Geometry, Proceedings of the Annual Symposium on Computational Geometry (1994), pp. 76-84  [abs]
  353. Agarwal, PK; Sen, S, Selection in Monotone Matrices and Computing kth Nearest Neighbors., edited by Schmidt, EM; Skyum, S, SWAT, vol. 824 (1994), pp. 13-24, SPRINGER, ISBN 3-540-58218-5 [doi]
  354. Agarwal, PK; Katz, MJ; Sharir, M, Computing Depth Orders and Related Problems., in Fourth Scandinavian Workshop on Algorithm Theory, edited by Schmidt, EM; Skyum, S, SWAT, vol. 824 (1994), pp. 1-12, SPRINGER, ISBN 3-540-58218-5 [doi]
  355. Agarwal, PK; Van Kreveld, M, Connected component and simple polygon intersection searching, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 709 LNCS (January, 1993), pp. 37-47, ISBN 9783540571551  [abs]
  356. M. Sharir and P.K. Agarwal, Circular visibility of a simple polygon from a fixed point, International Journal of Computational Geometry and Applications, vol. 3 (1993), pp. 1-25
  357. P.K. Agarwal and M. Sharir, Ray shooting among convex polytopes in 3D, in Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993)
  358. P.K. Agarwal and M. van Kreveld, Polygon and connected component intersection searching, in Third Workshop on Algorithms and Data Structures (1993)
  359. P.K. Agarwal and M. Sharir, On the number of views of polyhedral terrains, in Fifth Canadian Conference on Computational Geometry (1993)
  360. Agarwal, PK; Sharir, M, Circle Shooting in a Simple Polygon, Journal of Algorithms, vol. 14 no. 1 (1993), pp. 69-87, ISSN 0196-6774 [doi]  [abs]
  361. Agarwal, PK; Sharir, M, Ray shooting amidst convex polytopes in three dimensions, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993), pp. 260-270  [abs]
  362. Agarwal, PK; Matousek, J, Ray shooting and parametric search, SIAM Journal on Computing, vol. 22 no. 4 (1993), pp. 794-806  [abs]
  363. Agarwal, PK; Aronov, B; Sharir, M; Suri, S, Selecting distances in the plane, Algorithmica, vol. 9 no. 5 (1993), pp. 495-514, ISSN 0178-4617 [doi]  [abs]
  364. Agarwal, PK; Pellegrini, M; Sharir, M, Counting circular arc intersections, SIAM Journal on Computing, vol. 22 no. 4 (1993), pp. 778-793  [abs]
  365. Agarwal, PK; Efrat, A; Sharir, M; Toledo, S, Computing a Segment Center for a Planar Point Set, Journal of Algorithms, vol. 15 no. 2 (1993), pp. 314-323, ISSN 0196-6774 [doi]  [abs]
  366. Agarwal, PK; Vankreveld, M; Overmars, M, Intersection Queries in Curved Objects, Journal of Algorithms, vol. 15 no. 2 (1993), pp. 229-266, ISSN 0196-6774 [doi]  [abs]
  367. Agarwal, PK; Sharir, M, Applications of a new space-partitioning technique, Discrete & Computational Geometry, vol. 9 no. 1 (1993), pp. 11-38, ISSN 0179-5376 [doi]  [abs]
  368. Agarwal, PK; Alon, N; Aronov, B; Suri, S, Can visibility graphs be represented compactly?, in Ninth Annual Symposium on Computational Geometry, Proceedings of the 9th Annual Symposium on Computational Geometry (1993), pp. 338-347  [abs]
  369. Agarwal, PK; van Kreveld, M, Implicit point location of line segments, with an arrangements an application to motion planning, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 652 LNCS (January, 1992), pp. 80-91, ISBN 9783540562870  [abs]
  370. P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, SIAM Journal on Computing, vol. 21 (1992), pp. 540-570
  371. P.K. Agarwal and J. Matousek, Range searching with semialgebraic sets, in Seventeenth Symposium on Mathematical Foundations of Computer Science (1992)
  372. P.K. Agarwal, D. Eppstein, and J. Matousek, Dynamic half-space range searching with applications to proximity problems, in Thirty Third Annual Symposium on Foundations of Computer Science (1992)
  373. P.K. Agarwal and M. van Kreveld, Implicit point location in arrangement segments with application to motion planning, in Twelfth Conference on Foundations of Software Technology and Theoretical Computer Science (1992)
  374. Agarwal, PK; Matoušek, J; Suri, S, Farthest neighbors, maximum spanning trees and related problems in higher dimensions, Computational Geometry, vol. 1 no. 4 (1992), pp. 189-201, ISSN 0925-7721  [abs]
  375. Agarwal, PK; Matoušek, J, Relative neighborhood graphs in three dimensions, Computational Geometry, vol. 2 no. 1 (1992), pp. 1-14, ISSN 0925-7721  [abs]
  376. Kreveld, MV; Overmars, M; Agarwal, PK, Intersection queries in sets of disks, Bit, vol. 32 no. 2 (1992), pp. 268-279, ISSN 0006-3835 [doi]  [abs]
  377. Agarwal, PK; Aronov, B, Counting facets and incidences, Discrete & Computational Geometry, vol. 7 no. 1 (1992), pp. 359-369, ISSN 0179-5376 [doi]  [abs]
  378. Agarwal, PK; Shing, M-T, Oriented aligned rectangle packing problem, European Journal of Operational Research, vol. 62 no. 2 (1992), pp. 210-220, ISSN 0377-2217  [abs]
  379. Agarwal, PK; Matousek, J, Ray shooting and parametric search, in Twenty Fourth Annual ACM Symposium on Theory of Computing, Conference Proceedings of the Annual ACM Symposium on Theory of Computing (1992), pp. 517-526  [abs]
  380. Agarwal, PK; Matousek, J, Relative Neighborhood Graphs in Three Dimensions., in Third Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Frederickson, GN, SODA (1992), pp. 58-65, ACM/SIAM, ISBN 0-89791-466-X
  381. Agarwal, PK; Sharir, M; Toledo, S, Applications of Parametric Searching in Geometric Optimization., in Third Annual ACM-SIAM Symposium on Discrete Algorithms, edited by Frederickson, GN, SODA (1992), pp. 72-82, ACM/SIAM, ISBN 0-89791-466-X
  382. Agarwal, PK; Matousek, J, On Range Searching with Semialgebraic Sets., edited by Havel, IM; Koubek, V, MFCS, vol. 629 (1992), pp. 1-13, SPRINGER, ISBN 3-540-55808-X [doi]
  383. Agarwal, PK; Matoušek, J; Suri, S, Farthest neighbors, maximum spanning trees and related problems in higher dimensions, in Second Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 519 LNCS (1991), pp. 105-116, ISBN 9783540475668 [doi]  [abs]
  384. H. Edelsbrunner, O. Schwarzkopf, E. Welzl and P.K. Agarwal, Euclidean minimum spanning tree and bichromatic closest pairs, Discrete and Computational Geometry, vol. 6 (1991), pp. 407-422
  385. P.K. Agarwal, Geometric partitioning and its applications, in Discrete and Computational Geometry: Papers from the DIMACS Special Year, edited by J. Goodman, R. Pollack, and W. Steiger (1991), pp. 1-37, American Mathematical Society (Providence, RI.)
  386. P.K. Agarwal and M. Sharir, Planar geometric location problems and maintaining the width of a planar set, in Second Annual ACM-SIAM Symposium on Discrete Algorithms (1991)
  387. P.K. Agarwal and M. Sharir, Counting circular arc intersections, in Seventh Annual Symposium on Computational Geometry (1991)
  388. P.K. Agarwal and M. Sharir, Applications of a new space partitioning technique, in Second Workshop on Algorithms and Data Structures (1991)
  389. P.K. Agarwal, M. van Kreveld, and M. Overmars, Storing and searching curved objects, in Seventh Annual Symposium on Computational Geometry (1991)
  390. Agarwal, PK; Edelsbrunner, H; Schwarzkopf, O; Welzl, E, Euclidean minimum spanning trees and bichromatic closest pairs, Discrete & Computational Geometry, vol. 6 no. 1 (1991), pp. 407-422, ISSN 0179-5376 [doi]  [abs]
  391. Agarwal, PK; Aggarwal, A; Aronov, B; Kosaraju, SR; Schieber, B; Suri, S, Computing external farthest neighbors for a simple polygon, Discrete Applied Mathematics, vol. 31 no. 2 (1991), pp. 97-111, ISSN 0166-218X  [abs]
  392. Agarwal, PK; Sharir, M, Off-line dynamic maintenance of the width of a planar point set, Computational Geometry, vol. 1 no. 2 (1991), pp. 65-78, ISSN 0925-7721  [abs]
  393. P.K. Agarwal, Partitioning arrangements of lines: I. A deterministic algorithm, Discrete and Computational Geometry, vol. 5 (1990), pp. 449-483
  394. M. T. Shing and P.K. Agarwal, Algorithms for special cases of rectilinear Steiner trees: I. Points on the boundary of a rectangle, Networks, vol. 20 (1990), pp. 453-485
  395. P.K. Agarwal, B. Aronov, J. O'Rourke, and C. Schevon, Star unfolding of a polytope with applications, in Second Scandinavian Workshop on Algorithm Theory (1990)
  396. P.K. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, Euclidean minimum spanning tree and bichromatic closest pairs, in Sixth Annual Symposium on Computational Geometry (1990)
  397. Agarwal, PK, Partitioning arrangements of lines I: An efficient deterministic algorithm, Discrete & Computational Geometry, vol. 5 no. 1 (1990), pp. 449-483, ISSN 0179-5376 [doi]  [abs]
  398. Agarwal, PK; Edelsbrunner, H; Schwarzkopf, O; Welzl, E, Euclidean minimum spanning trees and bichromatic closest pairs (1990), pp. 203-210  [abs]
  399. Agarwal, PK; Sharir, M, Red-blue intersection detection algorithms, with applications to motion planning and collision detection, SIAM Journal on Computing, vol. 19 no. 2 (1990), pp. 297-321  [abs]
  400. Agarwal, PK, Partitioning arrangements of lines II: Applications, Discrete & Computational Geometry, vol. 5 no. 1 (1990), pp. 533-573, ISSN 0179-5376 [doi]  [abs]
  401. Agarwal, PK; Aronov, B; Sharir, M; Suri, S, Selecting distances in the plane, in Sixth Annual Symposium on Computational Geometry (1990), pp. 321-331  [abs]
  402. Agarwal, PK; Aronov, B; O'Rourke, J; Schevon, CA, Star Unfolding of a Polytope with Applications (Extended Abstract)., edited by Gilbert, JR; Karlsson, RG, SWAT, vol. 447 (1990), pp. 251-263, SPRINGER, ISBN 3-540-52846-6 [doi]
  403. Kreveld, MJV; Overmars, MH; Agarwal, PK, Intersection Queries in Sets of Disks., in Second Scandinavian Workshop on Algorithm Theory, edited by Gilbert, JR; Karlsson, RG, SWAT, vol. 447 (1990), pp. 393-403, SPRINGER, ISBN 3-540-52846-6 [doi]
  404. P.K. Agarwal, A. Aggarwal, B. Aronov, S. Kosaraju, B. Shieber, and S. Suri, Computing all external-farthest neighbors for a simple polygon, in First Canadian Conference on Computational Geometry (1989)
  405. P.K. Agarwal, An efficient algorithm for partitioning arrangements of lines and its applications, in Fifth Annual Symposium on Computational Geometry (1989)
  406. P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number, Fifth Annual Symposium on Computational Geometry (1989)
  407. Agarwal, PK; Sharir, M; Shor, P, Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences, Journal of Combinatorial Theory, Series A, vol. 52 no. 2 (1989), pp. 228-274, ISSN 0097-3165  [abs]
  408. P.K. Agarwal and Micha Sharir, Red-blue intersection detection algorithms, with applications to motion planning and collision detection, Fourth Annual Symposium on Computational Geometry (1988)
  409. T. Smith, D. Peuquet, and S. Menon, and P.K. Agarwal, KBGIS-II: A knowledge-based geographic information system, International Journal of Geographical Information Systems, vol. 1 (1987), pp. 149-172
  410. P.K. Agarwal, A. Choudhary and S. Sengupta, A VME bus compatible FFT Processor, in Conference on Signal Processing (1983) (Cochin, India.)

Papers Submitted

  1. Agarwal, PK; Arge, L; Erickson, J, Indexing moving points, Journal of Computer and System Sciences, vol. 66 no. 1 (2002), pp. 207-243 [doi]  [abs]
  2. Agarwal, PK; Procopiuc, CM, Approximation algorithms for projective clustering, Journal of Algorithms, vol. 46 no. 2 (2002), pp. 115-139 [doi]  [abs]
  3. Procopiuc, O; Agarwal, PK; Arge, L; Vitter, JS, Bkd-tree: A dynamic scalable kd-tree, Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2750 (2002), pp. 46-65, ISSN 0302-9743 (submitted for publication.)  [abs]
  4. Agarwal, PK; Procopiuc, CM, Exact and Approximation Algorithms for Clustering, Algorithmica, vol. 33 no. 2 (2002), pp. 201-226 [doi]  [abs]
  5. P.K. Agarwal, B. Bhattacharya, and S. Sen, Output-sensitive algorithms for uniform partitions of points, in Algorithmica, in press (2002)
  6. P.K. Agarwal and M. Sharir, On the numbers of congruent simplices in a point set, to appear in Discrete and Computational Geometry (2002)
  7. P.K. Agarwal (invited) with J. Basch, L.J. Guibas, J. Hershberger, and L. Zhang, Deformable free space tiling for kinetic collision detection, submitted to International Journal of Robotics (2002)
  8. P.K. Agarwal, C. M. Procopiuc, andand K. R. Varadarajan, An approximation algorithm for computing the two-line center, submitted to Computational Geometry: Theory and Applications (2002)
  9. P.K. Agarwal, M. de Berg, S. Har-Peled, M. Overmars, M. Sharir and J. Vahrenhold, Reporting all intersecting pairs of polytopes in two and three dimensions, submitted to Computational Geometry: Theory and Applications (2002)
  10. P.K. Agarwal, M. Bern, D. Eppstein, N. Amenta, P. Chew, K. Clarkson, T. Dey, D. P. Dobkin, H. Edelsbrunner, C. Grimm, L. P. Guibas, J. Harer, J. Hass, A. Hicks, C. K. Johnson, G. Lerman, D. Letscher, P. Plassmann, E. Sedgwick, J. Snoeyink, J. Weeks, C. Y, Emerging challenges in computational topology (2002) (to appear in 2002.)
  11. P.K. Agarwal, S. Govindarajan, and L. Arge, CRB-tree: An eÆcient indexing scheme for range aggregate queries (2002) (submitted for publication.)
  12. P.K. Agarwal, R. Klein, C. Knauer, and M. Sharir, Computing the detour of polygonal curves (2002) (submitted for publication.)
  13. Agarwal, PK; Har-Peled, S; Karia, M, Computing approximate shortest paths on convex polytopes, Algorithmica (New York), vol. 33 no. 2 (2002), pp. 227-242, to appear in Algorithmica  [abs]
  14. Agarwal, PK; Biedl, T; Lazard, S; Robbins, S; Suri, S; Whitesides, S, Curvature-constrained shortest paths in a convex polygon, SIAM Journal on Computing, vol. 31 no. 6 (2002), pp. 1814-1851 [doi]  [abs]
  15. Agarwal, PK; Guibas, LJ; Edelsbrunner, H; Erickson, J; Isard, M; Har-Peled, S; Hershberger, J; Jensen, C; Kavraki, L; Koehl, P; Lin, M; Manocha, D; Metaxas, D; Mirtich, B; Mount, D; Muthukrishnan, S; Pai, D; Sacks, E; Snoeyink, J; Suri, S; Wolefson, O, Algorithmic issues in modeling motion, ACM Computing Surveys, vol. 34 no. 4 (2002), pp. 550-572, ISSN 0360-0300 (to appear in 2002.) [doi]  [abs]
  16. Agarwal, PK; Berg, MD; Gudmundsson, J; Hammar, M; Haverkort, HJ, Box-trees and R-trees with near-optimal query time, Discrete & Computational Geometry, vol. 28 no. 3 (2002), pp. 291-312, ISSN 0179-5376 [doi]  [abs]
  17. P.K. Agarwal and P. K. Desikan, Fast algorithms for surface simpli cation and other related problems, submitted to Discrete and Computational Geometry (1999) (Also appears as Technical Report CS-1999-15, Department of Computer Science, Duke University, 1999.)

Other

  1. P.K. Agarwal, Range searching, Technical Report CS-1996-05, Department of Computer Science, Duke University (1996)
  2. P.K. Agarwal, F. Brooks, A. Varshney, H.Weber, and W. Wright, Multiresolution hierarchy generation of polygonal models, Technical Report CS-1995-20, Department of Computer Science, Duke University (1995)
  3. P.K. Agarwal, M. Sharir, and S. Toledo, An efficient multidimensional searching technique and its applications, Technical Report CS-1993-20, Department of Computer Science, Duke University (1993)
  4. P.K. Agarwal and M. T. Shing, Multiterminal flows in planar networks, Technical Report TRCS86-07, Department of Computer Science, Santa Barbara (1986)
  5. P.K. Agarwal, Geometric Algorithms, Technical Report TRCS85-17, Department of Computer Science, Santa Barbara (1985)

 

dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320