The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pankaj K. Agarwal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
    Efficient Searching with Linear Constraints. [Citation Graph (8, 28)][DBLP]
    PODS, 1998, pp:169-178 [Conf]
  2. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
    Indexing Moving Points. [Citation Graph (1, 34)][DBLP]
    PODS, 2000, pp:175-186 [Conf]
  3. Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas
    Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    SODA, 1998, pp:107-116 [Conf]
  4. Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars
    Intersection Queries in Curved Objects. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:2, pp:229-266 [Journal]
  5. Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled
    STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2002, pp:178-193 [Conf]
  6. Pankaj K. Agarwal, Mark de Berg, Jie Gao, Leonidas J. Guibas, Sariel Har-Peled
    Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:43-46 [Conf]
  7. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
    Label placement by maximum independent set in rectangles. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  8. Pankaj K. Agarwal, Micha Sharir
    On the Number of Views of Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:55-60 [Conf]
  9. Pankaj K. Agarwal
    A Deterministic Algorithm for Partitioning Arrangements of Lines and Its Application. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:11-22 [Conf]
  10. Pankaj K. Agarwal
    Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:315-325 [Conf]
  11. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs be Represented Compactly? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:338-347 [Conf]
  12. Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan Holland-Minkley
    Cache-oblivious data structures for orthogonal range searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:237-245 [Conf]
  13. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:380-389 [Conf]
  14. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    On lines avoiding unit balls in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:36-45 [Conf]
  15. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Computing Envelopes in Four Dimensions with Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:348-358 [Conf]
  16. Pankaj K. Agarwal, Boris Aronov, Subhash Suri
    Stabbing Triangulations by Lines in 3D. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:267-276 [Conf]
  17. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    On Levels in Arrangements of Lines, Segments, Planes, and Triangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:30-38 [Conf]
  18. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:321-331 [Conf]
  19. Pankaj K. Agarwal, Lars Arge, Ke Yi
    I/O-efficient batched union-find and its applications to terrain analysis. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:167-176 [Conf]
  20. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
    Lower Bounds for Kinetic Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:247-254 [Conf]
  21. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu
    Guarding a terrain by two watchtowers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:346-355 [Conf]
  22. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-trees and R-trees with near-optimal query time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:124-133 [Conf]
  23. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:392-401 [Conf]
  24. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:67-75 [Conf]
  25. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang
    Extreme elevation on a 2-manifold. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:357-365 [Conf]
  26. Pankaj K. Agarwal, Alon Efrat, Micha Sharir
    Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:39-50 [Conf]
  27. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:203-210 [Conf]
  28. Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter
    Cylindrical Static and Kinetic Binary Space Partitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:39-48 [Conf]
  29. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
    Computing approximate shortest paths on convex polytopes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:270-279 [Conf]
  30. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
    Hausdorff distance under translation for points and balls. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:282-291 [Conf]
  31. Pankaj K. Agarwal, Marc J. van Kreveld, Mark H. Overmars
    Intersection Queries for Curved Objects (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:41-50 [Conf]
  32. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
    Computing Many Faces in Arrangements of Lines and Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:76-84 [Conf]
  33. Pankaj K. Agarwal, T. M. Murali, Jeffrey Scott Vitter
    Practical Techniques for Constructing Binary Space Partitions for Orthogonal Rectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:382-384 [Conf]
  34. Pankaj K. Agarwal, Micha Sharir
    On the number of congruent simplices in a point. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:1-9 [Conf]
  35. Pankaj K. Agarwal, Micha Sharir
    Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:70-80 [Conf]
  36. Pankaj K. Agarwal, Micha Sharir
    Counting Circular Arc Intersections. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:10-20 [Conf]
  37. Pankaj K. Agarwal, Micha Sharir
    Efficient Randomized Algorithms for Some Geometric Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:326-335 [Conf]
  38. Pankaj K. Agarwal, Micha Sharir
    Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:143-153 [Conf]
  39. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
    The Overlay of Lower Envelopes in Three Dimensions and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:182-189 [Conf]
  40. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    Algorithms for center and Tverberg points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:61-67 [Conf]
  41. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    The Discrete 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:147-155 [Conf]
  42. Pankaj K. Agarwal, Kasturi R. Varadarajan
    A near-linear constant-factor approximation for euclidean bipartite matching? [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:247-252 [Conf]
  43. Pankaj K. Agarwal, Yusu Wang, Hai Yu
    A 2D kinetic triangulation with near-quadratic topological changes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:180-189 [Conf]
  44. Sathish Govindarajan, Mike Dietze, Pankaj K. Agarwal, James S. Clark
    A scalable simulator for forest dynamics. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:106-115 [Conf]
  45. Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir
    Similar simplices in a d-dimensional point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:232-238 [Conf]
  46. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
    Embeddings of surfaces, curves, and moving points in euclidean space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:381-389 [Conf]
  47. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
    Computing the volume of the union of cubes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:294-301 [Conf]
  48. Pankaj K. Agarwal, Hai Yu
    A space-optimal data-stream algorithm for coresets in the plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:1-10 [Conf]
  49. Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kasturi R. Varadarajan
    Practical methods for shape fitting and kinetic data structures using core sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:263-272 [Conf]
  50. James S. Clark, Pankaj K. Agarwal, Michael Lavin
    Computation and Uncertainty in Ecological Forecasting. [Citation Graph (0, 0)][DBLP]
    DG.O, 2002, pp:- [Conf]
  51. Mohammad Ali Abam, Pankaj K. Agarwal, Mark de Berg, Hai Yu
    Out-of-Order Event Processing in Kinetic Data Structures. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:624-635 [Conf]
  52. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
    Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:4-15 [Conf]
  53. Pankaj K. Agarwal, Lars Arge, Ke Yi
    I/O-Efficient Construction of Constrained Delaunay Triangulations. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:355-366 [Conf]
  54. Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi
    I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:7-18 [Conf]
  55. Pankaj K. Agarwal, Eyal Flato, Dan Halperin
    Polygon Decomposition for Efficient Construction of Minkowski Sums. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:20-31 [Conf]
  56. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas
    Kinetic Medians and kd-Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:5-16 [Conf]
  57. Pankaj K. Agarwal, Sathish Govindarajan, S. Muthukrishnan
    Range Searching in Categorical Data: Colored Range Searching on Grid. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:17-28 [Conf]
  58. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
    Near-Linear Time Approximation Algorithms for Curve Simplification. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:29-41 [Conf]
  59. Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
    Translating a Planar Object to Maximize Point Containment. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:42-53 [Conf]
  60. Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Mustafa, Suresh Venkatasubramanian
    Streaming Geometric Optimization Using Graphics Hardware. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:544-555 [Conf]
  61. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
    Approximation Algorithms for k-Line Center. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:54-63 [Conf]
  62. T. M. Murali, Pankaj K. Agarwal, Jeffrey Scott Vitter
    Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:211-222 [Conf]
  63. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    On the Complexity of Many Faces in Arrangements of Circles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:74-83 [Conf]
  64. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger
    Parametric and Kinetic Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:596-605 [Conf]
  65. Pankaj K. Agarwal, David Eppstein, Jirí Matousek
    Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:80-89 [Conf]
  66. Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter
    Binary Search Partitions for Fat Rectangles. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:482-491 [Conf]
  67. Kasturi R. Varadarajan, Pankaj K. Agarwal
    Approximating Shortest Paths on an Nonconvex Polyhedron. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:182-191 [Conf]
  68. Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir
    Computing a Center-Transversal Line. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:93-104 [Conf]
  69. Pankaj K. Agarwal, Marc J. van Kreveld
    Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1992, pp:80-91 [Conf]
  70. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:1-7 [Conf]
  71. Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
    A Framework for Index Bulk Loading and Dynamization. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:115-127 [Conf]
  72. Paul G. Flikkema, Pankaj K. Agarwal, James S. Clark, Carla Schlatter Ellis, Alan Gelfand, Kamesh Munagala, Jun Yang
    Model-Driven Dynamic Control of Embedded Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2006, pp:409-416 [Conf]
  73. Sathish Govindarajan, Pankaj K. Agarwal, Lars Arge
    CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. [Citation Graph (0, 0)][DBLP]
    ICDT, 2003, pp:143-157 [Conf]
  74. Pankaj K. Agarwal, Anne D. Collins, John Harer
    Minimal Trap Design. [Citation Graph (0, 0)][DBLP]
    ICRA, 2001, pp:2243-2248 [Conf]
  75. Anne D. Collins, Pankaj K. Agarwal, John L. Harer
    HPRM: a hierarchical PRM. [Citation Graph (0, 0)][DBLP]
    ICRA, 2003, pp:4433-4438 [Conf]
  76. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
    Output-Sensitive Algorithms for Uniform Partitions of Points. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:403-414 [Conf]
  77. Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu
    Monitoring Continuous Band-Join Queries over Dynamic Data. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:349-359 [Conf]
  78. Pankaj K. Agarwal, Jirí Matousek
    On Range Searching with Semialgebraic Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:1-13 [Conf]
  79. Pankaj K. Agarwal, Nabil H. Mustafa
    k-Means Projective Clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2004, pp:155-165 [Conf]
  80. Yusu Wang, Pankaj K. Agarwal, P. Brown, Herbert Edelsbrunner, Johannes Rudolph
    Coarse and Reliable Geometric Alignment for Protein Docking. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2005, pp:66-77 [Conf]
  81. Jonathan D. Cohen, Amitabh Varshney, Dinesh Manocha, Greg Turk, Hans Weber, Pankaj K. Agarwal, Frederick P. Brooks Jr., William V. Wright
    Simplification Envelopes. [Citation Graph (0, 0)][DBLP]
    SIGGRAPH, 1996, pp:119-128 [Conf]
  82. Cecilia Magdalena Procopiuc, Michael Jones, Pankaj K. Agarwal, T. M. Murali
    A Monte Carlo algorithm for fast projective clustering. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2002, pp:418-427 [Conf]
  83. Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter
    I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:11-20 [Conf]
  84. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun
    Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:682-690 [Conf]
  85. Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter
    I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:117-126 [Conf]
  86. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Exact and approximation algorithms for minimum-width cylindrical shells. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:510-517 [Conf]
  87. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:483-492 [Conf]
  88. Pankaj K. Agarwal, Lars Arge, Ke Yi
    An optimal dynamic interval stabbing-max data structure? [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:803-812 [Conf]
  89. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
    Efficient Generation of k-Directional Assembly Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:122-131 [Conf]
  90. Pankaj K. Agarwal, Pavan K. Desikan
    Approximation algorithms for layered manufacturing. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:528-537 [Conf]
  91. Pankaj K. Agarwal, Pavan K. Desikan
    An Efficient Algorithm for Terraine Simplification. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:139-147 [Conf]
  92. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang
    Computing the writhing number of a polygonal knot. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:791-799 [Conf]
  93. Pankaj K. Agarwal, Sariel Har-Peled
    Maintaining approximate extent measures of moving points. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:148-157 [Conf]
  94. Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
    Robust shape fitting via peeling and grating coresets. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:182-191 [Conf]
  95. Pankaj K. Agarwal, Jirí Matousek
    Relative Neighborhood Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:58-65 [Conf]
  96. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
    Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:516-525 [Conf]
  97. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
    Approximation algorithms for projective clustering. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:538-547 [Conf]
  98. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
    Exact and Approximation Algorithms for Clustering (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:658-667 [Conf]
  99. Pankaj K. Agarwal, Micha Sharir
    Pseudo-line arrangements: duality, algorithms, and applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:800-809 [Conf]
  100. Pankaj K. Agarwal, Micha Sharir
    Planar Geometric Location Problems and Maintaining the Width of a Planar Set. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:449-458 [Conf]
  101. Pankaj K. Agarwal, Micha Sharir
    Ray Shooting Amidst Convex Polytopes in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:260-270 [Conf]
  102. Pankaj K. Agarwal, Subhash Suri
    Surface Approximation and Geometric Partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:24-33 [Conf]
  103. Pankaj K. Agarwal, Micha Sharir
    Motion Planning of a Ball Amid Segments in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:21-30 [Conf]
  104. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
    Applications of Parametric Searching in Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:72-82 [Conf]
  105. Pankaj K. Agarwal, Yusu Wang, Peng Yin
    Lower bound for sparse Euclidean spanners. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:670-671 [Conf]
  106. Kasturi R. Varadarajan, Pankaj K. Agarwal
    Approximation Algorithms for Bipartite and Non-Bipartite Matching in the Plane. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:805-814 [Conf]
  107. Hongyan Wang, Pankaj K. Agarwal
    Approximation Algorithms for Curvature-Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:409-418 [Conf]
  108. Octavian Procopiuc, Pankaj K. Agarwal, Lars Arge, Jeffrey Scott Vitter
    Bkd-Tree: A Dznamic Scalable kd-Tree. [Citation Graph (0, 0)][DBLP]
    SSTD, 2003, pp:46-65 [Conf]
  109. Pankaj K. Agarwal, Jirí Matousek
    Ray Shooting and Parametric Search [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:517-526 [Conf]
  110. Pankaj K. Agarwal, Prabhakar Raghavan, Hisao Tamaki
    Motion planning for a steering-constrained robot through moderate obstacles. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:343-352 [Conf]
  111. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Star Unfolding of a Polytope with Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:251-263 [Conf]
  112. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
    Computing the Penetration Depth of Two Convex Polytopes in 3D. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:328-338 [Conf]
  113. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
    Computing Depth Orders and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:1-12 [Conf]
  114. Pankaj K. Agarwal, Nabil H. Mustafa
    Independent Set of Intersection Graphs of Convex Objects in 2D. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:127-137 [Conf]
  115. Pankaj K. Agarwal, Sandeep Sen
    Selection in Monotone Matrices and Computing kth Nearest Neighbors. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:13-24 [Conf]
  116. Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
    Intersection Queries in Sets of Disks. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:393-403 [Conf]
  117. Pankaj K. Agarwal, Junyi Xie, Jun Yang, Hai Yu
    Scalable Continuous Query Processing by Tracking Hotspots. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:31-42 [Conf]
  118. Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
    Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:315-327 [Conf]
  119. Vicky Choi, Pankaj K. Agarwal, Herbert Edelsbrunner, Johannes Rudolph
    Local Search Heuristic for Rigid Protein Docking. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:218-229 [Conf]
  120. Jeff M. Phillips, Johannes Rudolph, Pankaj K. Agarwal
    Segmenting Motifs in Protein-Protein Interface Surfaces. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:207-218 [Conf]
  121. Pankaj K. Agarwal, Lars Arge, Jan Vahrenhold
    Time Responsive External Data Structures for Moving Points. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:50-61 [Conf]
  122. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
    Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:122-134 [Conf]
  123. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
    Maintaining the Extent of a Moving Point Set. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:31-44 [Conf]
  124. Pankaj K. Agarwal, Marc J. van Kreveld
    Connected Component and Simple Polygon Intersection Searching (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:36-47 [Conf]
  125. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
    Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:105-116 [Conf]
  126. Pankaj K. Agarwal, Micha Sharir
    Applications of a New Space Partitioning Technique. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:379-391 [Conf]
  127. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:5, pp:495-514 [Journal]
  128. Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep Sen
    Improved Algorithms for Uniform Partitions of Points. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:521-539 [Journal]
  129. Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia
    Computing Approximate Shortest Paths on Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:227-242 [Journal]
  130. Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang
    Near-Linear Time Approximation Algorithms for Curve Simplification. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:203-219 [Journal]
  131. Pankaj K. Agarwal, Marc J. van Kreveld
    Connected Component and Simple Polygon Intersection Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:6, pp:626-660 [Journal]
  132. Pankaj K. Agarwal, Jirí Matousek
    Dynamic Half-Space Range Reporting and Its Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:4, pp:325-345 [Journal]
  133. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
    Exact and Approximation Algorithms for Clustering. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:201-226 [Journal]
  134. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
    Approximation Algorithms for a k-Line Center. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:3-4, pp:221-230 [Journal]
  135. Pankaj K. Agarwal, Micha Sharir
    Planar Geometric Location Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:2, pp:185-195 [Journal]
  136. Marc J. van Kreveld, Mark H. Overmars, Pankaj K. Agarwal
    Intersection Queries in Sets of Disks. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:268-279 [Journal]
  137. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:1-9 [Journal]
  138. Pankaj K. Agarwal
    On Stabbling Lines for Convex Polyhedra in 3D. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:177-189 [Journal]
  139. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold
    Reporting intersecting pairs of convex polytopes in two and three dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:195-207 [Journal]
  140. Pankaj K. Agarwal, Eyal Flato, Dan Halperin
    Polygon decomposition for efficient construction of Minkowski sums. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:21, n:1-2, pp:39-61 [Journal]
  141. Pankaj K. Agarwal, Leonidas J. Guibas, T. M. Murali, Jeffrey Scott Vitter
    Cylindrical static and kinetic binary space partitions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:2, pp:103-127 [Journal]
  142. Pankaj K. Agarwal, Leonidas J. Guibas, An Thai Nguyen, Daniel Russel, Li Zhang
    Collision detection for deforming necklaces. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:137-163 [Journal]
  143. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
    Computing Depth Orders for Fat Objects and Related Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:187-206 [Journal]
  144. Pankaj K. Agarwal, Marc J. van Kreveld, Subhash Suri
    Label placement by maximum independent set in rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:3-4, pp:209-218 [Journal]
  145. Pankaj K. Agarwal, Nabil H. Mustafa
    Independent set of intersection graphs of convex objects in 2D. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:83-95 [Journal]
  146. Pankaj K. Agarwal, Jirí Matousek
    Relative Neighborhood Graphs in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:1-14 [Journal]
  147. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
    Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:189-201 [Journal]
  148. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc, Kasturi R. Varadarajan
    A (1+)-approximation algorithm for 2-line-center. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:2, pp:119-128 [Journal]
  149. Pankaj K. Agarwal, Micha Sharir
    Off-line Dynamic Maintenance of the Width of a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:65-78 [Journal]
  150. Pankaj K. Agarwal, Joseph O'Rourke
    Computational Geometry Column 34 [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  151. 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
    Emerging Challenges in Computational Topology [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  152. 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
    Algorithmic issues in modeling motion. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:550-572 [Journal]
  153. Pankaj K. Agarwal, Subhash Suri
    Simple and Practical Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:16- [Journal]
  154. Pankaj K. Agarwal, Micha Sharir
    Efficient Algorithms for Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1998, v:30, n:4, pp:412-458 [Journal]
  155. Pankaj K. Agarwal
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:185-186 [Journal]
  156. Pankaj K. Agarwal
    Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:449-483 [Journal]
  157. Pankaj K. Agarwal
    Parititoning Arrangements of Lines II: Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:533-573 [Journal]
  158. Pankaj K. Agarwal, Boris Aronov
    Counting Facets and Incidences. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:359-369 [Journal]
  159. Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhash Suri
    Can Visibility Graphs Be Represented Compactly?. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:347-365 [Journal]
  160. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir
    On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:315-331 [Journal]
  161. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:687-705 [Journal]
  162. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    Lines Avoiding Unit Balls in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:2, pp:231-250 [Journal]
  163. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:307-320 [Journal]
  164. Pankaj K. Agarwal, Nina Amenta, Micha Sharir
    Largest Placement of One Convex Polygon Inside Another. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:1, pp:95-104 [Journal]
  165. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Motion Planning for a Convex Polygon in a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:2, pp:201-221 [Journal]
  166. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:3, pp:373-388 [Journal]
  167. Pankaj K. Agarwal, Julien Basch, Mark de Berg, Leonidas J. Guibas, John Hershberger
    Lower Bounds for Kinetic Planar Subdivisions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:721-733 [Journal]
  168. Pankaj K. Agarwal, Robert-Paul Berretty, Anne D. Collins
    A Near-Quadratic Algorithm for Fence Design. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:3, pp:463-481 [Journal]
  169. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-Trees and R-Trees with Near-Optimal Query Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:3, pp:291-312 [Journal]
  170. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:407-422 [Journal]
  171. Pankaj K. Agarwal, Herbert Edelsbrunner, Yusu Wang
    Computing the Writhing Number of a Polygonal Knot. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:1, pp:37-53 [Journal]
  172. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, Eric Veach
    Maintaining the Extent of a Moving Point Set. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:353-374 [Journal]
  173. Pankaj K. Agarwal, Dan Halperin, Richard Pollack
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:505-506 [Journal]
  174. Pankaj K. Agarwal, Jirí Matousek
    On Range Searching with Semialgebraic Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:393-418 [Journal]
  175. Pankaj K. Agarwal, Micha Sharir
    Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:645-657 [Journal]
  176. Pankaj K. Agarwal, Micha Sharir
    Applications of a New Space-Partitioning Technique. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:11-38 [Journal]
  177. Pankaj K. Agarwal, Micha Sharir
    On the Number of Views of Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:177-182 [Journal]
  178. Pankaj K. Agarwal, Micha Sharir
    Efficient Randomized Algorithms for Some Geometric. Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:317-337 [Journal]
  179. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
    The Overlay of Lower Envelopes and Its Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:1-13 [Journal]
  180. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    The Discrete 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:287-305 [Journal]
  181. Pankaj K. Agarwal, Kasturi R. Varadarajan
    Efficient Algorithms for Approximating Polygonal Chains. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:2, pp:273-291 [Journal]
  182. Pankaj K. Agarwal, Yusu Wang, Hai Yu
    A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:573-592 [Journal]
  183. Pankaj K. Agarwal, Herbert Edelsbrunner, John Harer, Yusu Wang
    Extreme Elevation on a 2-Manifold. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:553-572 [Journal]
  184. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
    Advances in Indexing for Mobile Objects. [Citation Graph (0, 0)][DBLP]
    IEEE Data Eng. Bull., 2002, v:25, n:2, pp:25-34 [Journal]
  185. Pankaj K. Agarwal
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:4/5, pp:325-0 [Journal]
  186. Pankaj K. Agarwal, Marc J. van Kreveld
    Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1994, v:4, n:4, pp:369-383 [Journal]
  187. Pankaj K. Agarwal, Joseph O'Rourke
    Computational Geometry Column 34. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:5/6, pp:637-0 [Journal]
  188. Pankaj K. Agarwal, Micha Sharir
    Circular visibility of a simple polygon from a fixed point. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:1-25 [Journal]
  189. Pankaj K. Agarwal, Julien Basch, Leonidas J. Guibas, John Hershberger, Li Zhang
    Deformable Free-Space Tilings for Kinetic Collision Detection. [Citation Graph (0, 0)][DBLP]
    I. J. Robotic Res., 2002, v:21, n:3, pp:179-198 [Journal]
  190. Kasturi R. Varadarajan, Pankaj K. Agarwal
    Linear Approximation of Simple Objects. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:2, pp:89-94 [Journal]
  191. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
    Approximating shortest paths on a convex polytope in three dimensions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:4, pp:567-584 [Journal]
  192. Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan
    Approximating extent measures of points. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:606-635 [Journal]
  193. Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:139-186 [Journal]
  194. Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo
    Computing a Segment Center for a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:2, pp:314-323 [Journal]
  195. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
    Approximation algorithms for projective clustering. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:46, n:2, pp:115-139 [Journal]
  196. Pankaj K. Agarwal, Micha Sharir
    Circle Shooting in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:1, pp:69-87 [Journal]
  197. Pankaj K. Agarwal, Sandeep Sen
    Selection in Monotone Matrices and Computing kth Nearest Neighbors. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:3, pp:581-601 [Journal]
  198. Pankaj K. Agarwal, Micha Sharir
    Ray Shooting Amidst Convex Polygons in 2D. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:508-519 [Journal]
  199. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
    Applications of Parametric Searching in Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:292-318 [Journal]
  200. Samir Khuller, Pankaj K. Agarwal, Joseph O'Rourke
    Open Problems Presented at SCG'98. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:30, n:2, pp:449-453 [Journal]
  201. Pankaj K. Agarwal, Lars Arge, Jeff Erickson
    Indexing Moving Points. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:1, pp:207-243 [Journal]
  202. Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo Giulio Franciosa, Jeffrey Scott Vitter
    Efficient Searching with Linear Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:2, pp:194-216 [Journal]
  203. Pankaj K. Agarwal, Micha Sharir, Peter W. Shor
    Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:228-274 [Journal]
  204. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
    Penetration Depth of Two Convex Polytopes in 3D. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:227-240 [Journal]
  205. Pankaj K. Agarwal
    Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:540-570 [Journal]
  206. Pankaj K. Agarwal, Boris Aronov, Joseph O'Rourke, Catherine A. Schevon
    Star Unfolding of a Polytope with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1689-1713 [Journal]
  207. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Computing Envelopes in Four Dimensions with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1714-1732 [Journal]
  208. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
    Curvature-Constrained Shortest Paths in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1814-1851 [Journal]
  209. Pankaj K. Agarwal, Mark de Berg, Jirí Matousek, Otfried Schwarzkopf
    Constructing Levels in Arrangements and Higher Order Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:3, pp:654-667 [Journal]
  210. Pankaj K. Agarwal, Alon Efrat, Micha Sharir
    Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:912-953 [Journal]
  211. Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter
    Binary Space Partitions for Fat Rectangles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1422-1448 [Journal]
  212. Pankaj K. Agarwal, Jirí Matousek
    Ray Shooting and Parametric Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:794-806 [Journal]
  213. Pankaj K. Agarwal, Jirí Matousek, Otfried Schwarzkopf
    Computing Many Faces in Arrangements of Lines and Segments. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:491-505 [Journal]
  214. Pankaj K. Agarwal, Marco Pellegrini, Micha Sharir
    Counting Circular Arc Intersections. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:778-793 [Journal]
  215. Pankaj K. Agarwal, Micha Sharir
    Pseudo-Line Arrangements: Duality, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:526-552 [Journal]
  216. Pankaj K. Agarwal, Micha Sharir
    Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:297-321 [Journal]
  217. Pankaj K. Agarwal, Micha Sharir
    Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:1, pp:100-116 [Journal]
  218. Pankaj K. Agarwal, Subhash Suri
    Surface Approximation and Geometric Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1016-1035 [Journal]
  219. Pankaj K. Agarwal, Hongyan Wang
    Approximation Algorithms for Curvature-Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1739-1772 [Journal]
  220. Kasturi R. Varadarajan, Pankaj K. Agarwal
    Approximating Shortest Paths on a Nonconvex Polyhedron. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1321-1340 [Journal]
  221. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
    Computing Maximally Separated Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:815-834 [Journal]
  222. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun
    Efficient algorithms for bichromatic separability. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:209-227 [Journal]
  223. Yonatan Bilu, Pankaj K. Agarwal, Rachel Kolodny
    Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:4, pp:408-422 [Journal]
  224. Pankaj K. Agarwal, David J. Brady, Jirí Matousek
    Segmenting object space by geometric reference structures. [Citation Graph (0, 0)][DBLP]
    TOSN, 2006, v:2, n:4, pp:455-465 [Journal]
  225. Jeff M. Phillips, Pankaj K. Agarwal
    On Bipartite Matching under the RMS Distance. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  226. Paul G. Flikkema, Pankaj K. Agarwal, James S. Clark, Carla Schlatter Ellis, Alan Gelfand, Kamesh Munagala, Jun Yang
    From Data Reverence to Data Relevance: Model-Mediated Wireless Sensing of the Physical Environment. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (1), 2007, pp:988-994 [Conf]
  227. Sathish Govindarajan, Michael C. Dietze, Pankaj K. Agarwal, James S. Clark
    A scalable algorithm for dispersing population. [Citation Graph (0, 0)][DBLP]
    J. Intell. Inf. Syst., 2007, v:29, n:1, pp:39-61 [Journal]
  228. Yunhui Zheng, David J. Brady, Pankaj K. Agarwal
    Localization using boundary sensors: An analysis based on graph theory. [Citation Graph (0, 0)][DBLP]
    TOSN, 2007, v:3, n:4, pp:- [Journal]

  229. Untangling triangulations through local explorations. [Citation Graph (, )][DBLP]


  230. I/o-efficient efficient algorithms for computing contours on a terrain. [Citation Graph (, )][DBLP]


  231. Near-linear approximation algorithms for geometric hitting sets. [Citation Graph (, )][DBLP]


  232. Computing similarity between piecewise-linear functions. [Citation Graph (, )][DBLP]


  233. Kinetic stable Delaunay graphs. [Citation Graph (, )][DBLP]


  234. An improved algorithm for computing the volume of the union of cubes. [Citation Graph (, )][DBLP]


  235. The 2-center problem in three dimensions. [Citation Graph (, )][DBLP]


  236. Efficient Sensor Placement for Surveillance Problems. [Citation Graph (, )][DBLP]


  237. Stabbing Convex Polygons with a Segment or a Polygon. [Citation Graph (, )][DBLP]


  238. An Efficient Algorithm for 2D Euclidean 2-Center with Outliers. [Citation Graph (, )][DBLP]


  239. Stability of epsilon-Kernels. [Citation Graph (, )][DBLP]


  240. TerraStream: from elevation data to watershed hierarchies. [Citation Graph (, )][DBLP]


  241. On Channel-Discontinuity-Constraint Routing in Wireless Networks. [Citation Graph (, )][DBLP]


  242. Modeling and Analyzing Massive Terrain Data Sets. [Citation Graph (, )][DBLP]


  243. Lipschitz Unimodal and Isotonic Regression on Paths and Trees. [Citation Graph (, )][DBLP]


  244. Indexing uncertain data. [Citation Graph (, )][DBLP]


  245. ProSem: scalable wide-area publish/subscribe. [Citation Graph (, )][DBLP]


  246. Approximate Euclidean shortest paths amid convex obstacles. [Citation Graph (, )][DBLP]


  247. Streaming Algorithms for Extent Problems in High Dimensions. [Citation Graph (, )][DBLP]


  248. On Approximate Geodesic-Distance Queries amid Deforming Point Clouds. [Citation Graph (, )][DBLP]


  249. Scalable algorithms for large high-resolution terrain data. [Citation Graph (, )][DBLP]


  250. Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets. [Citation Graph (, )][DBLP]


  251. An Efficient Algorithm for 2D Euclidean 2-Center with Outliers [Citation Graph (, )][DBLP]


  252. On Channel-Discontinuity-Constraint Routing in Wireless Networks [Citation Graph (, )][DBLP]


  253. Lipschitz Unimodal and Isotonic Regression on Paths and Trees [Citation Graph (, )][DBLP]


  254. Stability of epsilon-Kernels [Citation Graph (, )][DBLP]


  255. On polyhedra induced by point sets in space. [Citation Graph (, )][DBLP]


  256. Computing external farthest neighbors for a simple polygon. [Citation Graph (, )][DBLP]


  257. Robust Shape Fitting via Peeling and Grating Coresets. [Citation Graph (, )][DBLP]


  258. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. [Citation Graph (, )][DBLP]


Search in 0.109secs, Finished in 0.122secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002