Math @ Duke

Books
 P.K. Agarwal, Robotics: The Algorithmic Perspective, edited by L. Kavraki and M. Mason
(1998), A. K. Peters, Wellesley
 M. Sharir and P.K. Agarwal, DavenportSchinzel Sequences and Their Geometric Applications
(1995), Cambridge University Press, CambridgeNew YorkMelbourne
 J. Pach and P.K. Agarwal, Combinatorial Geometry
(1995), John Wiley and Sons, New York
 P. K. Agarwal, Intersection and Decomposition Algorithms for Planar Arrangements,
(1991), Cambridge University Press, CambridgeNew YorkMelbourne
Papers Published
 Lowe, A; Agarwal, PK, Floodrisk analysis on terrains under the multiflowdirection model,
Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems
(November, 2018),
pp. 5362, ACM Press, ISBN 9781450358897 [doi] [abs]
 Agarwal, PK; Kyle, FOX; Salzman, O, An efficient algorithm for computing highquality paths amid polygonal obstacles,
Acm Transactions on Algorithms, vol. 14 no. 4
(August, 2018),
pp. 121, Association for Computing Machinery (ACM) [doi] [abs]
 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]
 Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Rangemax queries on uncertain data,
Journal of Computer and System Sciences, vol. 94
(June, 2018),
pp. 118134, Elsevier BV [doi] [abs]
 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. 41414 [doi] [abs]
 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. 51515, ISBN 9783959770682 [doi] [abs]
 Agarwal, PK; Kyle, FOX; Nath, A; Sidiropoulos, A; Wang, Y, Computing the gromovhausdorff distance for metric trees,
Acm Transactions on Algorithms, vol. 14 no. 2
(June, 2018),
pp. 120, Association for Computing Machinery (ACM) [doi] [abs]
 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. 7587, ACM Press, ISBN 9781450347068 [doi] [abs]
 Agarwal, PK; Fox, K; Nath, A, Maintaining reeb graphs of triangulated 2manifolds,
Leibniz International Proceedings in Informatics, Lipics, vol. 93
(January, 2018), ISBN 9783959770552 [doi] [abs]
 Agarwal, PK; HarPeled, S; Suri, S; Yıldız, H; Zhang, W, Convex Hulls Under Uncertainty,
Algorithmica, vol. 79 no. 2
(October, 2017),
pp. 340367, Springer Nature [doi] [abs]
 Agarwal, PK; Rubin, N; Sharir, M, Approximate nearest neighbor search amid higherdimensional flats,
Leibniz International Proceedings in Informatics, Lipics, vol. 87
(September, 2017), ISBN 9783959770491 [doi] [abs]
 Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Efficient algorithms for kregret minimizing sets,
Leibniz International Proceedings in Informatics, Lipics, vol. 75
(August, 2017), ISBN 9783959770361 [doi] [abs]
 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. 71716, ISBN 9783959770385 [doi] [abs]
 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. 141, Association for Computing Machinery (ACM) [doi] [abs]
 Wu, Y; Gao, J; Agarwal, PK; Yang, J, Finding diverse, highvalue representatives on a surface of answers,
Proceedings of the Vldb Endowment, vol. 10 no. 7
(January, 2017),
pp. 793804, VLDB Endowment [doi] [abs]
 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. 281287, Springer Singapore, ISBN 9789811031557 [doi] [abs]
 Rav, M; Lowe, A; Agarwal, PK, Flood Risk Analysis on Terrains,
Proceedings of the 25th Acm Sigspatial International Conference on Advances in Geographic Information Systems Sigspatial'17, vol. 2017November
(2017), ACM Press, ISBN 9781450354905 [doi] [abs]
 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.17.12, ISBN 9783959770262 [doi] [abs]
 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), ACM Press, ISBN 9781450345897 [doi] [abs]
 Agarwal, PK; Aronov, B; HarPeled, S; Phillips, JM; Yi, K; Zhang, W, Nearestneighbor searching under uncertainty II,
Acm Transactions on Algorithms, vol. 13 no. 1
(October, 2016),
pp. 705745, Association for Computing Machinery (ACM) [doi] [abs]
 Agarwal, PK; Beutel, A; Mølhave, T, TerraNNI,
Acm Transactions on Spatial Algorithms and Systems, vol. 2 no. 2
(June, 2016),
pp. 131, Association for Computing Machinery (ACM) [doi]
 Agarwal, PK; Kumar, N; Sintos, S; Suri, S, Rangemax queries on uncertain data,
Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, vol. 26June01July2016
(June, 2016),
pp. 465476, ACM Press, ISBN 9781450341912 [doi] [abs]
 Agarwal, PK; Fox, K; Munagala, K; Nath, A, Parallel algorithms for constructing range and nearestneighbor searching data structures,
Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems, vol. 26June01July2016
(June, 2016),
pp. 429440, ACM Press, ISBN 9781450341912 [doi] [abs]
 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.16.16 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Topk Preferences in High Dimensions,
Ieee Transactions on Knowledge and Data Engineering, vol. 28 no. 2
(February, 2016),
pp. 311325, Institute of Electrical and Electronics Engineers (IEEE), ISSN 10414347 [doi] [abs]
 Agarwal, PK; Fox, K; Salzman, O, An efficient algorithm for computing highquality paths amid polygonal obstacles,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. 2
(January, 2016),
pp. 11791192, ISBN 9781510819672 [abs]
 Pan, J; Rao, V; Agarwal, PK; Gelfand, AE, Markovmodulated marked poisson processes for checkin data,
33rd International Conference on Machine Learning, Icml 2016, vol. 5
(January, 2016),
pp. 33113320, ISBN 9781510829008 [abs]
 Nath, A; Fox, K; Munagala, K; Agarwal, PK, Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains,
Proceedings of the 24th Acm Sigspatial International Conference on Advances in Geographic Information Systems Gis '16
(2016), ACM Press, ISBN 9781450345897 [doi] [abs]
 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. 905929, Springer Nature, ISSN 01795376 [doi]
 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. 0306November2015
(November, 2015), ACM Press, ISBN 9781450339674 [doi] [abs]
 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
(September, 2015),
pp. 871904, Springer Nature, ISSN 01795376 [doi] [abs]
 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. 796811, ISSN 18688969 [doi] [abs]
 Agarwal, PK; Sharathkumar, R, Streaming Algorithms for Extent Problems in High Dimensions,
Algorithmica, vol. 72 no. 1
(May, 2015),
pp. 8398, Springer Nature, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Fox, K; Nath, A; Sidiropoulos, A; Wang, Y, Computing the GromovHausdorff 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. 529540, Springer Berlin Heidelberg, ISSN 03029743 [doi] [abs]
 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. 643648, IEEE, ISBN 9781467369114 [doi] [abs]
 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. 237240, IEEE, ISBN 9781467369114 [doi] [abs]
 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. 226230, IEEE, ISBN 9781467369114 [doi] [abs]
 Agarwal, P, Message from program chair,
Conference Proceeding 2015 International Conference on Advances in Computer Engineering and Applications, Icacea 2015
(January, 2015), IEEE, ISBN 9781467369114 [doi]
 Agarwal, PK; Sharathkumar, R, Streaming Algorithms for Extent Problems in High Dimensions,
Algorithmica, vol. 72 no. 1
(2015),
pp. 8398, ISSN 01784617 [doi] [abs]
 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. 0407November2014
(November, 2014),
pp. 312, ACM Press, ISBN 9781450331319 [doi] [abs]
 Sankararaman, S; Efrat, A; Ramasubramanian, S; Agarwal, PK, On channeldiscontinuityconstraint routing in wireless networks,
Ad Hoc Networks, vol. 13 no. PART A
(February, 2014),
pp. 153169, ISSN 15708705 [doi] [abs]
 Salzman, O; Shaharabani, D; Agarwal, PK; Halperin, D, Sparsification of motionplanning roadmaps by edge contraction,
International Journal of Robotics Research, vol. 33 no. 14
(January, 2014),
pp. 17111725, SAGE Publications, ISSN 02783649 [doi] [abs]
 Agarwal, PK; HarPeled, S; Kaplan, H; Sharir, M, Union of Random Minkowski Sums and Network Vulnerability Analysis,
Discrete & Computational Geometry, vol. 52 no. 3
(January, 2014),
pp. 551582, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Pan, J, Nearlinear algorithms for geometric hitting sets and set covers,
Proceedings of the Annual Symposium on Computational Geometry
(January, 2014),
pp. 271279, ACM Press [doi] [abs]
 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. 555564, ACM Press, ISSN 07378017 [doi] [abs]
 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. 10631066, ACM Press, ISSN 07308078 [doi] [abs]
 Agarwal, PK; HarPeled, 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. 3748, ISSN 03029743, ISBN 9783662447765 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Topk preferences in high dimensions,
Proceedings International Conference on Data Engineering
(January, 2014),
pp. 748759, IEEE, ISSN 10844627 [doi] [abs]
 Wu, Y; Agarwal, PK; Li, C; Yang, J; Yu, C, Toward computational factchecking,
Proceedings of the Vldb Endowment, vol. 7 no. 7
(January, 2014),
pp. 589600, VLDB Endowment, ISSN 21508097 [doi] [abs]
 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. 20392062, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [doi] [abs]
 Sankararaman, S; Agarwal, PK; Mølhave, T; Pan, J; Boedihardjo, AP, Modeldriven matching and segmentation of trajectories,
Gis: Proceedings of the Acm International Symposium on Advances in Geographic Information Systems
(December, 2013),
pp. 234243, ACM Press [doi] [abs]
 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),
pp. 128, Association for Computing Machinery (ACM), ISSN 03625915 [doi] [abs]
 Agarwal, PK; Ben Avraham, R; Sharir, M, The 2center problem in three dimensions,
Computational Geometry, vol. 46 no. 6
(August, 2013),
pp. 734746, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Kaplan, H; Sharir, M, Union of random minkowski sums and network vulnerability analysis,
Proceedings of the Annual Symposium on Computational Geometry
(July, 2013),
pp. 177186 [abs]
 Shaharabani, D; Salzman, O; Agarwal, PK; Halperin, D, Sparsification of motionplanning roadmaps by edge contraction,
2013 Ieee International Conference on Robotics and Automation
(May, 2013), IEEE [1209.4463v1], [doi] [abs]
 Agarwal, PK; Ben Avraham, R; Kaplan, H; Sharir, M, Computing the discrete Fréchet distance in subquadratic time,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. 43 no. 2
(April, 2013),
pp. 156167, Society for Industrial & Applied Mathematics (SIAM) [1204.5333v1], [doi] [abs]
 Agarwal, PK; Arge, L; Govindarajan, S; Yang, J; Yi, K, Efficient external memory structures for rangeaggregate queries,
Computational Geometry, vol. 46 no. 3
(April, 2013),
pp. 358370, Elsevier BV, ISSN 09257721 [doi] [abs]
 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. 15251538, ISSN 10636692 [doi] [abs]
 Agarwal, PK; Aronov, B; van Kreveld, M; Löffler, M; Silveira, RI, Computing Correlation between PiecewiseLinear Functions,
Siam Journal on Computing, vol. 42 no. 5
(January, 2013),
pp. 18671887, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [doi] [abs]
 Agarwal, PK; HarPeled, S; Yu, H, Embeddings of Surfaces, Curves, and Moving Points in Euclidean Space,
Siam Journal on Computing, vol. 42 no. 2
(January, 2013),
pp. 442458, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [Gateway.cgi], [doi]
 Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) Uncertain Skylines,
Theory of Computing Systems, vol. 52 no. 3
(January, 2013),
pp. 342366, Springer Nature, ISSN 14324350 [doi] [abs]
 Lebeck, N; Mølhave, T; Agarwal, PK, Computing highly occluded paths on a terrain,
Proceedings of the 21st Acm Sigspatial International Conference on Advances in Geographic Information Systems Sigspatial'13
(2013),
pp. 1423, ACM Press [doi] [abs]
 Agarwal, PK; Aronov, B; HarPeled, S; Phillips, JM; Yi, K; Zhang, W, Nearest neighbor searching under uncertainty II,
Proceedings of the 32nd Symposium on Principles of Database Systems Pods '13
(2013),
pp. 115126, ACM Press [doi] [abs]
 Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) Uncertain Skylines,
Theory of Computing Systems, vol. 52 no. 3
(2013),
pp. 342366, ISSN 14324350 [doi] [abs]
 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),
pp. 15211529, IEEE, ISSN 0743166X [doi] [abs]
 Agarwal, PK; Matoušek, J; Sharir, M, On range searching with semialgebraic sets II,
Annual Symposium on Foundations of Computer Science (Proceedings), vol. 11 no. 4
(December, 2012),
pp. 420429, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, P; Gupta, R; Maheswari, T; 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. 437443, Springer Berlin Heidelberg, ISBN 9783642356148 [doi] [abs]
 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
(September, 2012),
pp. 14871495, ACM Press [doi] [abs]
 Agarwal, PK; Cheng, SW; Yi, K, Range searching on uncertain data,
Acm Transactions on Algorithms, vol. 8 no. 4
(September, 2012),
pp. 117, Association for Computing Machinery (ACM), ISSN 15496325 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Subscriber assignment for widearea contentbased publish/subscribe,
Ieee Transactions on Knowledge and Data Engineering, vol. 24 no. 10
(August, 2012),
pp. 18331847, Institute of Electrical and Electronics Engineers (IEEE), ISSN 10414347 [doi] [abs]
 Yu, A; Agarwal, PK; Yang, J, Processing a large number of continuous preference topk queries,
Proceedings of the Acm Sigmod International Conference on Management of Data
(June, 2012),
pp. 397408, ACM Press, ISSN 07308078 [doi] [abs]
 Agarwal, PK; Efrat, A; Sankararaman, S; Zhang, W, Nearestneighbor searching under uncertainty,
Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems
(June, 2012),
pp. 225236, ACM Press [doi] [abs]
 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. 2334 [doi] [abs]
 Sharathkumar, R; Agarwal, PK, A nearlinear time εapproximation algorithm for geometric bipartite matching,
Proceedings of the Annual Acm Symposium on Theory of Computing
(June, 2012),
pp. 385394, ACM Press, ISSN 07378017 [doi] [abs]
 Agarwal, PK; Arge, L; Kaplan, H; Molad, E; Tarjan, RE; Yi, K, An optimal dynamic data structure for stabbingsemigroup queries,
Siam Journal on Computing, vol. 41 no. 1
(June, 2012),
pp. 104127, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [doi] [abs]
 Agarwal, PK; Ezra, E; Sharir, M, Nearlinear approximation algorithms for geometric hitting sets,
Algorithmica, vol. 63 no. 12
(June, 2012),
pp. 125, Springer Nature, ISSN 01784617 [doi] [abs]
 Sharathkumar, R; Agarwal, PK, Algorithms for the transportation problem in geometric settings,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(April, 2012),
pp. 306317 [abs]
 Yu, A; Agarwal, PK; Yang, J, Processing and Notifying Range Topk Subscriptions,
2012 Ieee 28th International Conference on Data Engineering
(April, 2012),
pp. 810821, IEEE, ISSN 10844627 [doi] [abs]
 Agarwal, PK; Matoušek, J; Sharir, M, On range searching with semialgebraic sets II,
Annual Symposium on Foundations of Computer Science (Proceedings)
(2012),
pp. 420429, ISSN 02725428 [doi] [abs]
 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
(December, 2011),
pp. 6473, ACM Press [doi] [abs]
 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
(September, 2011), IEEE [doi] [abs]
 Agarwal, PK; Efrat, A; Ganjugunte, S; Hay, D; Sankararaman, S; Zussman, G, The resilience of WDM networks to probabilistic geographical failures,
Proceedings Ieee Infocom, vol. 21 no. 5
(August, 2011),
pp. 15211529, Institute of Electrical and Electronics Engineers (IEEE), ISSN 10636692 [doi] [abs]
 Agarwal, PK; Mølhave, T; Yu, H; Clark, JS, Exploiting temporal coherence in forest dynamics simulation,
Proceedings of the Annual Symposium on Computational Geometry
(July, 2011),
pp. 7786, ACM Press [doi] [abs]
 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. 15231536, ISSN 10510761 [21830699] [abs]
 Yu, A; Agarwal, PK; Yang, J, Subscriber assignment for widearea contentbased publish/subscribe,
Proceedings International Conference on Data Engineering
(June, 2011),
pp. 267278, IEEE, ISSN 10844627 [doi] [abs]
 Abam, MA; Agarwal, PK; De Berg, M; Yu, H, Outoforder event processing in kinetic data structures,
Algorithmica, vol. 60 no. 2
(June, 2011),
pp. 250273, Springer Nature, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Mølhave, T; Sadri, B, I/Oefficieiit contour queries on terrains,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(May, 2011),
pp. 268284 [abs]
 Afshani, P; Agarwal, PK; Arge, L; Larsen, KG; Phillips, JM, (Approximate) uncertain skylines,
Acm International Conference Proceeding Series
(March, 2011),
pp. 186196, ACM Press [doi] [abs]
 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
(December, 2010),
pp. 172181, ACM Press [doi] [abs]
 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
(December, 2010),
pp. 18241829, IEEE [doi] [abs]
 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
(November, 2010),
pp. 487499, Springer Berlin Heidelberg, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Arge, L; Yi, K, I/Oefficient batched unionfind and its applications to terrain analysis,
Acm Transactions on Algorithms, vol. 7 no. 1
(November, 2010),
pp. 121, Association for Computing Machinery (ACM), ISSN 15496325 [doi] [abs]
 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
(October, 2010),
pp. 352390, Springer Nature, ISSN 01784617 [doi] [abs]
 Mølhave, T; Agarwal, PK; Arge, L; Revsbæk, M, Scalable algorithms for large highresolution terrain data,
Acm International Conference Proceeding Series
(August, 2010), ACM Press [doi] [abs]
 Chen, L; Tang, C; Yang, J; Kitsuregawa, M; Li, Q, 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. 6184 LNCS
(August, 2010),
pp. VVI, ISSN 03029743, ISBN 3540290087
 Agarwal, PK; HarPeled, S; Sharir, M; Wang, Y, Hausdorff distance under translation for points and balls,
Acm Transactions on Algorithms, vol. 6 no. 4
(August, 2010),
pp. 126, Association for Computing Machinery (ACM) [doi] [abs]
 Agarwal, PK; Aronov, B; Van Kreveld, M; Löffler, M; Silveira, RI, Computing similarity between piecewiselinear functions,
Proceedings of the Annual Symposium on Computational Geometry
(July, 2010),
pp. 375383, ACM Press [doi] [abs]
 Agarwal, PK, An improved algorithm for computing the volume of the union of cubes,
Proceedings of the Annual Symposium on Computational Geometry
(July, 2010),
pp. 230239, ACM Press [doi] [abs]
 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
(July, 2010),
pp. 127136, ACM Press [doi] [abs]
 Agarwal, PK; BenAvraham, R; Sharir, M, The 2center problem in three dimensions,
Proceedings of the Annual Symposium on Computational Geometry
(July, 2010),
pp. 8796, ACM Press [doi] [abs]
 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
(June, 2010),
pp. 384396, Springer Berlin Heidelberg, ISSN 03029743 [doi] [abs]
 Sankararaman, S; Efrat, A; Ramasubramanian, S; Agarwal, PK, On channeldiscontinuityconstraint routing in wireless networks,
Proceedings Ieee Infocom
(June, 2010), ISSN 0743166X [doi] [abs]
 Agarwal, PK; Sharathkumar, R, Streaming algorithms for extent problems in high dimensions,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(May, 2010),
pp. 1481 [abs]
 Agarwal, PK; Efrat, A; Sharathkumar, R; Yu, H, On approximate geodesicdistance queries amid deforming point clouds,
Springer Tracts in Advanced Robotics, vol. 57
(March, 2010),
pp. 351365, Springer Berlin Heidelberg, ISSN 16107438 [doi] [abs]
 Agarwal, PK; Ezra, E; Sharir, M, Nearlinear approximation algorithms for geometric hitting sets,
Proceedings of the Annual Symposium on Computational Geometry
(December, 2009),
pp. 2332, ACM Press [doi] [abs]
 Agarwal, PK; Cheng, SW; Tao, Y; Yi, K, Indexing uncertain data,
Proceedings of the Acm Sigact Sigmod Sigart Symposium on Principles of Database Systems
(November, 2009),
pp. 137146, ACM Press [doi] [abs]
 Agarwal, PK; Sharathkumar, R; Yu, H, Approximate Euclidean shortest paths amid convex obstacles,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(September, 2009),
pp. 283292 [abs]
 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
(August, 2009),
pp. 301314, Springer Berlin Heidelberg, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Xie, J; Yang, J; Yu, H, Inputsensitive scalable continuous join query processing,
Acm Transactions on Database Systems, vol. 34 no. 3
(August, 2009),
pp. 141, Association for Computing Machinery (ACM), ISSN 03625915 [doi] [abs]
 Agarwal, PK; Phillips, JM, An efficient algorithm for 2D Euclidean 2center with outliers,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5193 LNCS
(December, 2008),
pp. 6475, ISSN 03029743 [doi] [abs]
 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
(December, 2008),
pp. 5263, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Sadri, B; Yu, H, Untangling triangulations through local explorations,
Proceedings of the Annual Symposium on Computational Geometry
(December, 2008),
pp. 288297, ACM Press [doi] [abs]
 Agarwal, PK; Arge, L; Moølhave, T; Sadri, B, I/Oefflcient algorithms for computing contours on a terrain,
Proceedings of the Annual Symposium on Computational Geometry
(December, 2008),
pp. 129138, ACM Press [doi] [abs]
 Chandramouli, B; Yang, J; Agarwal, PK; Yu, A; Zheng, Y, ProSem: Scalable widearea publish/subscribe,
Proceedings of the Acm Sigmod International Conference on Management of Data
(December, 2008),
pp. 13151317, ACM Press, ISSN 07308078 [doi] [abs]
 Yu, H; Agarwal, PK; Poreddy, R; Varadarajan, KR, Practical methods for shape fitting and kinetic data structures using coresets,
Algorithmica, vol. 52 no. 3
(November, 2008),
pp. 378402, Springer Nature, ISSN 01784617 [doi] [abs]
 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
(November, 2008),
pp. 137, Association for Computing Machinery (ACM), ISSN 15496325 [doi] [abs]
 Agarwal, PK; Sharir, M; Welzl, E, Algorithms for center and Tverberg points,
Acm Transactions on Algorithms, vol. 5 no. 1
(November, 2008),
pp. 120, Association for Computing Machinery (ACM), ISSN 15496325 [doi] [abs]
 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. 382386, IEEE, ISBN 0769530508 [doi] [abs]
 Agarwal, PK; Hurtado, F; Toussaint, GT; Trias, J, On polyhedra induced by point sets in space,
Discrete Applied Mathematics, vol. 156 no. 1
(January, 2008),
pp. 4254, Elsevier BV, ISSN 0166218X [doi] [abs]
 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. 13
(January, 2008),
pp. 1737, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; HarPeled, S; Yu, H, Robust shape fitting via peeling and grating coresets,
Discrete & Computational Geometry, vol. 39 no. 13
(January, 2008),
pp. 3858, Springer Nature, ISSN 01795376 [doi] [abs]
 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
(December, 2007),
pp. 212219, ACM Press [doi] [abs]
 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
(December, 2007),
pp. 1, ISSN 03029743 [abs]
 Rizvi, SAM; Agarwal, P, A time efficient algorithm for finding longest common subsequence from two molecular sequences,
Bioengineering, Proceedings of the Northeast Conference
(December, 2007),
pp. 302306, IEEE, ISBN 1424410339 [doi] [abs]
 Agarwal, PK; Kaplan, H; Sharir, M, Computing the volume of the union of cubes,
Proceedings of the Annual Symposium on Computational Geometry
(October, 2007),
pp. 294301, ACM Press [doi] [abs]
 Agarwal, PK; HarPeled, S; Yu, H, Embeddings of surfaces, curves, and moving points in euclidean space,
Proceedings of the Annual Symposium on Computational Geometry
(October, 2007),
pp. 381389, ACM Press [doi] [abs]
 Agarwal, PK; Apfelbaum, R; Purdy, G; Sharir, M, Similar simplices in a ddimensional point set,
Proceedings of the Annual Symposium on Computational Geometry
(October, 2007),
pp. 232238, ACM Press [doi] [abs]
 Zheng, Y; Brady, DJ; Agarwal, PK, Localization using boundary sensors,
Acm Transactions on Sensor Networks, vol. 3 no. 4
(October, 2007),
pp. 21es, Association for Computing Machinery (ACM), ISSN 15504859 [doi] [abs]
 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. 647659 [17594418], [doi] [abs]
 Govindarajan, S; Dietze, MC; Agarwal, PK; Clark, JS, A scalable algorithm for dispersing population,
Journal of Intelligent Information Systems, vol. 29 no. 1
(August, 2007),
pp. 3961, Springer Nature, ISSN 09259902 [doi] [abs]
 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. 131143, ISSN 10665277 [17456012], [doi] [abs]
 Clark, JS; Agarwal, PK, Rejoinder to Clark et al. (2007): Response to Chesson and Rees,
Ecology Letters, vol. 10 no. 8
(January, 2007),
pp. 661662, WILEY, ISSN 1461023X [doi]
 Agarwal, PK; Yu, H, A spaceoptimal datastream algorithm for coresets in the plane,
Proceedings of the Twenty Third Annual Symposium on Computational Geometry Scg '07
(2007),
pp. 110, ACM Press [doi] [abs]
 Flikkema, PG; Agarwal, PK; Clark, JS; Ellis, C; Gelfand, A; Munagala, K; Yang, J, From data reverence to data relevance: Modelmediated 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. 988994, ISSN 03029743 [abs]
 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. 771788 [doi] [abs]
 Agarwal, PK; Overmars, M; Sharir, M, Computing maximally separated sets in the plane,
Siam Journal on Computing, vol. 36 no. 3
(December, 2006),
pp. 815834, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [doi] [abs]
 Agarwal, PK; Xie, J; Yang, J; Yu, H, Scalable continuous query processing by tracking hotspots, edited by Dayal, U; Whang, KY; Lomet, DB; Alonso, G; Lohman, GM; Kersten, ML; Cha, SK; Kim, YK,
Vldb 2006 Proceedings of the 32nd International Conference on Very Large Data Bases
(December, 2006),
pp. 3142, ACM, ISBN 1595933859 [citation.cfm] [abs]
 Rizvi, SAM; Agarwal, P, A new bucketbased algorithm for finding LCS from two given molecular sequences,
Proceedings Third International Conference Oninformation Technology: New Generations, Itng 2006, vol. 2006
(November, 2006),
pp. 560561, IEEE, ISBN 0769524974 [doi] [abs]
 Agarwal, PK; Brady, D; Matoušek, J, Segmenting object space by geometric reference structures,
Acm Transactions on Sensor Networks, vol. 2 no. 4
(November, 2006),
pp. 455465, Association for Computing Machinery (ACM), ISSN 15504859 [doi] [abs]
 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. 408422, ISSN 15455963 [17085849], [doi] [abs]
 Agarwal, PK; Arge, L; Yi, K, I/Oefficient batched unionfind and its applications to terrain analysis,
Proceedings of the Annual Symposium on Computational Geometry, vol. 2006
(September, 2006),
pp. 167176 [abs]
 Agarwal, PK; Aronov, B; Koltun, V, Efficient algorithms for bichromatic separability,
Acm Transactions on Algorithms, vol. 2 no. 2
(August, 2006),
pp. 209227, Association for Computing Machinery (ACM), ISSN 15496325 [doi] [abs]
 Agarwal, PK; Mustafa, NH, Independent set of intersection graphs of convex objects in 2D,
Computational Geometry, vol. 34 no. 2
(May, 2006),
pp. 8395, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, PK; HarPeled, S; Yu, H, Robust shape fitting via peeling and grating coresets,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(February, 2006),
pp. 182191, ACM Press [doi] [abs]
 Flikkema, PG; Agarwal, PK; Clark, JS; Ellis, C; Gelfand, A; Munagala, K; Yang, J, Modeldriven 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
(January, 2006),
pp. 409416, Springer Berlin Heidelberg, ISSN 03029743 [doi] [abs]
 Phillips, JM; Rudolph, J; Agarwal, PK, Segmenting motifs in proteinprotein interface surfaces,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4175 LNBI
(January, 2006),
pp. 207218, ISSN 03029743 [abs]
 Abam, MA; Agarwal, PK; De Berg, M; Yu, H, Outoforder 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
(January, 2006),
pp. 624635, ISSN 03029743 [abs]
 Yu, H, A twodimensional kinetic triangulation with nearquadratic topological changes,
Discrete & Computational Geometry, vol. 36 no. 4
(January, 2006),
pp. 573592, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Edelsbrunner, H; Harer, J; Wang, Y, Extreme elevation on a 2manifold,
Discrete & Computational Geometry, vol. 36 no. 4
(January, 2006),
pp. 553572, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Cabello, S; Sellarès, JA; Sharir, M, Computing a centertransversal line, edited by ArunKumar, S; Garg, N,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4337 LNCS
(January, 2006),
pp. 93104, SPRINGER, ISBN 9783540499947 [doi] [abs]
 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
(December, 2005),
pp. 346355, ACM Press [doi] [abs]
 Agarwal, PK; Xie, J; Yang, J; Yu, H, Monitoring continuous bandjoin queries over dynamic data,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3827 LNCS
(December, 2005),
pp. 349359, Springer Berlin Heidelberg, ISSN 03029743 [doi] [abs]
 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
(December, 2005),
pp. 315327, Springer Berlin Heidelberg, ISSN 03029743 [doi] [abs]
 Agarwal, PK; Arge, L; Yi, K, I/Oefficient construction of constrained delaunay triangulations,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3669
(October, 2005),
pp. 355366, ISSN 03029743 [abs]
 Agarwal, PK; Wang, Y; Yin, P, Lower bound for sparse Euclidean spanners,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(July, 2005),
pp. 670671 [abs]
 Agarwal, PK; HarPeled, S; Mustafa, NH; Wang, Y, Nearlinear time approximation algorithms for curve simplification,
Algorithmica, vol. 42 no. 34
(June, 2005),
pp. 203219, Springer Nature [doi] [abs]
 Agarwal, PK; Sharir, M, PseudoLine Arrangements: Duality, Algorithms, and Applications,
Siam Journal on Computing, vol. 34 no. 3
(January, 2005),
pp. 526552, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [doi] [abs]
 Agarwal, PK; Berretty, RP; Collins, AD, A nearquadratic algorithm for fence design,
Discrete & Computational Geometry, vol. 33 no. 3
(January, 2005),
pp. 463481, Springer Nature [doi] [abs]
 Agarwal, PK; Aronov, B; Koltun, V; Sharir, M, Lines avoiding unit balls in three dimensions,
Discrete & Computational Geometry, vol. 34 no. 2
(January, 2005),
pp. 231250, Springer Nature [doi] [abs]
 Wang, Y; Agarwal, PK; Brown, P; Edelsbrunner, H; Rudolph, J, Coarse and reliable geometric alignment for protein docking.
(2005),
pp. 6475, ISSN 23356936 [15759614] [abs]
 Agarwal, PK; Arge, L; Yi, K, An optimal dynamic interval stabbingmax data structure?,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2005),
pp. 803812 [abs]
 Agarwal, PK; Procopiuc, CM; Varadarajan, KR, Approximation algorithms for a kline center,
Algorithmica (New York), vol. 42 no. 34
(2005),
pp. 221230 [doi] [abs]
 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
(December, 2004),
pp. 218229, ISSN 03029743 [abs]
 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
(December, 2004),
pp. 127137, ISSN 03029743 [abs]
 Agarwal, PK; Berretty, RP; Collins, AD, A nearquadratic algorithm for fence design,
Springer Tracts in Advanced Robotics, vol. 7 STAR
(December, 2004),
pp. 347362, Springer Berlin Heidelberg, ISSN 16107438 [doi] [abs]
 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
(December, 2004),
pp. 415, ISSN 03029743 [abs]
 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
(September, 2004),
pp. 263272 [abs]
 Agarwal, PK; Edelsbrunner, H; Harer, J; Wang, Y, Extreme elevation on a 2manifold,
Proceedings of the Annual Symposium on Computational Geometry
(September, 2004),
pp. 357365 [abs]
 Govindarajan, S; Dietze, M; Agarwal, PK; Clark, JS, A scalable simulator for forest dynamics,
Proceedings of the Annual Symposium on Computational Geometry
(September, 2004),
pp. 106115 [abs]
 Agarwal, PK; Aronov, B; Koltun, V; Sharir, M, On lines avoiding unit balls in three dimensions,
Proceedings of the Annual Symposium on Computational Geometry
(September, 2004),
pp. 3645 [abs]
 Agarwal, PK; Varadarajan, KR, A nearlinear constantfactor approximation for euclidean bipartite matching?,
Proceedings of the Annual Symposium on Computational Geometry
(September, 2004),
pp. 247252 [abs]
 Agarwal, PK; Sharir, M; Welzl, E, Algorithms for center and tverberg points,
Proceedings of the Annual Symposium on Computational Geometry
(September, 2004),
pp. 6167 [abs]
 Agarwal, PK; Wang, Y; Yu, H, A 2D kinetic triangulation with nearquadratic topological changes,
Proceedings of the Annual Symposium on Computational Geometry
(September, 2004),
pp. 180189 [abs]
 Agarwal, PK; HarPeled, S; Varadarajan, KR, Approximating extent measures of points,
Journal of the Acm, vol. 51 no. 4
(July, 2004),
pp. 606635, Association for Computing Machinery (ACM), ISSN 00045411 [doi] [abs]
 Agarwal, P; Guibas, L; Nguyen, A; Russel, D; Zhang, L, Collision detection for deforming necklaces,
Computational Geometry, vol. 28 no. 23 SPEC. ISS.
(June, 2004),
pp. 137163, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Aronov, B; Koltun, V, Efficient Algorithms for Bichromatic Separability,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. 15
(April, 2004),
pp. 675683 [abs]
 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
(April, 2004),
pp. 509518 [abs]
 Agarwal, PK; Nevo, E; Pach, J; Pinchasi, R; Sharir, M; Smorodinsky, S, Lenses in arrangements of pseudocircles and their applications,
Journal of the Acm, vol. 51 no. 2
(March, 2004),
pp. 139186, Association for Computing Machinery (ACM), ISSN 00045411 [doi] [abs]
 Agarwal, PK; Edelsbrunner, H; Wang, Y, Computing the writhing number of a polygonal knot,
Discrete & Computational Geometry, vol. 32 no. 1
(January, 2004),
pp. 3753, Springer Nature [doi] [abs]
 P.K. Agarwal,, Reporting all intersecting pairs of polytopes in two and three dimensions
(2004) [abs]
 Agarwal, PK; Mustafa, NH, Kmeans projective clustering,
Proceedings of the ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, vol. 23
(2004),
pp. 155165 [abs]
 Collins, AD; Agarwal, PK; Harer, JL, HPRM: A hierarchical PRM,
Proceedings Ieee International Conference on Robotics and Automation, vol. 3
(December, 2003),
pp. 44334438 [abs]
 Agarwal, PK; Arge, L; Yang, J; Yi, K, I/Oefficient structures for orthogonal rangemax and stabbingmax queries,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2832
(December, 2003),
pp. 718, ISSN 03029743 [abs]
 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
(December, 2003),
pp. 544555, ISSN 03029743 [abs]
 Govindarajan, S; Agarwal, PK; Arge, L, CRBtree: An efficient indexing scheme for rangeaggregate queries,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2572
(December, 2003),
pp. 143157, ISSN 03029743 [abs]
 Agarwal, PK; Procopiuc, CM; Varadarajan, KR, A (1+ε)approximation algorithm for 2linecenter,
Computational Geometry, vol. 26 no. 2
(October, 2003),
pp. 119128, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, PK; HarPeled, S; Sharir, M; Wang, Y, Hausdorff distance under translation for points and balls,
Proceedings of the Annual Symposium on Computational Geometry, vol. 6 no. 4
(July, 2003),
pp. 282291, ISSN 15496325 [doi] [abs]
 Agarwal, PK; Arge, L; Danner, A; HollandMinkley, B, Cacheoblivious data structures for orthogonal range searching,
Proceedings of the Annual Symposium on Computational Geometry
(July, 2003),
pp. 237245 [abs]
 Agarwal, PK; Arge, L, Editorial,
Computational Geometry, vol. 24 no. 2
(February, 2003),
pp. 49, Elsevier BV, ISSN 09257721 [doi]
 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
(September, 2002),
pp. 418427, ISSN 07308078 [abs]
 Agarwal, PK; Basch, J; Guibas, LJ; Hershberger, J; Zhang, L, Deformable freespace tilings for kinetic collision detection,
International Journal of Robotics Research, vol. 21 no. 3
(March, 2002),
pp. 179197, SAGE Publications [doi] [abs]
 Agarwal, PK; Hagerup, T; Ray, R; Sharir, M; Smid, M; 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,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461
(2002),
pp. 4253, SPRINGER, ISBN 3540441808 (submitted for publication.) [html], [doi] [abs]
 Agarwal, PK; Bhattacharya, BK; Sen, S, Improved algorithms for uniform partitions of points,
Algorithmica, vol. 32 no. 4
(January, 2002),
pp. 521539, Springer Nature [doi] [abs]
 Agarwal, PK; De Berg, M; HarPeled, S; Overmars, MH; Sharir, M; Vahrenhold, J, Reporting intersecting pairs of convex polytopes in two and three dimensions,
Computational Geometry, vol. 23 no. 2
(January, 2002),
pp. 195207, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Sharir, M, The number of congruent simplices in a point set,
Discrete & Computational Geometry, vol. 28 no. 2
(January, 2002),
pp. 123150, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Flato, E; Halperin, D, Polygon decomposition for efficient construction of Minkowski sums,
Computational Geometry, vol. 21 no. 12
(January, 2002),
pp. 3961, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, P; Nevo, E; Pach, J; Pinchasi, R; Smorodinsky, S, Lenses in arrangements of pseudocircles and their applications,
Proceedings of the Annual Symposium on Computational Geometry
(January, 2002),
pp. 123132 [abs]
 Agarwal, PK; HarPeled, S; Mustafa, NH; Wang, Y, Nearlinear time approximation algorithms for curve simplification, edited by Möhring, RH; Raman, R,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461
(January, 2002),
pp. 2941, SPRINGER, ISBN 3540441808 [html], [doi] [abs]
 Procopiuc, CM; Agarwal, PK; HarPeled, S, Startree: An efficient selfadjusting index for moving objects, edited by Mount, DM; Stein, C,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2409
(January, 2002),
pp. 178193, SPRINGER, ISBN 3540439773 [html], [doi] [abs]
 Agarwal, PK; Govindarajan, S; Muthukrishnan, S, Range searching in categorical data: Colored range searching on grid, edited by Möhring, RH; Raman, R,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461
(January, 2002),
pp. 1728, SPRINGER, ISBN 3540441808 [html], [doi] [abs]
 Agarwal, PK; Gao, J; Guibas, LJ, Kinetic medians and kdtrees, edited by Möhring, RH; Raman, R,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461
(January, 2002),
pp. 517, SPRINGER, ISBN 3540441808 [html], [doi] [abs]
 Agarwal, PK; Procopiuc, CM; Varadarajan, KR, Approximation algorithms for kline center, edited by Möhring, RH; Raman, R,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2461
(January, 2002),
pp. 5463, SPRINGER, ISBN 3540441808 [html], [doi] [abs]
 Agarwal, PK; Sharir, M, Pseudoline arrangements: Duality, algorithms, and applications,
in Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, edited by Eppstein, D,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. 0608January2002
(2002),
pp. 800809, ACM/SIAM, ISBN 089871513X [citation.cfm] [abs]
 P.K. Agarwal, C. M. Procopiuc, and S. HarPeled, STARtree: An efficent selfadjusting index for moving points,
in Fourth Workshop on Algorithms Engineering and Experiments
(2002)
 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)
 Agarwal, PK; Edelsbrunner, H; Wang, Y, Computing the writhing number of a polygonal knot.,
in Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, edited by Eppstein, D,
SODA
(2002),
pp. 791799, ACM/SIAM, ISBN 089871513X [citation.cfm]
 Agarwal, PK; Arge, L; Procopiuc, O; Vittery, JS, A framework for index bulk loading and dynamization,
in TwentyEighth International Colloquium on Automata, Languages, and Programming, edited by Orejas, F; Spirakis, PG; Leeuwen, JV,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2076 LNCS
(2001),
pp. 115127, SPRINGER, ISBN 3540422870 [html], [doi] [abs]
 Agarwal, PK; Sharir, M, On the number of congruent simplices in a point set,
Proceedings of the Annual Symposium on Computational Geometry
(January, 2001),
pp. 19 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Exact and approximation algorithms for minimumwidth cylindrical shells,
Discrete & Computational Geometry, vol. 26 no. 3
(January, 2001),
pp. 307320, Springer Nature [doi] [abs]
 Agarwal, PK; Guibas, LJ; Hershberger, J; Veach, E, Maintaining the extent of a moving point set,
Discrete & Computational Geometry, vol. 26 no. 3
(January, 2001),
pp. 353374, Springer Nature [doi] [abs]
 Agarwal, PK; De Berg, M; Gudmundsson, J; Hammar, M; Haverkort, HJ, Boxtrees and Rtrees with nearoptimal query time,
in Seventeenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(2001),
pp. 124133 [abs]
 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. 22432248, IEEE [doi] [abs]
 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. 7483, IEEE Comput. Soc [doi] [abs]
 Agarwal, PK; Arge, L; Vahrenhold, J, Time responsive external data structures for moving points, edited by Dehne, FKHA; Sack, JR; Tamassia, R,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2125
(January, 2001),
pp. 5061, Springer Berlin Heidelberg, ISBN 3540424237 [html], [doi] [abs]
 Agarwal, PK; de Berg, M; HarPeled, S; Overmars, MH; Sharir, M; Vahrenhold, J, Reporting intersecting pairs of polytopes in two and three dimensions, edited by Dehne, FKHA; Sack, JR; Tamassia, R,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2125
(January, 2001),
pp. 122134, Springer Berlin Heidelberg, ISBN 3540424237 [html], [doi] [abs]
 L. Guibas, J. Hershberger, E. Veach, and P.K. Agarwal, Maintaining structures for moving points,
Discrete and Computational Geometry, vol. 26
(2001),
pp. 253374
 K. R. Varadarajan and P.K. Agarwal, Approximating shortest paths on polyhedral terrains,
SIAM Journal on Computing, vol. 30
(2001),
pp. 13211340
 H. Wang and P.K. Agarwal, Approximation algorithms for shortest paths with bounded curvature,
SIAM Journal on Computing, vol. 30
(2001),
pp. 17391772
 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. 8396, A.K. Peters, Natick, MA,
 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. 151201, Kluwar Academic Press, The Netherlands
 P.K. Agarwal, L. Arge and J. Vahrenhold, Time responsive indexing schemes for moving points,
in Seventh Workshop on Algorithms and Data Structures
(2001)
 P.K. Agarwal, D. Halperin, and R. Pollack, Guest editors' foreword,
Discrete and Computational Geometry, vol. 25
(2001),
pp. 505506
 P.K. Agarwal, Guest editors' foreword,
Discrete and Computational Geometry, vol. 26
(2001),
pp. 185186
 P.K. Agarwal, On the numbers of congruent simplices in a point set,
in Seventeenth Annual Symposium on Computational Geometry
(2001)
 P.K. Agarwal, M. de Berg, S. HarPeled, 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)
 P.K. Agarwal, S. HarPeled, and Y.Wang, Occlusion culling for fast walkthrough in urban areas,
in Eurographics
(2001)
 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)
 Agarwal, PK; HalPeled, S, Maintaining approximate extent measures of moving points,
in Twelfth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2001),
pp. 148157 [abs]
 Agarwal, PK; Wanq, H, Approximation algorithms for curvatureconstrained shortest paths,
Siam Journal on Computing, vol. 30 no. 6
(December, 2000),
pp. 17391772, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [doi] [abs]
 Agarwal, PK; Grove, EF; Murali, TM; Vitter, JS, Binary space partitions for fat rectangles,
Siam Journal on Computing, vol. 29 no. 5
(March, 2000),
pp. 14221448, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Basch, J; de Berg, M; L. J. Guibas, ; Hershberger, J, Lower Bounds for Kinetic Planar Subdivisions,
Discrete & Computational Geometry, vol. 24 no. 4
(January, 2000),
pp. 721733, Springer Nature [doi]
 Varadarajan, KR; Agarwal, PK, Approximating shortest paths on a nonconvex polyhedron,
Siam Journal on Computing, vol. 30 no. 4
(January, 2000),
pp. 13211340, Society for Industrial & Applied Mathematics (SIAM), ISSN 00975397 [doi] [abs]
 Agarwal, PK; Varadarajan, KR, Efficient algorithms for approximating polygonal chains,
Discrete & Computational Geometry, vol. 23 no. 2
(January, 2000),
pp. 273291, Springer Nature [doi] [abs]
 Agarwal, PK; Guibas, LJ; Murali, TM; Vitter, JS, Cylindrical static and kinetic binary space partitions,
Computational Geometry, vol. 16 no. 2
(January, 2000),
pp. 103127, Elsevier BV [doi] [abs]
 Agarwal, PK; Sharir, M, Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions,
Discrete & Computational Geometry, vol. 24 no. 4
(January, 2000),
pp. 645685, Springer Nature [doi] [abs]
 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
(January, 2000),
pp. 194216, Elsevier BV [doi] [abs]
 Agarwal, PK; Aronov, B; HarPeled, S; Sharir, M, Approximation Algorithms for MinimumWidth Annuli and Shells,
Discrete & Computational Geometry, vol. 24 no. 4
(January, 2000),
pp. 687705, Springer Nature [doi] [abs]
 Agarwal, PK; Flato, E; Halperin, D, Polygon decomposition for efficient construction of Minkowski sums,
in Eighth European Symposium on Algorithms, edited by Paterson, M,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1879
(2000),
pp. 2031, SPRINGER, ISBN 354041004X [html], [doi] [abs]
 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. 175186 [abs]
 Agarwal, PK; HarPeled, 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. 270279 [abs]
 Agarwal, PK; Procopiuc, CM, Approximation algorithms for projective clustering,
in Eleventh Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(2000),
pp. 538547 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Exact and approximation algorithms for minimumwidth cylindrical shells,
in Eleventh Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(2000),
pp. 510517 [abs]
 Agarwal, PK; Guibas, LJ; HarPeled, 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. 328338, Springer Berlin Heidelberg, ISSN 03029743, ISBN 3540676902 [doi] [abs]
 L. J. Guibas, S. HarPeled, 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. 227240
 B. Aronov, S. HarPeled, 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. 687705
 M. Sharir and P.K. Agarwal, DavenportSchinzel sequences and their geometric applications,
in Handbook of Computational Geometry, edited by J.R. Sack and J. Urrutia
(2000),
pp. 147, NorthHolland, New York
 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. 49119, NorthHolland, New York
 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. 147159, Taylor and Francis, London
 K. R. Varadarajan and P.K. Agarwal, Efficient algorithms for polygon simplification,
Discrete and Computational Geometry, vol. 23
(2000),
pp. 273291
 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)
 Agarwal, PK; Desikan, PK, Approximation algorithms for layered manufacturing,
in Eleventh Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(2000),
pp. 528537 [abs]
 Agarwal, PK; Efrat, A; Sharir, M, Vertical decomposition of shallow levels in 3dimensional arrangements and its applications,
Siam Journal on Computing, vol. 29 no. 3
(December, 1999),
pp. 912953, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Aronov, B; HarPeled, S; Sharir, M, Approximation and exact algorithms for minimumwidth annuli and shells,
Proceedings of the Annual Symposium on Computational Geometry
(January, 1999),
pp. 380389 [abs]
 Agarwal, PK; Arge, L; Brodal, GS; Vitter, JS, I/Oefficient dynamic point location in monotone planar subdivisions,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(January, 1999),
pp. 1120 [abs]
 Agarwal, PK; O'Rourke, J, Open Problems Presented at SCG'98,
Journal of Algorithms, vol. 30 no. 2
(1999),
pp. 449453, Elsevier BV [doi] [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Line transversals of balls and smallest enclosing cylinders in three dimensions,
Discrete & Computational Geometry, vol. 21 no. 3
(January, 1999),
pp. 373388, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Motion planning for a convex polygon in a polygonal environment,
Discrete & Computational Geometry, vol. 22 no. 2
(January, 1999),
pp. 201221, Springer Nature, ISSN 01795376 [doi] [abs]
 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. 143153 [abs]
 Agarwal, PK; Basch, J; de Berg, M; 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. 247254 [abs]
 Varadarajan, KR; Agarwal, PK, Approximation algorithms for bipartite and nonbipartite matching in the plane,
in Tenth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(1999),
pp. 805814 [abs]
 Agarwal, PK; Sharir, M, Motion planning of a ball amid segments in three dimensions,
in Tenth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(1999),
pp. 2130 [abs]
 Agarwal, PK; Bhattacharya, BK; Sen, S, Outputsensitive 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. 403414, Springer Berlin Heidelberg, ISBN 3540669167 [html], [doi] [abs]
 P.K. Agarwal, L. Arge, G. Brodal, and J. S. Vitter, I/Oefficient dynamic point location in monotone subdivisions,
in Tenth Annual ACMSIAM Symposium on Discrete Algorithms
(1999)
 P.K. Agarwal and S. A. Cook, Guest editors' foreword,
Journal of Computer and Systems Sciences, vol. 58
(1999),
pp. 259
 P.K. Agarwal, Guest editors' foreword,
International Journal of Computational Geometry and Applications, vol. 9
(1999),
pp. 325
 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.)
 P.K. Agarwal, B. Aronov, S. HarPeled, and M. Sharir, Exact and approximation algorithms for the minimum width annuli and shells,
in Fifteenth Annual Symposium on Computational Geometry
(1999)
 Agarwal, PK; O'Rourke, J, Computational geometry column 34,
International Journal of Computational Geometry & Applications, vol. 8 no. 56
(1998),
pp. 637642, World Scientific Pub Co Pte Lt (Also appeared in SIGACT News, 29 (1998), 27
33.) [doi] [abs]
 Agarwal, PK; Sharir, M, Efficient Algorithms for Geometric Optimization,
Acm Computing Surveys, vol. 30 no. 4
(December, 1998),
pp. 412458, ISSN 03600300 [doi] [abs]
 Agarwal, PK; Procopiuc, CM, Exact and approximation algorithms for clustering,
in Ninth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(1998),
pp. 658667 [abs]
 Agarwal, PK; Erickson, J; Guibas, LJ, Kinetic binary space partitions for intersecting segments and disjoint triangles,
in Ninth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(1998),
pp. 107116 [abs]
 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. 596605, IEEE Comput. Soc [doi] [abs]
 Agarwal, PK; Sharir, M; Welzl, E, The discrete 2center problem,
Discrete & Computational Geometry, vol. 20 no. 3
(January, 1998),
pp. 287305, Springer Nature, ISSN 01795376 [doi] [abs]
 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
(January, 1998),
pp. 315331, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Van Kreveld, M; Suri, S, Label placement by maximum independent set in rectangles,
Computational Geometry, vol. 11 no. 34
(January, 1998),
pp. 209218, Elsevier BV [doi] [abs]
 Agarwal, PK; Matoušek, J; Schwarzkopf, O, Computing many faces in arrangements of lines and segments,
Siam Journal on Computing, vol. 27 no. 2
(January, 1998),
pp. 491505, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK, Surface approximation and geometric partitions,
Siam Journal on Computing, vol. 27 no. 4
(January, 1998),
pp. 10161035, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; De Berg, M; Matoušek, J; Schwarzkopf, O, Constructing Levels in Arrangements and Higher Order Voronoi Diagrams,
Siam Journal on Computing, vol. 27 no. 3
(January, 1998),
pp. 654667, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Amenta, N; Sharir, M, Largest placement of one convex polygon inside another,
Discrete & Computational Geometry, vol. 19 no. 1
(January, 1998),
pp. 95104, Springer Nature, ISSN 01795376 [doi] [abs]
 Murali, TM; Agarwal, PK; Vitter, JS, Constructing binary space partitions for orthogonal rectangles in practice, edited by Bilardi, G; Italiano, GF; Pietracaprina, A; Pucci, G,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1461 LNCS
(January, 1998),
pp. 211222, SPRINGER, ISBN 3540648488 [html], [doi] [abs]
 Agarwal, PK; Biedl, T; Lazard, S; Robbins, S; Suri, S; Whitesides, S, Curvatureconstrained shortest paths in a convex polygon,
in Fourteenth Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry
(1998),
pp. 392401 [abs]
 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. 169178 [abs]
 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. 156, American Mathematical Society, Providence
 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)
 Agarwal, PK; Arge, L; Murali, TM; Varadarajan, KR; Vitter, JS, I/Oefficient algorithms for contourline extraction and planar graph blocking,
in Ninth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual ACMSIAM Symposium on Discrete Algorithms
(1998),
pp. 117126 [abs]
 Varadarajan, KR; Agarwal, PK, Approximating shortest paths on a nonconvex polyhedron,
Annual Symposium on Foundations of Computer Science (Proceedings)
(December, 1997),
pp. 182191, IEEE Comput. Soc [doi] [abs]
 Varadarajan, KR; Agarwal, PK, Linear approximation of simple objects,
Information Processing Letters, vol. 62 no. 2
(April, 1997),
pp. 8994, Elsevier BV [doi] [abs]
 Agarwal, PK; Murali, TM; Vitter, JS, Practical techniques for constructing Binary Space Partitions for orthogonal rectangles,
Proceedings of the Annual Symposium on Computational Geometry
(January, 1997),
pp. 382384 [abs]
 Agarwal, PK; Guibas, LJ; Murali, TM; Vitter, JS, Cylindrical static and kinetic binary space partitions,
Proceedings of the Annual Symposium on Computational Geometry
(January, 1997),
pp. 3948 [abs]
 Agarwal, PK; Desikan, PK, Efficient algorithm for terrain simplification,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(January, 1997),
pp. 139147 [abs]
 Agarwal, PK; Aronov, B; Pach, J; Pollack, R; Sharir, M, Quasiplanar graphs have a linear number of edges,
Combinatorica, vol. 17 no. 1
(January, 1997),
pp. 19, Springer Nature [doi] [abs]
 Agarwal, PK; HarPeled, S; Sharir, M; Varadarajan, KR, Approximating shortest paths on a convex polytope in three dimensions,
Journal of the Acm, vol. 44 no. 4
(January, 1997),
pp. 567584, Association for Computing Machinery (ACM) [doi] [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Computing envelopes in four dimensions with applications,
Siam Journal on Computing, vol. 26 no. 6
(January, 1997),
pp. 17141732, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Aronov, B; O'Rourke, J; Schevon, CA, Star unfolding of a polytope with applications,
Siam Journal on Computing, vol. 26 no. 6
(January, 1997),
pp. 16891713, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Latombe, JC; 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. 31243129 (Also appears in the abstracts of the First
CGC Workshop on Computational Geometry.) [abs]
 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. 3038 [abs]
 Agarwal, PK; Aronov, B; Sharir, M, Line transversals of balls and smallest enclosing cylinders in three dimensions,
in Eighth Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(1997),
pp. 483492 [abs]
 Agarwal, PK; Guibas, LJ; Hershberger, J; Veach, E, Maintaining the extent of a moving point set, edited by Dehne, FKHA; RauChaplin, A; Sack, JR; Tamassia, R,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1272
(January, 1997),
pp. 3144, SPRINGER, ISBN 3540633073 [html], [doi] [abs]
 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. 143154, edited by J.P. Laumond and M. Overmars
(1997), A. K. Peters, Wellesley
 P.K. Agarwal, Range searching,
in CRC Handbook of Discrete and Computational Geometry, edited by J. Goodman and J. O'Rourke
(1997),
pp. 575598, CRC Press, NewYork
 P.K. Agarwal and P. K. Desikan, Fast algorithms for surface simplication and other related problems,
in Eighth Annual ACMSIAM Symposium on Discrete Algorithms
(1997)
 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)
 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)
 P.K. Agarwal, M. Sharir, and E. Welzl, The discrete 2center problem,
in Thirteenth Annual Symposium on Computational Geometry
(1997)
 P.K. Agarwal, L. Guibas, J. Hershberger, and E. Veach, Maintaining structures for moving points,
in Fifth Workshop on Algorithms and Data Structures
(1997)
 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)
 P.K. Agarwal and K. R. Varadarajan, Approximating shortest paths on polyhedral terrains,
in Thirty Eighth Annual Symposium on Foundations of Computer Science
(1997)
 Agarwal, PK; Sharir, M; Welzl, E, Discrete 2center problem,
Proceedings of the Annual Symposium on Computational Geometry
(1997),
pp. 147155 [abs]
 Frey, HC; Agarwal, P, Probabilistic modeling and optimization of clean coal technologies: case studies of the externallyfired combined cycle,
Proceedings of the Air &Amp; Waste Management Association'S Annual Meeting &Amp; Exhibition
(December, 1996),
pp. 16pp [abs]
 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. 482491, IEEE Comput. Soc. Press [doi] [abs]
 Cohen, J; Varshney, A; Manocha, D; Turk, G; Weber, H; Agarwal, P; Brooks, F; Wright, W, Simplification envelopes,
in SIGGRAPH,
Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, Siggraph 1996
(1996),
pp. 119128, ACM Press [doi] [abs]
 Agarwal, PK; De Berg, M; Halperin, D; Sharir, M, Efficient generation of kdirectional assembly sequences, edited by Tardos, É,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129447
(January, 1996),
pp. 122131, ACM/SIAM, ISBN 0898713668 [abs]
 Wang, H; Agarwal, PK, Approximation algorithms for curvatureconstrained shortest paths, edited by Tardos, É,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129447
(January, 1996),
pp. 409418, ACM/SIAM, ISBN 0898713668 [abs]
 Frey, HC; Agarwal, P, Probabilistic analysis and optimization of new power generation technologies: a case study for the externallyfired combined cycle,
Proceedings of the American Power Conference, vol. 1
(January, 1996),
pp. 5257 [abs]
 Agarwal, PK; Van Kreveld, M, Connected Component and Simple Polygon Intersection Searching,
Algorithmica, vol. 15 no. 6
(January, 1996),
pp. 626660, Springer Nature [doi] [abs]
 Agarwal, PK; Schwarzkopf, O; Sharir, M, The overlay of lower envelopes and its applications,
Discrete & Computational Geometry, vol. 15 no. 1
(January, 1996),
pp. 113, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Sharir, M, Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions,
Siam Journal on Computing, vol. 25 no. 1
(January, 1996),
pp. 100116, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Sen, S, Selection in Monotone Matrices and Computing kth Nearest Neighbors,
Journal of Algorithms, vol. 20 no. 3
(January, 1996),
pp. 581601, Elsevier BV [doi] [abs]
 Agarwal, PK; Sharir, M, Ray Shooting Amidst Convex Polygons in 2D,
Journal of Algorithms, vol. 21 no. 3
(January, 1996),
pp. 508519, Elsevier BV [doi] [abs]
 Agarwal, PK; Sharir, M, Efficient randomized algorithms for some geometric optimization problems,
Discrete & Computational Geometry, vol. 16 no. 4
(January, 1996),
pp. 317337, Springer Nature, ISSN 01795376 [doi] [abs]
 Tamassia, R; Agarwal, PK; Amato, N; Chen, DZ; Dobkin, D; Drysdale, S; Fortune, S; Goodrich, MT; Hershberger, J; O'Rourke, J; Preparata, FP; Sack, JR; Suri, S; Tollis, I; Vitter, JS; Whitesides, S, Strategic directions in computational geometry,
Acm Computing Surveys, vol. 28 no. 4
(1996),
pp. 591606, Association for Computing Machinery (ACM) [doi]
 Agarwal, PK; Aronov, B; Pach, J; Pollack, R; Sharir, M, Quasiplanar graphs have a linear number of edges,
in Symposium on Graph Drawing, edited by Brandenburg, FJ,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1027
(1995),
pp. 17, SPRINGER, ISBN 3540607234 [html], [doi] [abs]
 P.K. Agarwal and H. Wang, Approximation algorithms for shortest paths with bounded curvature,
in Seventh Annual ACMSIAM Symposium on Discrete Algorithms
(1996)
 P.K. Agarwal and S. Suri, Simple and practical geometric algorithms,
ACM Computing Surveys, vol. 28
(1996)
 P.K. Agarwal and S. Suri, Simple and practical geometric algorithms,
ACM Computing Surveys, vol. 28
(1996)
 P.K. Agarwal, M. de Berg, D. Halperin, and M. Sharir, Computing depth orders in multiple directions,
in Seventh Annual ACMSIAM Symposium on Discrete Algorithms
(1996)
 P.K. Agarwal and H. Wang, Approximation algorithms for shortest paths with bounded curvature,
in Seventh Annual ACMSIAM Symposium on Discrete Algorithms
(1996)
 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)
 Agarwal, PK; Schwarzkopf, O; Sharir, M, The overlay of lower envelopes in three dimensions and its applications, edited by Snoeyink, J,
Proceedings of the Annual Symposium on Computational Geometry, vol. Part F129372
(September, 1995),
pp. 182189, ACM Press, ISBN 0897917243 [doi] [abs]
 Agarwal, PK; Efrat, A; Sharir, M, Vertical decomposition of shallow levels in 3dimensional arrangements and its applications,
in Eleventh Annual Symposium on Computational Geometry, edited by Snoeyink, J,
Proceedings of the Annual Symposium on Computational Geometry, vol. Part F129372
(1995),
pp. 3950, ACM Press, ISBN 0897917243 [doi] [abs]
 Agarwal, PK; Aronov, B; Suri, S, Stabbing triangulations by lines in 3D, edited by Snoeyink, J,
Proceedings of the Annual Symposium on Computational Geometry, vol. Part F129372
(September, 1995),
pp. 267276, ACM Press, ISBN 0897917243 [doi] [abs]
 Agarwal, PK; Sharir, M, Efficient randomized algorithms for some geometric optimization problems,
in Eleventh Annual Symposium on Computational Geometry, edited by Snoeyink, J,
Proceedings of the Annual Symposium on Computational Geometry, vol. Part F129372
(1995),
pp. 326335, ACM Press, ISBN 0897917243 [doi] [abs]
 Agarwal, PK; Matoušek, J, Dynamic halfspace range reporting and its applications,
Algorithmica, vol. 13 no. 4
(April, 1995),
pp. 325345, Springer Nature, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Katz, MJ; Sharir, M, Computing depth orders for fat objects and related problems,
Computational Geometry, vol. 5 no. 4
(January, 1995),
pp. 187206, Elsevier BV, ISSN 09257721 [doi] [abs]
 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. 234253, edited by J. van Leeuwen
(1995), SpringerVerlag, Berlin
 J. Matousek and P.K. Agarwal, Dynamic halfspace searching and its applications,
Algorithmica, vol. 14
(1995),
pp. 325345
 P.K. Agarwal, P. Raghavan, and H. Tamaki, Motion planning for a steeringconstrained robot through moderate obstacles,
in Twenty Seventh Annual ACM Symposium on Theory of Computing
(1995)
 P.K. Agarwal, B. Aronov and S. Suri, Line stabbing bounds on triangulations in 3D,
in Eleventh Annual Symposium on Computational Geometry
(1995)
 P.K. Agarwal, O. Schwarzkopf, and M. Sharir, The overlay of envelopes and their applications,
in Eleventh Annual Symposium on Computational Geometry
(1995)
 P.K. Agarwal and K. R. Varadarajan, Linear approximation of convex objects,
in Seventh Canadian Conference on Computational Geometry
(1995)
 Agarwal, P, Cellular segregation and engulfment simulations using the cell programming language,
Journal of Theoretical Biology, vol. 176 no. 1
(1995),
pp. 7989, ISSN 00225193 [doi] [abs]
 Agarwal, PK; Alon, N; Aronov, B; Suri, S, Can visibility graphs Be represented compactly?,
Discrete & Computational Geometry, vol. 12 no. 1
(December, 1994),
pp. 347365, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Sharir, M, On the number of views of polyhedral terrains,
Discrete & Computational Geometry, vol. 12 no. 1
(December, 1994),
pp. 177182, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Sharir, M, Planar geometric location problems,
Algorithmica, vol. 11 no. 2
(February, 1994),
pp. 185195, Springer Nature [doi] [abs]
 Agarwal, PK, On stabbling lines for convex polyhedra in 3D,
Computational Geometry, vol. 4 no. 4
(January, 1994),
pp. 177189, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Sharir, M; Toledo, S, Applications of parametric searching in geometric optimization,
Journal of Algorithms, vol. 17 no. 3
(January, 1994),
pp. 292318, Elsevier BV, ISSN 01966774 [doi] [abs]
 Agarwal, PK; Suri, S, Surface approximation and geometric partitions,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms
(January, 1994),
pp. 2433 [abs]
 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. 348358 [abs]
 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. 7684 [abs]
 Agarwal, PK; Sen, S, Selection in monotone matrices and computing k^{th}nearest neighbors, edited by Schmidt, EM; Skyum, S,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 824 LNCS
(January, 1994),
pp. 1324, SPRINGER, ISBN 9783540582182 [doi] [abs]
 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,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 824 LNCS
(1994),
pp. 112, SPRINGER, ISBN 9783540582182 [doi] [abs]
 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. 369383
 J. Matousek and P.K. Agarwal, Range searching with semialgebraic sets,
Discrete and Computational Geometry, vol. 11
(1994),
pp. 393418
 P.K. Agarwal and S. Suri, Surface approximation and disjoint geometric covers,
in Fifth Annual ACMSIAM Symposium on Discrete Algorithms
(1994)
 P.K. Agarwal and S. Sen, Selection in monotone matrices and kth nearest neighbors,
in Fourth Scandinavian Workshop on Algorithm Theory
(1994)
 Agarwal, P, Simulation of aggregation in Dictyostelium using the cell programming language,
Computer Applications in the Biosciences, vol. 10 no. 6
(1994),
pp. 647655 [abs]
 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. 6775 [abs]
 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. 338347 [abs]
 Agarwal, PK; Aronov, B; Sharir, M; Suri, S, Selecting distances in the plane,
Algorithmica, vol. 9 no. 5
(May, 1993),
pp. 495514, Springer Nature, ISSN 01784617 [doi] [abs]
 Agarwal, PK; Sharir, M, Circle shooting in a simple polygon,
Journal of Algorithms, vol. 14 no. 1
(January, 1993),
pp. 6987, Elsevier BV, ISSN 01966774 [doi] [abs]
 Agarwal, PK; Sharir, M, Ray shooting amidst convex polytopes in three dimensions,
Proceedings of the Fourth Annual Acm Siam Symposium on Discrete Algorithms
(January, 1993),
pp. 260270 [abs]
 Agarwal, PK; Matousek, J, Ray shooting and parametric search,
Siam Journal on Computing, vol. 22 no. 4
(January, 1993),
pp. 794806, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Pellegrini, M; Sharir, M, Counting circular arc intersections,
Siam Journal on Computing, vol. 22 no. 4
(January, 1993),
pp. 778793, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Efrat, A; Sharir, M; Toledo, S, Computing a segment center for a planar point set,
Journal of Algorithms, vol. 15 no. 2
(January, 1993),
pp. 314323, Elsevier BV, ISSN 01966774 [doi] [abs]
 Agarwal, PK; Van kreveld, M; Overmars, M, Intersection queries in curved objects,
Journal of Algorithms, vol. 15 no. 2
(January, 1993),
pp. 229266, Elsevier BV, ISSN 01966774 [doi] [abs]
 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. 3747, ISBN 9783540571551 [abs]
 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. 125
 P.K. Agarwal and M. Sharir, Ray shooting among convex polytopes in 3D,
in Fourth Annual ACMSIAM Symposium on Discrete Algorithms
(1993)
 P.K. Agarwal and M. van Kreveld, Polygon and connected component intersection searching,
in Third Workshop on Algorithms and Data Structures
(1993)
 P.K. Agarwal and M. Sharir, On the number of views of polyhedral terrains,
in Fifth Canadian Conference on Computational Geometry
(1993)
 Agarwal, PK; Aronov, B, Counting facets and incidences,
Discrete & Computational Geometry, vol. 7 no. 1
(December, 1992),
pp. 359369, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Shing, MT, Oriented aligned rectangle packing problem,
European Journal of Operational Research, vol. 62 no. 2
(October, 1992),
pp. 210220, Elsevier BV, ISSN 03772217 [doi] [abs]
 Agarwal, PK; Sharir, M; Toledo, S, Applications of parametric searching in geometric optimization,
in Third Annual ACMSIAM Symposium on Discrete Algorithms, edited by Frederickson, GN,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129721
(1992),
pp. 7282, ACM/SIAM, ISBN 089791466X [abs]
 Agarwal, PK; Matoušek, J, Ray shooting and parametric search,
in Twenty Fourth Annual ACM Symposium on Theory of Computing,
Proceedings of the Annual Acm Symposium on Theory of Computing, vol. Part F129722
(1992),
pp. 517526, ACM Press [doi] [abs]
 van Kreveld, M; Overmars, M; Agarwal, PK, Intersection queries in sets of disks,
Bit, vol. 32 no. 2
(June, 1992),
pp. 268279, Springer Nature, ISSN 00063835 [doi] [abs]
 Agarwal, PK; Matoušek, J; Suri, S, Farthest neighbors, maximum spanning trees and related problems in higher dimensions,
Computational Geometry, vol. 1 no. 4
(April, 1992),
pp. 189201, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Matoušek, J, Relative neighborhood graphs in three dimensions,
Computational Geometry, vol. 2 no. 1
(January, 1992),
pp. 114, Elsevier BV, ISSN 09257721 [doi] [abs]
 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. 8091, ISBN 9783540562870 [abs]
 Agarwal, PK; Matoušek, J, On range searching with semialgebraic sets, edited by Havel, IM; Koubek, V,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 629 LNCS
(January, 1992),
pp. 113, SPRINGER, ISBN 9783540558088 [doi] [abs]
 P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number,
SIAM Journal on Computing, vol. 21
(1992),
pp. 540570
 P.K. Agarwal and J. Matousek, Range searching with semialgebraic sets,
in Seventeenth Symposium on Mathematical Foundations of Computer Science
(1992)
 P.K. Agarwal, D. Eppstein, and J. Matousek, Dynamic halfspace range searching with applications to proximity problems,
in Thirty Third Annual Symposium on Foundations of Computer Science
(1992)
 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)
 Agarwal, PK; Matousek, J, Relative Neighborhood Graphs in Three Dimensions.,
in Third Annual ACMSIAM Symposium on Discrete Algorithms, edited by Frederickson, GN,
SODA
(1992),
pp. 5865, ACM/SIAM, ISBN 089791466X
 Agarwal, PK; Edelsbrunner, H; Schwarzkopf, O; Welzl, E, Euclidean minimum spanning trees and bichromatic closest pairs,
Discrete & Computational Geometry, vol. 6 no. 1
(December, 1991),
pp. 407422, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Sharir, M, Counting circular arc intersections,
in Seventh Annual Symposium on Computational Geometry,
Proceedings of the Annual Symposium on Computational Geometry, vol. Part F129851
(1991),
pp. 1020, ACM Press, ISBN 0897914260 [doi] [abs]
 Agarwal, PK; Kreveld, MV; Overmars, M, Intersection queries for curved objects,
Proceedings of the Annual Symposium on Computational Geometry, vol. Part F129851
(June, 1991),
pp. 4150, ACM Press, ISBN 0897914260 [doi] [abs]
 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
(April, 1991),
pp. 97111, Elsevier BV, ISSN 0166218X [doi] [abs]
 Agarwal, PK; Sharir, M, Planar geometric location problems and maintaining the width of a planar set,
in Second Annual ACMSIAM Symposium on Discrete Algorithms,
Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, vol. Part F129903
(1991),
pp. 449458, ISBN 0897913760 [abs]
 Agarwal, PK; Sharir, M, Offline dynamic maintenance of the width of a planar point set,
Computational Geometry, vol. 1 no. 2
(January, 1991),
pp. 6578, Elsevier BV, ISSN 09257721 [doi] [abs]
 Agarwal, PK; Sharir, M, Applications of a new spacepartitioning technique,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 519 LNCS no. 1
(January, 1991),
pp. 379391, Springer Nature, ISSN 01795376 [doi] [abs]
 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. 105116, Springer Verlag, ISBN 9783540475668 [doi] [abs]
 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. 407422
 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. 137, American Mathematical Society (Providence, RI.)
 P.K. Agarwal and M. Sharir, Applications of a new space partitioning technique,
in Second Workshop on Algorithms and Data Structures
(1991)
 P.K. Agarwal, M. van Kreveld, and M. Overmars, Storing and searching curved objects,
in Seventh Annual Symposium on Computational Geometry
(1991)
 Agarwal, PK, Partitioning arrangements of lines I: An efficient deterministic algorithm,
Discrete & Computational Geometry, vol. 5 no. 1
(December, 1990),
pp. 449483, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK, Partitioning arrangements of lines II: Applications,
Discrete & Computational Geometry, vol. 5 no. 6
(December, 1990),
pp. 533573, Springer Nature, ISSN 01795376 [doi] [abs]
 Agarwal, PK; Edelsbrunner, H; Schwarzkopf, O; Welzl, E, Euclidean minimum spanning trees and bichromatic closest pairs
(January, 1990),
pp. 203210, ACM Press [doi] [abs]
 Agarwal, PK; Sharir, M, Redblue intersection detection algorithms, with applications to motion planning and collision detection,
Siam Journal on Computing, vol. 19 no. 2
(January, 1990),
pp. 297321, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Aronov, B; Sharir, M; Suri, S, Selecting distances in the plane,
in Sixth Annual Symposium on Computational Geometry
(1990),
pp. 321331, ACM Press [doi] [abs]
 Agarwal, PK; Aronov, B; O’Rourke, J; Schevon, CA, Star unfolding of a polytope with applications, edited by Gilbert, JR; Karlsson, RG,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 447 LNCS
(January, 1990),
pp. 251263, Springer Berlin Heidelberg, ISBN 9783540528463 [doi] [abs]
 van Kreveld, M; Overmars, M; Agarwal, PK, Intersection queries in sets of disks,
in Second Scandinavian Workshop on Algorithm Theory, edited by Gilbert, JR; Karlsson, RG,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 447 LNCS
(1990),
pp. 393403, Springer Berlin Heidelberg, ISBN 9783540528463 [doi] [abs]
 P.K. Agarwal, Partitioning arrangements of lines: I. A deterministic algorithm,
Discrete and Computational Geometry, vol. 5
(1990),
pp. 449483
 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. 453485
 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)
 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)
 Agarwal, PK; Sharir, M; Shor, P, Sharp upper and lower bounds on the length of general DavenportSchinzel sequences,
Journal of Combinatorial Theory, Series A, vol. 52 no. 2
(January, 1989),
pp. 228274, Elsevier BV, ISSN 00973165 [doi] [abs]
 P.K. Agarwal, A. Aggarwal, B. Aronov, S. Kosaraju, B. Shieber, and S. Suri, Computing all externalfarthest neighbors for a simple polygon,
in First Canadian Conference on Computational Geometry
(1989)
 P.K. Agarwal, An efficient algorithm for partitioning arrangements of lines and its applications,
in Fifth Annual Symposium on Computational Geometry
(1989)
 P.K. Agarwal, Ray shooting and other applications of spanning trees with low stabbing number,
Fifth Annual Symposium on Computational Geometry
(1989)
 P.K. Agarwal and Micha Sharir, Redblue intersection detection algorithms, with applications to motion planning and collision detection,
Fourth Annual Symposium on Computational Geometry
(1988)
 T. Smith, D. Peuquet, and S. Menon, and P.K. Agarwal, KBGISII: A knowledgebased geographic information system,
International Journal of Geographical Information Systems, vol. 1
(1987),
pp. 149172
 P.K. Agarwal, A. Choudhary and S. Sengupta, A VME bus compatible FFT Processor,
in Conference on Signal Processing
(1983) (Cochin, India.)
Papers Submitted
 Procopiuc, O; Agarwal, PK; Arge, L; Vitter, JS, Bkdtree: A dynamic scalable kdtree,
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2750
(2002),
pp. 4665, ISSN 03029743 (submitted for publication.) [abs]
 Agarwal, PK; Arge, L; Erickson, J, Indexing moving points,
Journal of Computer and System Sciences, vol. 66 no. 1
(2002),
pp. 207243, Elsevier BV [doi] [abs]
 Agarwal, PK; Procopiuc, CM, Approximation algorithms for projective clustering,
Journal of Algorithms, vol. 46 no. 2
(2002),
pp. 115139, Elsevier BV [doi] [abs]
 Agarwal, PK; Guibas, LJ; Edelsbrunner, H; Erickson, J; Isard, M; HarPeled, 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. 550572, Association for Computing Machinery (ACM), ISSN 03600300 (to appear in 2002.) [doi] [abs]
 Agarwal, PK; Biedl, T; Lazard, S; Robbins, S; Suri, S; Whitesides, S, Curvatureconstrained shortest paths in a convex polygon,
Siam Journal on Computing, vol. 31 no. 6
(2002),
pp. 18141851, Society for Industrial & Applied Mathematics (SIAM) [doi] [abs]
 Agarwal, PK; Procopiuc, CM, Exact and approximation algorithms for clustering,
Algorithmica, vol. 33 no. 2
(2002),
pp. 201226, Springer Nature [doi] [abs]
 Agarwal, PK; HarPeled, S; Karia, M, Computing approximate shortest paths on convex polytopes,
Algorithmica, vol. 33 no. 2
(2002),
pp. 227242, Springer Nature [doi] [abs]
 Agarwal, PK; De Berg, M; Gudmundsson, J; Hammar, M; Haverkort, HJ, Boxtrees and Rtrees with nearoptimal query time,
Discrete & Computational Geometry, vol. 28 no. 3
(2002),
pp. 291312, Springer Nature, ISSN 01795376 [doi] [abs]
 P.K. Agarwal, B. Bhattacharya, and S. Sen, Outputsensitive algorithms for uniform partitions of points,
in Algorithmica, in press
(2002)
 P.K. Agarwal and M. Sharir, On the numbers of congruent simplices in a point set,
to appear in Discrete and Computational Geometry
(2002)
 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)
 P.K. Agarwal, C. M. Procopiuc, andand K. R. Varadarajan, An approximation algorithm for computing the twoline center,
submitted to Computational Geometry: Theory and Applications
(2002)
 P.K. Agarwal, M. de Berg, S. HarPeled, 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)
 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.)
 P.K. Agarwal, S. Govindarajan, and L. Arge, CRBtree: An eÆcient indexing scheme for range aggregate queries
(2002) (submitted for publication.)
 P.K. Agarwal, R. Klein, C. Knauer, and M. Sharir, Computing the detour of polygonal curves
(2002) (submitted for publication.)
 P.K. Agarwal and P. K. Desikan, Fast algorithms for surface simplication and other related problems,
submitted to Discrete and Computational Geometry
(1999) (Also appears as Technical
Report CS199915, Department of Computer
Science, Duke University, 1999.)
Other
 P.K. Agarwal, Range searching,
Technical Report CS199605, Department of Computer Science, Duke University
(1996)
 P.K. Agarwal, F. Brooks, A. Varshney, H.Weber, and W. Wright, Multiresolution hierarchy generation of polygonal models,
Technical Report CS199520, Department of Computer Science, Duke University
(1995)
 P.K. Agarwal, M. Sharir, and S. Toledo, An efficient multidimensional searching technique and its applications,
Technical Report CS199320, Department of Computer Science, Duke University
(1993)
 P.K. Agarwal and M. T. Shing, Multiterminal flows in planar networks,
Technical Report TRCS8607, Department of Computer Science, Santa Barbara
(1986)
 P.K. Agarwal, Geometric Algorithms,
Technical Report TRCS8517, 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 277080320

