Pankaj K. Agarwal

Loading Google Thumbnails...
1 Indexing Moving Points. Pankaj K. Agarwal, Lars Arge, Jeff Erickson. J. Comput. Syst. Sci. (66): 207-243 (2003). Cited by 287Web SearchBibTeXDownload
2 Indexing Moving Points. Pankaj K. Agarwal, Lars Arge, Jeff Erickson. PODS 2000, 175-186. Cited by 287Web SearchBibTeX
3 Efficient Searching with Linear Constraints. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter. J. Comput. Syst. Sci. (61): 194-216 (2000). Cited by 82Web SearchBibTeXDownload
4 Efficient Searching with Linear Constraints. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter. PODS 1998, 169-178. Cited by 82Web SearchBibTeX
5 Motion planning for a steering-constrained robot through moderate obstacles. Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki. STOC 1995, 343-352. Cited by 57Web SearchBibTeXDownload
6 I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter. SODA 1998, 117-126. Cited by 47Web SearchBibTeXDownload
7 Bkd-Tree: A Dznamic Scalable kd-Tree. Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter. SSTD 2003, 46-65. Cited by 46Web SearchBibTeXDownload
8 Parametric and Kinetic Minimum Spanning Trees. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger. FOCS 1998, 596-605. Cited by 43Web SearchBibTeXDownload
9 Algorithmic issues in modeling motion. Pankaj K. Agarwal, Leonidas J. Guibas, Herbert Edelsbrunner, Jeff Erickson, Michael Isard, Sariel Har-Peled, John Hershberger, Christian S. Jensen, Lydia E. Kavraki, Patrice Koehl, Ming C. Lin, Dinesh Manocha, Dimitris N. Metaxas, Brian Mirtich, David M. Mount, S. Muthukrishnan, Dinesh K. Pai, Elisha Sacks, Jack Snoeyink, Subhash Suri, Ouri Wolfson. ACM Comput. Surv. (34): 550-572 (2002). Cited by 41Web SearchBibTeXDownload
10 A Framework for Index Bulk Loading and Dynamization. Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter. ICALP 2001, 115-127. Cited by 32Web SearchBibTeXDownload
11 I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter. SODA 1999, 11-20. Cited by 31Web SearchBibTeXDownload
12 Streaming Geometric Optimization Using Graphics Hardware. Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian. ESA 2003, 544-555. Cited by 30Web SearchBibTeXDownload
13 CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge. ICDT 2003, 143-157. Cited by 26Web SearchBibTeXDownload
14 Cache-oblivious data structures for orthogonal range searching. Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley. Symposium on Computational Geometry 2003, 237-245. Cited by 22Web SearchBibTeXDownload
15 Time Responsive External Data Structures for Moving Points. Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold. WADS 2001, 50-61. Cited by 18Web SearchBibTeXDownload
16 Range Searching in Categorical Data: Colored Range Searching on Grid. Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan. ESA 2002, 17-28. Cited by 17Web SearchBibTeXDownload
17 TerraStream: from elevation data to watershed hierarchies. Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová. GIS 2007, 28. Cited by 17Web SearchBibTeXDownload
18 I/O-efficient batched union-find and its applications to terrain analysis. Pankaj K. Agarwal, Lars Arge, Ke Yi. ACM Transactions on Algorithms (7): 11 (2010). Cited by 16Web SearchBibTeXDownload
19 I/O-efficient batched union-find and its applications to terrain analysis. Pankaj K. Agarwal, Lars Arge, Ke Yi. Symposium on Computational Geometry 2006, 167-176. Cited by 16Web SearchBibTeXDownload
20 I/O-Efficient Construction of Constrained Delaunay Triangulations. Pankaj K. Agarwal, Lars Arge, Ke Yi. ESA 2005, 355-366. Cited by 11Web SearchBibTeXDownload
21 An optimal dynamic interval stabbing-max data structure?. Pankaj K. Agarwal, Lars Arge, Ke Yi. SODA 2005, 803-812. Cited by 9Web SearchBibTeXDownload
22 Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu. ESA 2004, 4-15. Cited by 6Web SearchBibTeXDownload
23 I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi. ESA 2003, 7-18. Cited by 4Web SearchBibTeXDownload
24 Indexing uncertain data. Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi. PODS 2009, 137-146. Cited by 1Web SearchBibTeXDownload
25 Efficient Algorithms for Geometric Optimization. Pankaj K. Agarwal, Micha Sharir. ACM Comput. Surv. (30): 412-458 (1998). Web SearchBibTeXDownload
26 Simple and Practical Geometric Algorithms. Pankaj K. Agarwal, Subhash Suri. ACM Comput. Surv. (28): 16 (1996). Web SearchBibTeXDownload
27 Kinetic and dynamic data structures for closest pair and all nearest neighbors. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir. ACM Transactions on Algorithms (5) (2008). Web SearchBibTeXDownload
28 Hausdorff distance under translation for points and balls. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
29 Algorithms for center and Tverberg points. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. ACM Transactions on Algorithms (5) (2008). Web SearchBibTeXDownload
30 Efficient algorithms for bichromatic separability. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun. ACM Transactions on Algorithms (2): 209-227 (2006). Web SearchBibTeXDownload
31 Input-sensitive scalable continuous join query processing. Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu. ACM Trans. Database Syst. (34) (2009). Web SearchBibTeXDownload
32 STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled. ALENEX 2002, 178-193. Web SearchBibTeXDownload
33 Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets. Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan. Algorithmica (52): 378-402 (2008). Web SearchBibTeXDownload
34 Out-of-Order Event Processing in Kinetic Data Structures. Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu. Algorithmica (60): 250-273 (2011). Web SearchBibTeXDownload
35 Exact and Approximation Algorithms for Clustering. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. Algorithmica (33): 201-226 (2002). Web SearchBibTeXDownload
36 Near-Linear Time Approximation Algorithms for Curve Simplification. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang. Algorithmica (42): 203-219 (2005). Web SearchBibTeXDownload
37 Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Algorithmica (9): 495-514 (1993). Web SearchBibTeXDownload
38 Near-Linear Approximation Algorithms for Geometric Hitting Sets. Pankaj K. Agarwal, Esther Ezra, Micha Sharir. Algorithmica (63): 1-25 (2012). Web SearchBibTeXDownload
39 Planar Geometric Location Problems. Pankaj K. Agarwal, Micha Sharir. Algorithmica (11): 185-195 (1994). Web SearchBibTeXDownload
40 Guarding a Terrain by Two Watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu. Algorithmica (58): 352-390 (2010). Web SearchBibTeXDownload
41 Computing Approximate Shortest Paths on Convex Polytopes. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia. Algorithmica (33): 227-242 (2002). Web SearchBibTeXDownload
42 Dynamic Half-Space Range Reporting and Its Applications. Pankaj K. Agarwal, Jirí Matousek. Algorithmica (13): 325-345 (1995). Web SearchBibTeXDownload
43 Improved Algorithms for Uniform Partitions of Points. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen. Algorithmica (32): 521-539 (2002). Web SearchBibTeXDownload
44 Connected Component and Simple Polygon Intersection Searching. Pankaj K. Agarwal, Marc J. van Kreveld. Algorithmica (15): 626-660 (1996). Web SearchBibTeXDownload
45 Approximation Algorithms for a k-Line Center. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan. Algorithmica (42): 221-230 (2005). Web SearchBibTeXDownload
46 Intersection Queries in Sets of Disks. Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal. BIT (32): 268-279 (1992). Web SearchBibTeX
47 On Bipartite Matching under the RMS Distance. Jeff M. Phillips, Pankaj K. Agarwal. CCCG 2006. Web SearchBibTeXDownload
48 Label placement by maximum independent set in rectangles. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri. CCCG 1997. Web SearchBibTeX
49 On the Number of Views of Polyhedral Terrains. Pankaj K. Agarwal, Micha Sharir. CCCG 1993, 55-60. Web SearchBibTeX
50 Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled. CCCG 2005, 43-46. Web SearchBibTeXDownload
51 Quasi-Planar Graphs Have a Linear Number of Edges. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir. Combinatorica (17): 1-9 (1997). Web SearchBibTeXDownload
52 Scalable algorithms for large high-resolution terrain data. Thomas Mølhave, Pankaj K. Agarwal, Lars Arge, Morten Revsbæk. COM.Geo 2010. Web SearchBibTeXDownload
53 Algorithmic Techniques for Geometric Optimization. Pankaj K. Agarwal, Micha Sharir. Computer Science Today 1995, 234-253. Web SearchBibTeXDownload
54 Reporting intersecting pairs of convex polytopes in two and three dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. Comput. Geom. (23): 195-207 (2002). Web SearchBibTeXDownload
55 Cylindrical static and kinetic binary space partitions. Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter. Comput. Geom. (16): 103-127 (2000). Web SearchBibTeXDownload
56 Collision detection for deforming necklaces. Pankaj K. Agarwal, An Nguyen, Daniel Russel, Li Zhang, Li Zhang. Comput. Geom. (28): 137-163 (2004). Web SearchBibTeXDownload
57 Off-line Dynamic Maintenance of the Width of a Planar Point Set. Pankaj K. Agarwal, Micha Sharir. Comput. Geom. (1): 65-78 (1991). Web SearchBibTeXDownload
58 Label placement by maximum independent set in rectangles. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri. Comput. Geom. (11): 209-218 (1998). Web SearchBibTeXDownload
59 Independent set of intersection graphs of convex objects in 2D. Pankaj K. Agarwal, Nabil H. Mustafa. Comput. Geom. (34): 83-95 (2006). Web SearchBibTeXDownload
60 On Stabbling Lines for Convex Polyhedra in 3D. Pankaj K. Agarwal. Comput. Geom. (4): 177-189 (1994). Web SearchBibTeXDownload
61 Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri. Comput. Geom. (1): 189-201 (1991). Web SearchBibTeXDownload
62 Polygon decomposition for efficient construction of Minkowski sums. Pankaj K. Agarwal, Eyal Flato, Dan Halperin. Comput. Geom. (21): 39-61 (2002). Web SearchBibTeXDownload
63 Computing Depth Orders for Fat Objects and Related Problems. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir. Comput. Geom. (5): 187-206 (1995). Web SearchBibTeXDownload
64 A (1+)-approximation algorithm for 2-line-center. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan. Comput. Geom. (26): 119-128 (2003). Web SearchBibTeXDownload
65 Stability of epsilon-Kernels. Pankaj K. Agarwal, Jeff M. Phillips, Hai Yu. CoRR (abs/1003.5874) (2010). Web SearchBibTeXDownload
66 On Channel-Discontinuity-Constraint Routing in Wireless Networks. Swaminathan Sankararaman, Alon Efrat, Srinivasan Ramasubramanian, Pankaj K. Agarwal. CoRR (abs/0912.4115) (2009). Web SearchBibTeXDownload
67 The 2-Center Problem in Three Dimensions. Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir. CoRR (abs/1012.2694) (2010). Web SearchBibTeXDownload
68 Kinetic Stable Delaunay Graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. CoRR (abs/1104.0622) (2011). Web SearchBibTeXDownload
69 Lipschitz Unimodal and Isotonic Regression on Paths and Trees. Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri. CoRR (abs/0912.5182) (2009). Web SearchBibTeXDownload
70 Emerging Challenges in Computational Topology. Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin. CoRR (cs.CG/9909001) (1999). Web SearchBibTeXDownload
71 Computational Geometry (Dagstuhl Seminar 11111). Pankaj K. Agarwal, Kurt Mehlhorn, Monique Teillaud. Dagstuhl Reports (1): 19-41 (2011). Web SearchBibTeXDownload
72 Efficient Sensor Placement for Surveillance Problems. Pankaj K. Agarwal, Esther Ezra, Shashidhara K. Ganjugunte. DCOSS 2009, 301-314. Web SearchBibTeXDownload
73 Distributed localization and clustering using data correlation and the Occam's razor principle. Pankaj K. Agarwal, Alon Efrat, Chris Gniady, Joseph S. B. Mitchell, Valentin Polishchuk, Girishkumar Sabhnani. DCOSS 2011, 1-8. Web SearchBibTeXDownload
74 Computation and Uncertainty in Ecological Forecasting. James S. Clark, Pankaj K. Agarwal, Michael Lavin. DG.O 2002. Web SearchBibTeXDownload
75 Lines Avoiding Unit Balls in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (34): 231-250 (2005). Web SearchBibTeXDownload
76 Counting Facets and Incidences. Pankaj K. Agarwal, Boris Aronov. Discrete & Computational Geometry (7): 359-369 (1992). Web SearchBibTeXDownload
77 On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir. Discrete & Computational Geometry (19): 315-331 (1998). Web SearchBibTeXDownload
78 Can Visibility Graphs Be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Discrete & Computational Geometry (12): 347-365 (1994). Web SearchBibTeXDownload
79 On the Number of Views of Polyhedral Terrains. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (12): 177-182 (1994). Web SearchBibTeXDownload
80 Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss. Discrete & Computational Geometry (39): 17-37 (2008). Web SearchBibTeXDownload
81 Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Discrete & Computational Geometry (26): 185-186 (2001). Web SearchBibTeXDownload
82 Box-Trees and R-Trees with Near-Optimal Query Time. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort. Discrete & Computational Geometry (28): 291-312 (2002). Web SearchBibTeXDownload
83 Maintaining the Extent of a Moving Point Set. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach. Discrete & Computational Geometry (26): 353-374 (2001). Web SearchBibTeXDownload
84 Robust Shape Fitting via Peeling and Grating Coresets. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu. Discrete & Computational Geometry (39): 38-58 (2008). Web SearchBibTeXDownload
85 Extreme Elevation on a 2-Manifold. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang. Discrete & Computational Geometry (36): 553-572 (2006). Web SearchBibTeXDownload
86 The Overlay of Lower Envelopes and Its Applications. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir. Discrete & Computational Geometry (15): 1-13 (1996). Web SearchBibTeXDownload
87 The Discrete 2-Center Problem. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. Discrete & Computational Geometry (20): 287-305 (1998). Web SearchBibTeXDownload
88 Largest Placement of One Convex Polygon Inside Another. Pankaj K. Agarwal, Nina Amenta, Micha Sharir. Discrete & Computational Geometry (19): 95-104 (1998). Web SearchBibTeXDownload
89 Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (21): 373-388 (1999). Web SearchBibTeXDownload
90 Efficient Algorithms for Approximating Polygonal Chains. Pankaj K. Agarwal, Kasturi R. Varadarajan. Discrete & Computational Geometry (23): 273-291 (2000). Web SearchBibTeXDownload
91 Approximation Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Discrete & Computational Geometry (24): 687-705 (2000). Web SearchBibTeXDownload
92 A Near-Quadratic Algorithm for Fence Design. Pankaj K. Agarwal, Robert-Paul Berretty, Anne D. Collins. Discrete & Computational Geometry (33): 463-481 (2005). Web SearchBibTeXDownload
93 Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. Discrete & Computational Geometry (6): 407-422 (1991). Web SearchBibTeXDownload
94 Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm. Pankaj K. Agarwal. Discrete & Computational Geometry (5): 449-483 (1990). Web SearchBibTeXDownload
95 Parititoning Arrangements of Lines II: Applications. Pankaj K. Agarwal. Discrete & Computational Geometry (5): 533-573 (1990). Web SearchBibTeXDownload
96 Applications of a New Space-Partitioning Technique. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (9): 11-38 (1993). Web SearchBibTeXDownload
97 Guest Editors' Foreword. Peter Gritzmann, Peter Bro Miltersen, Dorothea Wagner, Attila Sali, Ivan Porres. Discrete & Computational Geometry (25): 505-506 (2001). Web SearchBibTeXDownload
98 Efficient Randomized Algorithms for Some Geometric. Optimization Problems. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (16): 317-337 (1996). Web SearchBibTeXDownload
99 Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (26): 307-320 (2001). Web SearchBibTeXDownload
100 A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes. Pankaj K. Agarwal, Yusu Wang, Hai Yu. Discrete & Computational Geometry (36): 573-592 (2006). Web SearchBibTeXDownload
101 Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Discrete & Computational Geometry (24): 721-733 (2000). Web SearchBibTeXDownload
102 Computing the Writhing Number of a Polygonal Knot. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang. Discrete & Computational Geometry (32): 37-53 (2004). Web SearchBibTeXDownload
103 Motion Planning for a Convex Polygon in a Polygonal Environment. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (22): 201-221 (1999). Web SearchBibTeXDownload
104 On Range Searching with Semialgebraic Sets. Pankaj K. Agarwal, Jirí Matousek. Discrete & Computational Geometry (11): 393-418 (1994). Web SearchBibTeXDownload
105 Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (24): 645-657 (2000). Web SearchBibTeXDownload
106 On polyhedra induced by point sets in space. Pankaj K. Agarwal, Ferran Hurtado, Godfried T. Toussaint, Joan Trias. Discrete Applied Mathematics (156): 42-54 (2008). Web SearchBibTeXDownload
107 Computing external farthest neighbors for a simple polygon. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri. Discrete Applied Mathematics (31): 97-111 (1991). Web SearchBibTeXDownload
108 Stabbing Convex Polygons with a Segment or a Polygon. Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang. ESA 2008, 52-63. Web SearchBibTeXDownload
109 Polygon Decomposition for Efficient Construction of Minkowski Sums. Pankaj K. Agarwal, Eyal Flato, Dan Halperin. ESA 2000, 20-31. Web SearchBibTeXDownload
110 Out-of-Order Event Processing in Kinetic Data Structures. Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu. ESA 2006, 624-635. Web SearchBibTeXDownload
111 Kinetic Medians and kd-Trees. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas. ESA 2002, 5-16. Web SearchBibTeXDownload
112 Translating a Planar Object to Maximize Point Containment. Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl. ESA 2002, 42-53. Web SearchBibTeXDownload
113 Approximation Algorithms for k-Line Center. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan. ESA 2002, 54-63. Web SearchBibTeXDownload
114 Near-Linear Time Approximation Algorithms for Curve Simplification. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang. ESA 2002, 29-41. Web SearchBibTeXDownload
115 An Efficient Algorithm for 2D Euclidean 2-Center with Outliers. Pankaj K. Agarwal, Jeff M. Phillips. ESA 2008, 64-75. Web SearchBibTeXDownload
116 Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. T. M. Murali, Pankaj K. Agarwal, Jeffrey Scott Vitter. ESA 1998, 211-222. Web SearchBibTeXDownload
117 Approximating Shortest Paths on an Nonconvex Polyhedron. Kasturi R. Varadarajan, Pankaj K. Agarwal. FOCS 1997, 182-191. Web SearchBibTeXDownload
118 On the Complexity of Many Faces in Arrangements of Circles. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. FOCS 2001, 74-83. Web SearchBibTeXDownload
119 Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees. Pankaj K. Agarwal, David Eppstein, Jirí Matousek. FOCS 1992, 80-89. Web SearchBibTeXDownload
120 Binary Search Partitions for Fat Rectangles. Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter. FOCS 1996, 482-491. Web SearchBibTeXDownload
121 Computing a Center-Transversal Line. Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir. FSTTCS 2006, 93-104. Web SearchBibTeXDownload
122 Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. Pankaj K. Agarwal, Marc J. van Kreveld. FSTTCS 1992, 80-91. Web SearchBibTeXDownload
123 Natural neighbor interpolation based grid DEM construction using a GPU. Alex Beutel, Thomas Mølhave, Pankaj K. Agarwal. GIS 2010, 172-181. Web SearchBibTeXDownload
124 TerraNNI: natural neighbor interpolation on a 3D grid using a GPU. Alex Beutel, Thomas Mølhave, Pankaj K. Agarwal, Arnold P. Boedihardjo, James A. Shine. GIS 2011, 64-74. Web SearchBibTeXDownload
125 Quasi-Planar Graphs Have a Linear Number of Edges. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir. Graph Drawing 1995, 1-7. Web SearchBibTeXDownload
126 Subscriber assignment for wide-area content-based publish/subscribe. Albert Yu, Pankaj K. Agarwal, Jun Yang. ICDE 2011, 267-278. Web SearchBibTeXDownload
127 (Approximate) uncertain skylines. Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips. ICDT 2011, 186-196. Web SearchBibTeXDownload
128 Minimal Trap Design. Pankaj K. Agarwal, Anne D. Collins, John Harer. ICRA 2001, 2243-2248. Web SearchBibTeX
129 HPRM: a hierarchical PRM. Anne D. Collins, Pankaj K. Agarwal, John Harer. ICRA 2003, 4433-4438. Web SearchBibTeX
130 Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons. Pankaj K. Agarwal, Pankaj K. Agarwal, Rachel Kolodny. IEEE/ACM Trans. Comput. Biology Bioinform. (3): 408-422 (2006). Web SearchBibTeXDownload
131 Advances in Indexing for Mobile Objects. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. IEEE Data Eng. Bull. (25): 25-34 (2002). Web SearchBibTeXDownload
132 Deformable Free-Space Tilings for Kinetic Collision Detection. Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang. I. J. Robotic Res. (21): 179-198 (2002). Web SearchBibTeX
133 The resilience of WDM networks to probabilistic geographical failures. Pankaj K. Agarwal, Alon Efrat, Shashidhara K. Ganjugunte, David Hay, Swaminathan Sankararaman, Gil Zussman. INFOCOM 2011, 1521-1529. Web SearchBibTeXDownload
134 On Channel-Discontinuity-Constraint Routing in Wireless Networks. Swaminathan Sankararaman, Alon Efrat, Srinivasan Ramasubramanian, Pankaj K. Agarwal. INFOCOM 2010, 481-485. Web SearchBibTeXDownload
135 Linear Approximation of Simple Objects. Kasturi R. Varadarajan, Pankaj K. Agarwal. Inf. Process. Lett. (62): 89-94 (1997). Web SearchBibTeXDownload
136 From Data Reverence to Data Relevance: Model-Mediated Wireless Sensing of the Physical Environment. Paul G. Flikkema, Pankaj K. Agarwal, James S. Clark, Carla Schlatter Ellis, Alan Gelfand, Kamesh Munagala, Jun Yang. International Conference on Computational Science (1) 2007, 988-994. Web SearchBibTeXDownload
137 Model-Driven Dynamic Control of Embedded Wireless Sensor Networks. Paul G. Flikkema, Pankaj K. Agarwal, James S. Clark, Carla Schlatter Ellis, Alan E. Gelfand, Kamesh Munagala, Jun Yang. International Conference on Computational Science (3) 2006, 409-416. Web SearchBibTeXDownload
138 Circular visibility of a simple polygon from a fixed point. Pankaj K. Agarwal, Micha Sharir. Int. J. Comput. Geometry Appl. (3): 1-25 (1993). Web SearchBibTeX
139 Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. Pankaj K. Agarwal, Marc J. van Kreveld. Int. J. Comput. Geometry Appl. (4): 369-383 (1994). Web SearchBibTeX
140 Computational Geometry Column 34. Pankaj K. Agarwal, Joseph O'Rourke. Int. J. Comput. Geometry Appl. (8): 637 (1998). Web SearchBibTeX
141 Guest Editor's Foreword. Sandip Das, Emden R. Gansner, Joe Kilian, Jon M. Kleinberg. Int. J. Comput. Geometry Appl. (9): 325 (1999). Web SearchBibTeX
142 Modeling and Analyzing Massive Terrain Data Sets. Pankaj K. Agarwal. ISAAC 2007, 1. Web SearchBibTeXDownload
143 Output-Sensitive Algorithms for Uniform Partitions of Points. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen. ISAAC 1999, 403-414. Web SearchBibTeXDownload
144 Monitoring Continuous Band-Join Queries over Dynamic Data. Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu. ISAAC 2005, 349-359. Web SearchBibTeXDownload
145 Approximating extent measures of points. Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan. J. ACM (51): 606-635 (2004). Web SearchBibTeXDownload
146 Approximating shortest paths on a convex polytope in three dimensions. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan. J. ACM (44): 567-584 (1997). Web SearchBibTeXDownload
147 Lenses in arrangements of pseudo-circles and their applications. Eran Nevo, János Pach, János Pach, Micha Sharir, Micha Sharir, Shakhar Smorodinsky. J. ACM (51): 139-186 (2004). Web SearchBibTeXDownload
148 Open Problems Presented at SCG'98. Samir Khuller, Pankaj K. Agarwal, Joseph O'Rourke. J. Algorithms (30): 449-453 (1999). Web SearchBibTeXDownload
149 Circle Shooting in a Simple Polygon. Pankaj K. Agarwal, Micha Sharir. J. Algorithms (14): 69-87 (1993). Web SearchBibTeXDownload
150 Applications of Parametric Searching in Geometric Optimization. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo. J. Algorithms (17): 292-318 (1994). Web SearchBibTeXDownload
151 Ray Shooting Amidst Convex Polygons in 2D. Pankaj K. Agarwal, Micha Sharir. J. Algorithms (21): 508-519 (1996). Web SearchBibTeXDownload
152 Computing a Segment Center for a Planar Point Set. Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo. J. Algorithms (15): 314-323 (1993). Web SearchBibTeXDownload
153 Intersection Queries in Curved Objects. Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars. J. Algorithms (15): 229-266 (1993). Web SearchBibTeXDownload
154 Selection in Monotone Matrices and Computing kth Nearest Neighbors. Pankaj K. Agarwal, Sandeep Sen. J. Algorithms (20): 581-601 (1996). Web SearchBibTeXDownload
155 Approximation algorithms for projective clustering. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. J. Algorithms (46): 115-139 (2003). Web SearchBibTeXDownload
156 Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. Pankaj K. Agarwal, Micha Sharir, Peter W. Shor. J. Comb. Theory, Ser. A (52): 228-274 (1989). Web SearchBibTeXDownload
157 A scalable algorithm for dispersing population. Sathish Govindarajan, Michael C. Dietze, Pankaj K. Agarwal, James S. Clark. J. Intell. Inf. Syst. (29): 39-61 (2007). Web SearchBibTeXDownload
158 Fast Molecular Shape Matching Using Contact Maps. Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang. Journal of Computational Biology (14): 131-143 (2007). Web SearchBibTeXDownload
159 Lipschitz Unimodal and Isotonic Regression on Paths and Trees. Pankaj K. Agarwal, Jeff M. Phillips, Bardia Sadri. LATIN 2010, 384-396. Web SearchBibTeXDownload
160 On Range Searching with Semialgebraic Sets. Pankaj K. Agarwal, Jirí Matousek. MFCS 1992, 1-13. Web SearchBibTeXDownload
161 Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. Nord. J. Comput. (7): 227-240 (2000). Web SearchBibTeX
162 Coarse and Reliable Geometric Alignment for Protein Docking. Yusu Wang, Pankaj K. Agarwal, P. Brown, Herbert Edelsbrunner, Johannes Rudolph. Pacific Symposium on Biocomputing 2005, 66-77. Web SearchBibTeXDownload
163 k-Means Projective Clustering. Pankaj K. Agarwal, Nabil H. Mustafa. PODS 2004, 155-165. Web SearchBibTeXDownload
164 Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. Pankaj K. Agarwal. SIAM J. Comput. (21): 540-570 (1992). Web SearchBibTeXDownload
165 Computing Envelopes in Four Dimensions with Applications. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SIAM J. Comput. (26): 1714-1732 (1997). Web SearchBibTeXDownload
166 Binary Space Partitions for Fat Rectangles. Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter. SIAM J. Comput. (29): 1422-1448 (2000). Web SearchBibTeXDownload
167 Computing Maximally Separated Sets in the Plane. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir. SIAM J. Comput. (36): 815-834 (2006). Web SearchBibTeXDownload
168 Approximating Shortest Paths on a Nonconvex Polyhedron. Kasturi R. Varadarajan, Pankaj K. Agarwal. SIAM J. Comput. (30): 1321-1340 (2000). Web SearchBibTeXDownload
169 Counting Circular Arc Intersections. Pankaj K. Agarwal, Micha Sharir, Micha Sharir. SIAM J. Comput. (22): 778-793 (1993). Web SearchBibTeXDownload
170 Curvature-Constrained Shortest Paths in a Convex Polygon. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. SIAM J. Comput. (31): 1814-1851 (2002). Web SearchBibTeXDownload
171 Pseudo-Line Arrangements: Duality, Algorithms, and Applications. Pankaj K. Agarwal, Micha Sharir. SIAM J. Comput. (34): 526-552 (2005). Web SearchBibTeXDownload
172 Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. SIAM J. Comput. (27): 654-667 (1998). Web SearchBibTeXDownload
173 Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. Pankaj K. Agarwal, Micha Sharir. SIAM J. Comput. (19): 297-321 (1990). Web SearchBibTeXDownload
174 Surface Approximation and Geometric Partitions. Pankaj K. Agarwal, Subhash Suri. SIAM J. Comput. (27): 1016-1035 (1998). Web SearchBibTeXDownload
175 Computing Many Faces in Arrangements of Lines and Segments. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf. SIAM J. Comput. (27): 491-505 (1998). Web SearchBibTeXDownload
176 Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. SIAM J. Comput. (25): 100-116 (1996). Web SearchBibTeXDownload
177 Ray Shooting and Parametric Search. Pankaj K. Agarwal, Jirí Matousek. SIAM J. Comput. (22): 794-806 (1993). Web SearchBibTeXDownload
178 Approximation Algorithms for Curvature-Constrained Shortest Paths. Hongyan Wang, Pankaj K. Agarwal. SIAM J. Comput. (30): 1739-1772 (2000). Web SearchBibTeXDownload
179 Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Pankaj K. Agarwal, Alon Efrat, Micha Sharir. SIAM J. Comput. (29): 912-953 (1999). Web SearchBibTeXDownload
180 Star Unfolding of a Polytope with Applications. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon. SIAM J. Comput. (26): 1689-1713 (1997). Web SearchBibTeXDownload
181 Computational geometry. Joseph O'Rourke, Joseph O'Rourke. SIGACT News (29): 27-32 (1998). Web SearchBibTeXDownload
182 Simplification Envelopes. Jonathan D. Cohen, Amitabh Varshney, Dinesh Manocha, Greg Turk, Hans Weber, Pankaj K. Agarwal, Frederick P. Brooks Jr., William V. Wright. SIGGRAPH 1996, 119-128. Web SearchBibTeXDownload
183 A Monte Carlo algorithm for fast projective clustering. Cecilia Magdalena Procopiuc, Michael Jones, Pankaj K. Agarwal, T. M. Murali. SIGMOD Conference 2002, 418-427. Web SearchBibTeXDownload
184 ProSem: scalable wide-area publish/subscribe. Badrish Chandramouli, Jun Yang, Pankaj K. Agarwal, Albert Yu, Ying Zheng. SIGMOD Conference 2008, 1315-1318. Web SearchBibTeXDownload
185 I/O-Efficient Contour Queries on Terrains. Pankaj K. Agarwal, Thomas Mølhave, Bardia Sadri. SODA 2011, 268-284. Web SearchBibTeXDownload
186 Lower bound for sparse Euclidean spanners. Pankaj K. Agarwal, Yusu Wang, Peng Yin. SODA 2005, 670-671. Web SearchBibTeXDownload
187 Robust shape fitting via peeling and grating coresets. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu. SODA 2006, 182-191. Web SearchBibTeXDownload
188 Exact and Approximation Algorithms for Clustering (Extended Abstract). Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. SODA 1998, 658-667. Web SearchBibTeXDownload
189 An Efficient Algorithm for Terraine Simplification. Pankaj K. Agarwal, Pavan K. Desikan. SODA 1997, 139-147. Web SearchBibTeXDownload
190 Relative Neighborhood Graphs in Three Dimensions. Pankaj K. Agarwal, Jirí Matousek. SODA (2): 1-14 (1992). Web SearchBibTeXDownload
191 Approximate Euclidean shortest paths amid convex obstacles. Pankaj K. Agarwal, R. Sharathkumar, Hai Yu. SODA 2009, 283-292. Web SearchBibTeXDownload
192 Ray Shooting Amidst Convex Polytopes in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. SODA 1993, 260-270. Web SearchBibTeXDownload
193 Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SODA 1997, 483-492. Web SearchBibTeXDownload
194 Computing the writhing number of a polygonal knot. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang. SODA 2002, 791-799. Web SearchBibTeXDownload
195 Efficient algorithms for bichromatic separability. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun. SODA 2004, 682-690. Web SearchBibTeXDownload
196 Surface Approximation and Geometric Partitions. Pankaj K. Agarwal, Subhash Suri. SODA 1994, 24-33. Web SearchBibTeXDownload
197 Planar Geometric Location Problems and Maintaining the Width of a Planar Set. Pankaj K. Agarwal, Micha Sharir. SODA 1991, 449-458. Web SearchBibTeXDownload
198 Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir. SODA 2004, 516-525. Web SearchBibTeXDownload
199 Motion Planning of a Ball Amid Segments in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. SODA 1999, 21-30. Web SearchBibTeXDownload
200 Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. Kasturi R. Varadarajan, Pankaj K. Agarwal. SODA 1999, 805-814. Web SearchBibTeXDownload
201 Approximation algorithms for projective clustering. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc. SODA 2000, 538-547. Web SearchBibTeXDownload
202 Maintaining approximate extent measures of moving points. Pankaj K. Agarwal, Sariel Har-Peled. SODA 2001, 148-157. Web SearchBibTeXDownload
203 Pseudo-line arrangements: duality, algorithms, and applications. Pankaj K. Agarwal, Micha Sharir. SODA 2002, 800-809. Web SearchBibTeXDownload
204 Efficient Generation of k-Directional Assembly Sequences. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir. SODA 1996, 122-131. Web SearchBibTeXDownload
205 Algorithms for the transportation problem in geometric settings. R. Sharathkumar, Pankaj K. Agarwal. SODA 2012, 306-317. Web SearchBibTeXDownload
206 Streaming Algorithms for Extent Problems in High Dimensions. Pankaj K. Agarwal, R. Sharathkumar. SODA 2010, 1481-1489. Web SearchBibTeXDownload
207 Approximation algorithms for layered manufacturing. Pankaj K. Agarwal, Pavan K. Desikan. SODA 2000, 528-537. Web SearchBibTeXDownload
208 Exact and approximation algorithms for minimum-width cylindrical shells. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SODA 2000, 510-517. Web SearchBibTeXDownload
209 Approximation Algorithms for Curvature-Constrained Shortest Paths. Hongyan Wang, Pankaj K. Agarwal. SODA 1996, 409-418. Web SearchBibTeXDownload
210 Applications of Parametric Searching in Geometric Optimization. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo. SODA 1992, 72-82. Web SearchBibTeXDownload
211 Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas. SODA 1998, 107-116. Web SearchBibTeXDownload
212 Ray Shooting and Parametric Search. Pankaj K. Agarwal, Jirí Matousek. STOC 1992, 517-526. Web SearchBibTeXDownload
213 Intersection Queries in Sets of Disks. Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal. SWAT 1990, 393-403. Web SearchBibTeXDownload
214 Star Unfolding of a Polytope with Applications (Extended Abstract). Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon. SWAT 1990, 251-263. Web SearchBibTeXDownload
215 Selection in Monotone Matrices and Computing kth Nearest Neighbors. Pankaj K. Agarwal, Sandeep Sen. SWAT 1994, 13-24. Web SearchBibTeXDownload
216 Computing the Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. SWAT 2000, 328-338. Web SearchBibTeXDownload
217 Computing Depth Orders and Related Problems. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir. SWAT 1994, 1-12. Web SearchBibTeXDownload
218 Independent Set of Intersection Graphs of Convex Objects in 2D. Pankaj K. Agarwal, Nabil H. Mustafa. SWAT 2004, 127-137. Web SearchBibTeXDownload
219 The Discrete 2-Center Problem. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. Symposium on Computational Geometry 1997, 147-155. Web SearchBibTeXDownload
220 Embeddings of surfaces, curves, and moving points in euclidean space. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu. Symposium on Computational Geometry 2007, 381-389. Web SearchBibTeXDownload
221 Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 1999, 143-153. Web SearchBibTeXDownload
222 Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Symposium on Computational Geometry 1999, 380-389. Web SearchBibTeXDownload
223 Untangling triangulations through local explorations. Pankaj K. Agarwal, Bardia Sadri, Hai Yu. Symposium on Computational Geometry 2008, 288-297. Web SearchBibTeXDownload
224 Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. Symposium on Computational Geometry 1998, 392-401. Web SearchBibTeXDownload
225 Computing approximate shortest paths on convex polytopes. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia. Symposium on Computational Geometry 2000, 270-279. Web SearchBibTeXDownload
226 Extreme elevation on a 2-manifold. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang. Symposium on Computational Geometry 2004, 357-365. Web SearchBibTeXDownload
227 Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Pankaj K. Agarwal, Alon Efrat, Micha Sharir. Symposium on Computational Geometry 1995, 39-50. Web SearchBibTeXDownload
228 Guarding a terrain by two watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu. Symposium on Computational Geometry 2005, 346-355. Web SearchBibTeXDownload
229 Lower Bounds for Kinetic Planar Subdivisions. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger. Symposium on Computational Geometry 1999, 247-254. Web SearchBibTeXDownload
230 Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl. Symposium on Computational Geometry 1990, 203-210. Web SearchBibTeXDownload
231 Algorithms for center and Tverberg points. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. Symposium on Computational Geometry 2004, 61-67. Web SearchBibTeXDownload
232 Computing Many Faces in Arrangements of Lines and Segments. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1994, 76-84. Web SearchBibTeXDownload
233 Can Visibility Graphs be Represented Compactly?. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri. Symposium on Computational Geometry 1993, 338-347. Web SearchBibTeXDownload
234 Computing Envelopes in Four Dimensions with Applications. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Symposium on Computational Geometry 1994, 348-358. Web SearchBibTeXDownload
235 A scalable simulator for forest dynamics. Sathish Govindarajan, Mike Dietze, Pankaj K. Agarwal, James S. Clark. Symposium on Computational Geometry 2004, 106-115. Web SearchBibTeXDownload
236 Hausdorff distance under translation for points and balls. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. Symposium on Computational Geometry 2003, 282-291. Web SearchBibTeXDownload
237 Intersection Queries for Curved Objects (Extended Abstract). Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars. Symposium on Computational Geometry 1991, 41-50. Web SearchBibTeXDownload
238 Cylindrical Static and Kinetic Binary Space Partitions. Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter. Symposium on Computational Geometry 1997, 39-48. Web SearchBibTeXDownload
239 Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Symposium on Computational Geometry 1990, 321-331. Web SearchBibTeXDownload
240 A 2D kinetic triangulation with near-quadratic topological changes. Pankaj K. Agarwal, Yusu Wang, Hai Yu. Symposium on Computational Geometry 2004, 180-189. Web SearchBibTeXDownload
241 Box-trees and R-trees with near-optimal query time. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort. Symposium on Computational Geometry 2001, 124-133. Web SearchBibTeXDownload
242 Near-linear approximation algorithms for geometric hitting sets. Pankaj K. Agarwal, Esther Ezra, Micha Sharir. Symposium on Computational Geometry 2009, 23-32. Web SearchBibTeXDownload
243 Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. Pankaj K. Agarwal. Symposium on Computational Geometry 1989, 315-325. Web SearchBibTeXDownload
244 Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 1988, 70-80. Web SearchBibTeXDownload
245 Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf. Symposium on Computational Geometry 1994, 67-75. Web SearchBibTeXDownload
246 A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application. Pankaj K. Agarwal. Symposium on Computational Geometry 1989, 11-22. Web SearchBibTeXDownload
247 Stabbing Triangulations by Lines in 3D. Pankaj K. Agarwal, Boris Aronov, Subhash Suri. Symposium on Computational Geometry 1995, 267-276. Web SearchBibTeXDownload
248 I/o-efficient efficient algorithms for computing contours on a terrain. Pankaj K. Agarwal, Lars Arge, Thomas Mølhave, Bardia Sadri. Symposium on Computational Geometry 2008, 129-138. Web SearchBibTeXDownload
249 On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Symposium on Computational Geometry 1997, 30-38. Web SearchBibTeXDownload
250 Efficient Randomized Algorithms for Some Geometric Optimization Problems. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 1995, 326-335. Web SearchBibTeXDownload
251 Kinetic stable Delaunay graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. Symposium on Computational Geometry 2010, 127-136. Web SearchBibTeXDownload
252 Similar simplices in a d-dimensional point set. Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir. Symposium on Computational Geometry 2007, 232-238. Web SearchBibTeXDownload
253 Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles. Pankaj K. Agarwal, T. M. Murali, Jeffrey Scott Vitter. Symposium on Computational Geometry 1997, 382-384. Web SearchBibTeXDownload
254 A space-optimal data-stream algorithm for coresets in the plane. Pankaj K. Agarwal, Hai Yu. Symposium on Computational Geometry 2007, 1-10. Web SearchBibTeXDownload
255 An improved algorithm for computing the volume of the union of cubes. Pankaj K. Agarwal. Symposium on Computational Geometry 2010, 230-239. Web SearchBibTeXDownload
256 The 2-center problem in three dimensions. Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir. Symposium on Computational Geometry 2010, 87-96. Web SearchBibTeXDownload
257 Computing the volume of the union of cubes. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir. Symposium on Computational Geometry 2007, 294-301. Web SearchBibTeXDownload
258 A near-linear constant-factor approximation for euclidean bipartite matching?. Pankaj K. Agarwal, Kasturi R. Varadarajan. Symposium on Computational Geometry 2004, 247-252. Web SearchBibTeXDownload
259 Counting Circular Arc Intersections. Pankaj K. Agarwal, Micha Sharir, Micha Sharir. Symposium on Computational Geometry 1991, 10-20. Web SearchBibTeXDownload
260 Exploiting temporal coherence in forest dynamics simulation. Pankaj K. Agarwal, Thomas Mølhave, Hai Yu, James S. Clark. Symposium on Computational Geometry 2011, 77-86. Web SearchBibTeXDownload
261 Practical methods for shape fitting and kinetic data structures using core sets. Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan. Symposium on Computational Geometry 2004, 263-272. Web SearchBibTeXDownload
262 Computing similarity between piecewise-linear functions. Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira. Symposium on Computational Geometry 2010, 375-383. Web SearchBibTeXDownload
263 On lines avoiding unit balls in three dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2004, 36-45. Web SearchBibTeXDownload
264 The Overlay of Lower Envelopes in Three Dimensions and Its Applications. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir. Symposium on Computational Geometry 1995, 182-189. Web SearchBibTeXDownload
265 On the number of congruent simplices in a point. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 2001, 1-9. Web SearchBibTeXDownload
266 Segmenting object space by geometric reference structures. Pankaj K. Agarwal, David J. Brady, Jirí Matousek. TOSN (2): 455-465 (2006). Web SearchBibTeXDownload
267 Localization using boundary sensors: An analysis based on graph theory. Yunhui Zheng, David J. Brady, Pankaj K. Agarwal. TOSN (3) (2007). Web SearchBibTeXDownload
268 Scalable Continuous Query Processing by Tracking Hotspots. Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu. VLDB 2006, 31-42. Web SearchBibTeXDownload
269 Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons. Pankaj K. Agarwal, Pankaj K. Agarwal, Rachel Kolodny. WABI 2005, 315-327. Web SearchBibTeXDownload
270 Local Search Heuristic for Rigid Protein Docking. Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph. WABI 2004, 218-229. Web SearchBibTeXDownload
271 Segmenting Motifs in Protein-Protein Interface Surfaces. Jeff M. Phillips, Johannes Rudolph, Pankaj K. Agarwal. WABI 2006, 207-218. Web SearchBibTeXDownload
272 Applications of a New Space Partitioning Technique. Pankaj K. Agarwal, Micha Sharir. WADS 1991, 379-391. Web SearchBibTeXDownload
273 Maintaining the Extent of a Moving Point Set. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach. WADS 1997, 31-44. Web SearchBibTeXDownload
274 Connected Component and Simple Polygon Intersection Searching (Extended Abstract). Pankaj K. Agarwal, Marc J. van Kreveld. WADS 1993, 36-47. Web SearchBibTeXDownload
275 Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. WADS 2001, 122-134. Web SearchBibTeXDownload
276 Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri. WADS 1991, 105-116. Web SearchBibTeXDownload
277 On Approximate Geodesic-Distance Queries amid Deforming Point Clouds. Pankaj K. Agarwal, Alon Efrat, R. Sharathkumar, Hai Yu. WAFR 2008, 351-365. Web SearchBibTeXDownload
from DBLP and Google Scholar
References
1. ^ The 2010 ACM SIGMOD/PODS Conference: Indianapolis, Indiana, USA - Organization: PODS Program Committee - Retrieved 2011-03-19 - details
2. ^ Untitled Document - Retrieved 2011-06-30 - details
3. ^ 2004-2005 Research Colloquia - Retrieved 2011-04-28 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research