Pankaj K. Agarwal

Pankaj K. Agarwal's AcademicInfluence.com Rankings

Pankaj K. Agarwal

Computer Science

#2487

World Rank

#2597

Historical Rank

Database

#1864

World Rank

#1955

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Pankaj K. Agarwal's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University

Similar Degrees You Can Earn

Why Is Pankaj K. Agarwal Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Pankaj Kumar Agarwal is an Indian computer scientist and mathematician researching algorithms in computational geometry and related areas. He is the RJR Nabisco Professor of Computer Science and Mathematics at Duke University, where he has been chair of the computer science department since 2004. He obtained his Doctor of Philosophy in computer science in 1989 from the Courant Institute of Mathematical Sciences, New York University, under the supervision of Micha Sharir.

(See a Problem?)

Pankaj K. Agarwal's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Davenport-Schinzel sequences and their geometric applications (1995) (931)
Simplification envelopes (1996) (603)
A Monte Carlo algorithm for fast projective clustering (2002) (417)
Combinatorial geometry (1995) (407)
Exact and Approximation Algorithms for Clustering (1998) (383)
Geometric Approximation via Coresets (2007) (381)
Geometric Range Searching and Its Relatives (2007) (376)
Approximating extent measures of points (2004) (354)
Indexing Moving Points (2003) (270)
Efficient algorithms for geometric optimization (1998) (267)
Label placement by maximum independent set in rectangles (1998) (234)
Arrangements and Their Applications (2000) (229)
The Resilience of WDM Networks to Probabilistic Geographical Failures (2011) (224)
Ray shooting and parametric search (1992) (223)
Wiley‐Interscience Series in Discrete Mathematics and Optimization (2011) (206)
Combinatorial Geometry: Pach/Combinatorial (1995) (205)
k-means projective clustering (2004) (204)
Resolving the biodiversity paradox. (2007) (203)
Surface approximation and geometric partitions (1994) (199)
On range searching with semialgebraic sets (1992) (194)
Applications of parametric searching in geometric optimization (1992) (191)
Euclidean minimum spanning trees and bichromatic closest pairs (1990) (191)
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications (1995) (177)
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (2015) (169)
Near-Linear Time Approximation Algorithms for Curve Simplification (2002) (159)
Mergeable summaries (2012) (148)
Extreme Elevation on a 2-Manifold (2004) (147)
Computing the Discrete Fréchet Distance in Subquadratic Time (2012) (146)
Polygon decomposition for efficient construction of Minkowski sums (2000) (141)
Constructing levels in arrangements and higher order Voronoi diagrams (1994) (140)
Quasi-planar graphs have a linear number of edges (1995) (137)
Toward Computational Fact-Checking (2014) (133)
Deformable Free-Space Tilings for Kinetic Collision Detection† (2002) (131)
Bkd-Tree: A Dznamic Scalable kd-Tree (2003) (129)
Indexing moving points (extended abstract) (2000) (118)
Efficient Algorithms for Approximating Polygonal Chains (2000) (95)
Star Unfolding of a Polytope with Applications (1997) (94)
Partitioning arrangements of lines II: Applications (2011) (94)
The overlay of lower envelopes and its applications (1996) (94)
Efficient searching with linear constraints (1998) (92)
Motion planning for a steering-constrained robot through moderate obstacles (1995) (92)
Box-Trees and R-Trees with Near-Optimal Query Time (2001) (86)
KBGIS-II A knowledge-based geographical information system (1986) (86)
TerraStream: from elevation data to watershed hierarchies (2007) (84)
Curvature-Constrained Shortest Paths in a Convex Polygon (2002) (84)
Penetration Depth of Two Convex Polytopes in 3D (2000) (83)
Efficient randomized algorithms for some geometric optimization problems (1995) (83)
Ray shooting and other applications of spanning trees with low stabbing number (1992) (81)
Computing envelopes in four dimensions with applications (1994) (81)
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects (2002) (81)
Dynamic half-space range reporting and its applications (2005) (80)
Network vulnerability to single, multiple, and probabilistic physical attacks (2010) (79)
Selecting distances in the plane (1990) (79)
On levels in arrangements of lines, segments, planes, and triangles (1997) (78)
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers (2014) (78)
Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions (1991) (78)
Approximation algorithms for curvature-constrained shortest paths (1996) (77)
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions (1997) (75)
The Discrete 2-Center Problem (1997) (74)
Processing a large number of continuous preference top-k queries (2012) (73)
Algorithmic issues in modeling motion (2002) (72)
Maintaining approximate extent measures of moving points (2001) (71)
Lenses in arrangements of pseudo-circles and their applications (2004) (67)
Independent set of intersection graphs of convex objects in 2D (2004) (67)
Approximation Algorithms for k-Line Center (2002) (65)
Can visibility graphs Be represented compactly? (1993) (65)
Streaming Geometric Optimization Using Graphics Hardware (2003) (63)
Kinetic binary space partitions for intersecting segments and disjoint triangles (1998) (63)
On Range Searching with Semialgebraic Sets II (2012) (62)
Mergeable summaries (2013) (62)
Parametric and kinetic minimum spanning trees (1998) (61)
Computing the Gromov-Hausdorff Distance for Metric Trees (2015) (61)
Computing many faces in arrangements of lines and segments (1994) (59)
Cylindrical static and kinetic binary space partitions (1997) (59)
A near-linear constant-factor approximation for euclidean bipartite matching? (2004) (59)
Maintaining the Extent of a Moving Point Set (1997) (59)
Approximating shortest paths on a nonconvex polyhedron (1997) (59)
Approximation algorithms for bipartite and non-bipartite matching in the plane (1999) (58)
Approximation algorithms for projective clustering (2000) (58)
Nearest-Neighbor Searching Under Uncertainty I (2012) (58)
I/O-efficient algorithms for contour-line extraction and planar graph blocking (1998) (57)
Streaming Algorithms for Extent Problems in High Dimensions (2010) (56)
Intersection and decomposition algorithms for planar arrangements (1991) (55)
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets (2004) (55)
Applications of a New Space Partitioning Technique (1991) (55)
Emerging Challenges in Computational Topology (1999) (54)
From Point Cloud to Grid DEM: A Scalable Approach (2006) (54)
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions (1999) (53)
Kinetic Medians and kd-Trees (2002) (53)
Approximating shortest paths on a convex polytope in three dimensions (1997) (52)
Algorithms for the transportation problem in geometric settings (2012) (51)
Partitioning arrangements of lines I: An efficient deterministic algorithm (2011) (50)
Applications of a new space-partitioning technique (1993) (50)
Nonholonomic path planning for pushing a disk among obstacles (1997) (49)
I/O-efficient batched union-find and its applications to terrain analysis (2006) (48)
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection (1990) (48)
Largest Placement of One Convex Polygon Inside Another (1998) (48)
State of the Union (of geometric objects) (2008) (47)
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries (2003) (46)
A near-linear time ε-approximation algorithm for geometric bipartite matching (2012) (46)
State of the Union ( of Geometric Objects ) : A Review ∗ (2007) (46)
Computing Depth Orders for Fat Objects and Related Problems (1995) (46)
I/O-Efficient Construction of Constrained Delaunay Triangulations (2005) (45)
Computing Approximate Shortest Paths on Convex Polytopes (2000) (45)
A simple and efficient algorithm for high-quality line labeling (2001) (44)
Robust Shape Fitting via Peeling and Grating Coresets (2006) (44)
Natural neighbor interpolation based grid DEM construction using a GPU (2010) (44)
Motion Planning for a Convex Polygon in a Polygonal Environment (1999) (43)
Range Searching (1996) (43)
Binary space partitions for fat rectangles (1996) (42)
Pseudo-line arrangements: duality, algorithms, and applications (2002) (42)
Embeddings of surfaces, curves, and moving points in euclidean space (2007) (42)
Nearest neighbor searching under uncertainty II (2016) (42)
Convex Hulls Under Uncertainty (2014) (42)
Relative neighborhood graphs in three dimensions (1992) (42)
Sparsification of motion-planning roadmaps by edge contraction (2012) (42)
A Framework for Index Bulk Loading and Dynamization (2001) (41)
Range Searching in Categorical Data: Colored Range Searching on Grid (2002) (41)
Approximation algorithms for bipartite matching with metric and geometric costs (2014) (41)
Intersection Queries in Curved Objects (1993) (40)
Approximation and exact algorithms for minimum-width annuli and shells (1999) (40)
An efficient algorithm for terrain simplification (1997) (40)
Range searching on uncertain data (2012) (40)
Model-driven matching and segmentation of trajectories (2013) (39)
Geometric Partitioning and its Applications (1990) (39)
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D (2008) (38)
Computing the Writhing Number of a Polygonal Knot (2002) (38)
(Approximate) Uncertain Skylines (2011) (38)
Cache-oblivious data structures for orthogonal range searching (2003) (37)
On levels in arrangements of lines (1998) (37)
Counting facets and incidences (1992) (37)
Kinetic and dynamic data structures for closest pair and all nearest neighbors (2008) (37)
Planar geometric location problems (1994) (36)
Dynamic half-space reporting, geometric optimization, and minimum spanning trees (1992) (35)
Computational Fact Checking through Query Perturbations (2017) (35)
Ray Shooting Amidst Convex Polygons in 2D (1996) (34)
Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences (2015) (34)
Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions (1996) (33)
I/O-efficient dynamic point location in monotone planar subdivisions (1999) (32)
A space-optimal data-stream algorithm for coresets in the plane (2007) (32)
Union of Random Minkowski Sums and Network Vulnerability Analysis (2013) (32)
Coarse and Reliable Geometric Alignment for Protein Docking (2004) (32)
Algorithms for special cases of rectilinear steiner trees: I. Points on the boundary of a rectilinear rectangle (1990) (31)
Efficient Algorithms for k-Regret Minimizing Sets (2017) (31)
Subtrajectory Clustering: Models and Algorithms (2018) (30)
A deterministic algorithm for partitioning arrangements of lines and its application (1989) (29)
Lower Bounds for Kinetic Planar Subdivisions (1999) (29)
OPEN PROBLEMS IN DATA STREAMS AND RELATED TOPICS IITK WORKSHOP ON ALGORITHMS FOR DATA STREAMS ’06 (2007) (29)
On Bipartite Matching under the RMS Distance (2006) (28)
Computing a Segment Center for a Planar Point Set (1993) (28)
The Number of Congruent Simplices in a Point Set (2002) (27)
Inferential ecosystem models, from network data to prediction. (2011) (27)
Simplex Range Searching and Its Variants: A Review (2017) (27)
Off-line Dynamic Maintenance of the Width of a Planar Point Set (1991) (27)
Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures (2016) (27)
On Levels in Arrangements of Lines, Segments, Planes, and Triangles% (1998) (27)
Advances in Indexing for Mobile Objects (2002) (26)
Approximate Euclidean shortest paths amid convex obstacles (2009) (26)
Fast Molecular Shape Matching Using Contact Maps (2007) (26)
Counting circular arc intersections (1991) (26)
On the number of views of polyhedral terrains (1993) (26)
Kinetic bsps for intersecting segments and disjoint triangles (1998) (26)
Algorithms for center and Tverberg points (2004) (26)
Hausdorff distance under translation for points and balls (2003) (26)
Efficient generation of k-directional assembly sequences (1996) (26)
Randomized Algorithms for Geometric Optimization Problems (2001) (25)
An optimal dynamic interval stabbing-max data structure? (2005) (24)
Stabbing triangulations by lines in 3D (1995) (24)
Planar geometric location problems and maintaining the width of a planar set (1991) (24)
Efficient Sensor Placement for Surveillance Problems (2009) (24)
Faster Algorithms for the Geometric Transportation Problem (2019) (24)
Kinetic stable Delaunay graphs (2010) (24)
Staying in the Middle: Exact and Approximate Medians in R1 and R2 for Moving Points (2005) (23)
Near-Linear Approximation Algorithms for Geometric Hitting Sets (2009) (23)
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells (2000) (23)
Scalable continuous query processing by tracking hotspots (2006) (23)
Range-Max Queries on Uncertain Data (2016) (22)
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles (2016) (22)
Computing the Detour of Polygonal Curves (2002) (22)
A simple efficient approximation algorithm for dynamic time warping (2016) (22)
Open Problems in Data Streams, Property Testing, and Related Topics (2011) (21)
Translating a Planar Object to Maximize Point Containment (2002) (21)
I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries (2003) (20)
Circle Shooting in a Simple Polygon (1993) (20)
EÆcient Searching with Linear Constraints (1997) (20)
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (2018) (20)
Computing the volume of the union of cubes (2007) (20)
Computing Depth Orders and Related Problems (1994) (20)
Selection in Monotone Matrices and Computing kth Nearest Neighbors (1994) (19)
Davenport{schinzel Sequences and Their Geometric Applications 1 Davenport{schinzel Sequences and Their Geometric Applications (1995) (19)
Largest Placements and Motion Planning of a Convex Polygon (1996) (19)
Top-k preferences in high dimensions (2014) (18)
Minimal trap design (2001) (18)
Practical techniques for constructing binary space partitions for orthogonal rectangles (1997) (18)
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers (2008) (17)
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons (2005) (17)
Time Responsive External Data Structures for Moving Points (2001) (17)
Guarding a Terrain by Two Watchtowers (2005) (17)
Lower bound for sparse Euclidean spanners (2005) (17)
On "one of the few" objects (2012) (17)
ProSem: scalable wide-area publish/subscribe (2008) (16)
Approximation Algorithms for Minimum-Width Annuli and Shells (2000) (16)
A scalable algorithm for dispersing population (2007) (16)
Curvature-constrained shortest paths in a convex polygon (extended abstract) (1998) (16)
I/O-efficient batched union-find and its applications to terrain analysis (2010) (15)
Markov-modulated Marked Poisson Processes for Check-in Data (2016) (15)
On the Complexity of Many Faces in Arrangements of Pseudo-Segments and Circles (2003) (15)
Robotics : the algorithmic perspective : the Third Workshop on the Algorithmic Foundations of Robotics (1998) (15)
Similar simplices in a d-dimensional point set (2007) (15)
Exact and Approximation Algorithms for Clustering (Extended Abstract) (1998) (14)
Generating Levels of Detail for Large-Scale Polygonal Models (1995) (14)
An improved algorithm for computing the volume of the union of cubes (2010) (14)
The 2-center problem in three dimensions (2010) (14)
Computing Similarity between a Pair of Trajectories (2013) (14)
Algorithmic Techniques for Geometric Optimization (1995) (14)
Nearest-Neighbor Searching Under Uncertainty II (2016) (14)
Lines Avoiding Unit Balls in Three Dimensions (2005) (14)
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem (13)
A (1+)-approximation algorithm for 2-line-center (2003) (13)
A scalable simulator for forest dynamics (2004) (13)
Efficient algorithms for bichromatic separability (2004) (13)
Intersection queries in sets of disks (1990) (13)
Local Search Heuristic for Rigid Protein Docking (2004) (13)
Arrangements of surfaces in higher dimensions (1999) (13)
Localization using boundary sensors: An analysis based on graph theory (2007) (13)
The overlay of lower envelopes in three dimensions and its applications (1995) (13)
A 2D kinetic triangulation with near-quadratic topological changes (2004) (13)
E cient Algorithms for Geometric Optimization (1998) (12)
Model-Driven Dynamic Control of Embedded Wireless Sensor Networks (2006) (12)
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries (2012) (12)
Kinetic binary space partitions for triangles (1998) (12)
On Channel-Discontinuity-Constraint Routing in Wireless Networks (2009) (12)
Approximation algorithms for layered manufacturing (2000) (12)
I/o-efficient efficient algorithms for computing contours on a terrain (2008) (11)
Genetic Algorithm Based Approach for Obtaining Alignment of Multiple Sequences (2012) (11)
iCheck: computationally combating "lies, d--ned lies, and statistics" (2014) (11)
Computing external farthest neighbors for a simple polygon (2015) (11)
Approximation Algorithms for a k-Line Center (2005) (11)
Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks (2004) (10)
Scalable algorithms for large high-resolution terrain data (2010) (10)
On Stabbling Lines for Convex Polyhedra in 3D (1994) (10)
On the number of congruent simplices in a point (2001) (10)
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions (2014) (10)
Maintaining Contour Trees of Dynamic Terrains (2014) (10)
On Polyhedra Induced by Point Sets in Space (2003) (10)
Segmenting object space by geometric reference structures (2006) (10)
Finding Diverse, High-Value Representatives on a Surface of Answers (2017) (10)
Stabbing Convex Polygons with a Segment or a Polygon (2008) (10)
Untangling triangulations through local explorations (2008) (9)
HPRM: a hierarchical PRM (2003) (9)
Hausdor Distance under Translation for Points, Disks, and Balls (2002) (9)
TerraNNI: natural neighbor interpolation on a 3D grid using a GPU (2011) (9)
Connected component and simple polygon intersection searching (1996) (8)
Intersection queries for curved objects (extended abstract) (1991) (8)
A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes (2006) (8)
Monitoring Continuous Band-Join Queries over Dynamic Data (2005) (8)
Flood Risk Analysis on Terrains (2017) (8)
Lipschitz Unimodal and Isotonic Regression on Paths and Trees (2009) (8)
Stable Delaunay Graphs (2015) (8)
Reporting intersecting pairs of convex polytopes in two and three dimensions (2002) (8)
Efficient external memory structures for range-aggregate queries (2013) (8)
Durable Top-k Queries on Temporal Data (2018) (8)
Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains (2016) (7)
Flood-risk analysis on terrains under the multiflow-direction model (2018) (7)
Computing highly occluded paths on a terrain (2013) (7)
Intersection and decomposition algorithms for arrangements of curves in the plane (1989) (7)
Computing Shortest Paths in the Plane with Removable Obstacles (2018) (7)
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead (2019) (7)
Ray shooting amidst convex polytopes in three dimensions (1993) (7)
Dynamic Geometric Set Cover and Hitting Set (2020) (7)
Contour trees of uncertain terrains (2015) (7)
Pseudoline Arrangements : Duality , Algorithms , and Applications (2001) (7)
Input-sensitive scalable continuous join query processing (2009) (7)
Geometric techniques for clustering: theory and practice (2001) (7)
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects (2004) (7)
On the complexity of many faces in arrangements of circles (2001) (7)
Algorithms for center and Tverberg points (2008) (7)
Nearest-Neighbor Searching Under Uncertainty I (2017) (7)
An E cient Algorithm for Terrain Simpli cation (1997) (6)
TerraNNI: Natural Neighbor Interpolation on 2D and 3D Grids Using a GPU (2016) (6)
Generating Wide-Area Content-Based Publish/Subscribe Workloads (2009) (6)
Small and stable descriptors of distributions for geometric statistical problems (2009) (6)
Lower Bounds for Kinetic Planar Subdivisions (2000) (6)
I/O-Efficient Algorithms for Computing Contours on a Terrain (2008) (6)
Out-of-Order Event Processing in Kinetic Data Structures (2006) (6)
Distributed localization and clustering using data correlation and the Occam's razor principle (2011) (6)
MSA-GA: Multiple Sequence Alignment Tool Based On Genetic Approach (2013) (6)
Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective (1998) (6)
Dynamic Maintenance of the Lower Envelope of Pseudo-Lines (2019) (6)
CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON (1993) (6)
Oriented aligned rectangle packing problem (1992) (6)
Star Unfolding of a Polytope with Applications (Extended Abstract) (1990) (6)
I/o efficient algorithms and applications in geographic information systems (2006) (5)
Stability of ε-Kernels ∗ (2009) (5)
Output-Sensitive Algorithms for Uniform Partitions of Points (1999) (5)
Efficient Indexes for Diverse Top-k Range Queries (2020) (5)
Circular visibility of a simple polygon from a fixed point (1993) (5)
Alignment of Multiple Sequences using GA method (2013) (5)
Stability of epsilon-Kernels (2010) (5)
From Data Reverence to Data Relevance: Model-Mediated Wireless Sensing of the Physical Environment (2007) (4)
Solving Sequence Alignment Problem using Pipeline Approach (2009) (4)
Pattern Matching Based Technique to Solve Motif-Finding Problem (2008) (4)
Simplification, estimation and classification of geometric objects (2004) (4)
Selectivity Functions of Range Queries are Learnable (2022) (4)
Union of Hypercubes and 3D Minkowski Sums with Random Sizes (2021) (4)
Prediction of Secondary Structure of Protein Using Support Vector Machine (2014) (4)
On lines avoiding unit balls in three dimensions (2004) (4)
Robotics: The Algorithmic Perspective : WAFR 1998 (1998) (4)
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints (2020) (4)
Geometric Optimization Revisited (2019) (4)
Hausdorff distance under translation for points and balls (2010) (4)
Computing Maximally Separated Sets in the Plane (2006) (4)
Computing highly occluded paths using a sparse network (2014) (4)
Solving Planted-Motif Problem A New Approach (2007) (4)
Computational geometry column 44 (1998) (4)
Segmenting Motifs in Protein-Protein Interface Surfaces (2006) (4)
An On-line Occlusio-Culling Algorithm for FastWalkthrough in Urban Areas (2001) (4)
Constructing Binary Space Partitions for Orthogonal Rectabgles in Practice (1998) (3)
Applicable and Robust Geometric Computing (2001) (3)
Flood Risk Analysis on Terrains (2019) (3)
Computing Complex Temporal Join Queries Efficiently (2022) (3)
Fast Geometric Algorithm for Rigid Protein Docking (2004) (3)
Efficient Algorithms for Geometric Partial Matching (2019) (3)
Improved Algorithms for Uniform Partitions of Points (2002) (3)
Subscriber assignment for wide-area content-based publish/subscribe (2011) (3)
Computing Correlation between Piecewise-Linear Functions (2013) (3)
Clinical trials in private clinics (2011) (3)
A Near-Linear Time ε-Approximation Algorithm for Bipartite Geometric Matching (2011) (3)
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats (2017) (3)
Discrete And Computational Geometry: Ten Years Later (2007) (3)
Occlusion Culling for Fast Walkthrough in Urban Areas (2000) (3)
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems (2022) (3)
I/O-Efficient Dynamic Point Location in Monotone Subdivisions (1999) (3)
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise (2019) (3)
Exact and Approximation Algorithms for Clustering 1 (3)
Sparsification of motion-planning roadmaps by edge contraction (2014) (3)
A New Algorithm for Counting Circular Arc Intersections (1992) (3)
On Two-Handed Planar Assembly Partitioning (2020) (3)
Approximate Minimum-Weight Matching with Outliers under Translation (2018) (3)
Computing similarity between piecewise-linear functions (2010) (2)
Linear Approximation of Simple Objects (1997) (2)
An Efficient Algorithm for Terraine Simplification (1997) (2)
Decomposing the Complement of the Union of Cubes in Three Dimensions (2021) (2)
Dynamic Enumeration of Similarity Joins (2021) (2)
Implicit Point Location in Arrangements of Line Segments, with an Application to Motion Planning (1992) (2)
Flood-Risk Analysis on Terrains under the Multiflow-Direction Model (2019) (2)
A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences (2006) (2)
Approximation Algorithms for Minimum-Width Annuli and Shells (2000) (2)
Connected Component and Simple Polygon Intersection Searching (Extended Abstract) (1993) (2)
Two randomized incramental algorithms for planar arrangements , with a twist (2004) (2)
An Efficient Algorithm for Euclidian 2-Center with Outliers ∗ (2008) (2)
Computing a Center-Transversal Line (2006) (2)
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions (2001) (2)
Processing and Notifying Range Top-k Subscriptions (2012) (2)
Query Perturbation Analysis: An Adventure of Database Researchers in Fact-Checking (2018) (2)
A time efficient algorithm for finding longest common subsequence from two molecular sequences (2007) (2)
I/O-efficient contour queries on terrains (2011) (2)
Flood-risk analysis on terrains (2020) (2)
TSGA-MSA: Trace Sequence Algorithm for Alignment of MSA (2014) (1)
Contemporary Mathematics State of the Union ( of Geometric Objects ) (2007) (1)
An Efficient Algorithm for Placing Electric Vehicle Charging Stations (2016) (1)
Union of Random Minkowski Sums and Network Vulnerability Analysis (2014) (1)
I/o-efficient algorithms for processing massive spatial data (2006) (1)
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (2021) (1)
Locally Fair Partitioning (2021) (1)
A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching (2020) (1)
- Means Projective Clustering (2010) (1)
Maintaining Reeb Graphs of Triangulated 2-Manifolds (2017) (1)
Acknowledgments Discussions With (1996) (1)
1D and 2D Flow Routing on a Terrain (2020) (1)
An Improved ε-Approximation Algorithm for Geometric Bipartite Matching (2022) (1)
Farthest Neighbours, Maximum Spanning Trees and Related Problems in Higher Dimensions (1991) (1)
Clustering under Perturbation Stability in Near-Linear Time (2020) (1)
cient Searching with Linear Constraints (1)
1D and 2D Flow Routing on a Terrain (2022) (1)
Computational Geometry (Dagstuhl Seminar 11111) (2011) (1)
Rejoinder to †: Response to Chesson and Rees (2007) (1)
Prediction of Secondary Structure of Proteins Using Sliding Window and Backpropagation Algorithm (2018) (1)
Some results on the new fractional derivative of generalized k-Wright function (2020) (1)
Geometric and topological methods in protein structure analysis (2004) (1)
Describing Biological Cells by Computer Programs. (1996) (1)
Human Eye Vision Algorithm (HEVA): A Novel Approach for the Optimization of Combinatorial Problems (2021) (1)
Motion planning of a ball amid segments in three dimensions (1999) (1)
Convex Hulls Under Uncertainty (2016) (1)
Durable top- k queries on temporal data (2018) (1)
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions (2000) (1)
Deterministic, Near-Linear $\varepsilon$-Approximation Algorithm for Geometric Bipartite Matching (2022) (0)
Multiple Sequence Alignment ( Cont . ) (0)
Dagstuhl-seminar 01121, ''computational Geometry'' Three-dimensional Mesh Generation for Domains with Small Angles a Separation Bound for Real Algebraic Expressions (0)
Literature Review on Soft Computing Based Optimization Models (2022) (0)
Spectral clustering , projective clustering (2007) (0)
Lecture # 24: Clustering 2.2 Objective Functions (2014) (0)
Computation and Uncertainty in Ecological Forecasting (2002) (0)
7 : Segment , Interval , Priority-Search Trees (2005) (0)
Lecture 7: Segment, Interval, Priority-Search Trees (2005) (0)
Applications of the Bounds on Incidences (2011) (0)
Research Faster Multiple Sequence Alignment Algorithms Based on Pairwise Segmentation (2004) (0)
A Scalable Algorithm for Light Computation (2006) (0)
Lecture 23: Shape Analysis (2003) (0)
Approximation of a Convex Set by Polygons (2011) (0)
Appli ations of Parametri Sear hing in Geometri Optimization (2013) (0)
Algorithms in Computational Biology November 13 , 2003 Lecture 22 : Space Filling Diagrams (2003) (0)
Algorithms in Computational Biology November 04 , 2003 Lecture 19 : Proteins , Primary Struture (2003) (0)
Streaming Geometri Optimization usingGraphi s Hardware ? (2011) (0)
Lecture 13 : Probabilistic and Stochastic Modeling (0)
STAR-Tree : An EÆ ient Self-Adjusting Indexfor Moving Obje ts ? (2011) (0)
41 RANGE SEARCHING (2016) (0)
A Near-Quadratic Algorithm for Fence Design (2005) (0)
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions (2015) (0)
Cps296.2 Geometric Optimization Lecture 19: Well Separated Pair Decomposition 19.1 Well Separated Point Sets Figure 19.2: Well Separated Point Sets: a Stronger Notion (2007) (0)
Circle Packings and Planar Graphs (2011) (0)
Lecture 9 : Random sampling ,-approximation and-nets (0)
[38] O. Sudarsky and C. Gotsman. Output-sensitive Rendering and Communication in Dynamic A. Funkhouser. Ring: a Client-server System for Multi-user Virtual Environments. in Bibliography Summary and Conclusions (0)
36 RANGE SEARCHING (0)
Cps296.2 Geometric Optimization 13.1 Euclidean 1-center (2007) (0)
Lecture 20: Secondary Structure Prediction (2003) (0)
ComputingtheWrithing Numberof a PolygonalKnot (2002) (0)
Connected Component and Simple Polygon Intersection Searching Connected Component and Simple Polygon Intersection Searching (1993) (0)
Lattice Packing and Lattice Covering (2011) (0)
Methods of Blichfeldt and Rogers (2011) (0)
cient Algorithms for Contour LineExtraction and Planar Graph Blocking ( Extended Abstract ) (1997) (0)
More on Repeated Distances (2011) (0)
Lecture 16: Multiple Sequence Alignment (Cont.) (2003) (0)
Lecture 10 : Local Alignment and Substitution Matrices (0)
Packing and Covering with Congruent Convex Discs (2011) (0)
Lecture 11: Searching in Sequence Databases (2003) (0)
The Method of Cell Decomposition (2011) (0)
Efficiently Answering Durability Prediction Queries (2021) (0)
Spatial data structures and algorithms for large scale applications (2004) (0)
Session details: Session 11B (2002) (0)
CS-1993-03 Can Visibility Graphs Be RepresentedCompactly ? (1993) (0)
E cient Searching with Linear Constraints ( Extended Abstract ) (2007) (0)
Session details: Session 8B (2002) (0)
Identifying Common Portions between Two Trajectories (2012) (0)
An Eecient Multi-dimensional Searching Technique and Its Applications an Eecient Multi-dimensional Searching Technique and Its Applications (2007) (0)
Coresets for Shape Fitting and Kinetic Data Structures (2005) (0)
A Technique Based on Neural Network for predicting the Secondary Structure of Proteins (2007) (0)
Near-Linear Approximation Algorithms for Geometric Hitting Sets (2011) (0)
Epsilon Nets and Transversals of Hypergraphs (2011) (0)
Randomized Algorithms for Geometri Optimization Problems (2001) (0)
Vai89] P. M. Vaidya. a New Algorithm for Minimizing Convex Functions over Convex Sets. in 5 Concluding Remarks Acknowledgements. I'm Grateful to 4.3 Solving Closest-point Problems 4.1 Finding L S 4 Closest-point Queries (1993) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
Lecture 15: Multiple Sequence Alignment (2003) (0)
Open Problems Presented at SCG'98 (1999) (0)
Cps296.2 Geometric Optimization Lecture 17: Covering, Packing, and Art-gallery Problems 17.1 Covering and Packing (2007) (0)
By using MADALINE Learning with Back Propagation and Keras to Predict the Protein Secondary Structure (2019) (0)
point sets. In J. N. Srivastava, editor, A Survey of Combinatorial Theory, pages (1998) (0)
Modeling and Analyzing Terrain Data Acquired by Modern Mapping Techniques (2009) (0)
Extremal Graph Theory (2011) (0)
Video Segmentation using Morse-Smale Complexes (2008) (0)
Chapter 5 Line Labeling (2002) (0)
Simple and practical geometric algorithms (1996) (0)
Geometry of Numbers (2011) (0)
Geometric Optimization April 12 , 2007 Lecture 25 : Johnson Lindenstrauss Lemma (2007) (0)
On Range Searching with Semialgebraic Sets on Range Searching with Semialgebraic Sets (1994) (0)
Y Lower Bounds for Kinetic Planar Subdivisions * (2015) (0)
Object Space Segmentation by Geometric Reference Structures (2005) (0)
Lecture # 24: Clustering (2014) (0)
Invited talk: Algorithms for Geometric Similarity (2012) (0)
III : Medium : Collaborative Research : From Answering Questions to Questioning Answers ( and Questions )---Perturbation Analysis of Database Queries (2017) (0)
Lecture 1: Course Introduction; Biological Introduction (2003) (0)
SOGA: space oriented genetic algorithm for multiple sequence alignment (2018) (0)
Cps296.2 Geometric Optimization 14.1 Clustering (2007) (0)
Minimizing the Makespan and Economic Cost of Schedule for the Grid Applications (2013) (0)
Computational geometry (1998) (0)
To Study the Effect of Genetic Operators on Alignment of Multiple Sequences (2013) (0)
Arrangement of Lines (2011) (0)
Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions (2021) (0)
Exploiting temporal coherence in forest dynamics simulation (2011) (0)
Executive Summary Computational Geometry 1 Computational Geometry Evolution (2009) (0)
Guest Editors’ Foreword (2001) (0)
Streaming Algorithms for Extent Problems in High Dimensions (2013) (0)
Randomized Algorithms for GeometricOptimization Problems (2000) (0)
Construction of 3-D Terrain Models from BIG Data Sets (2014) (0)
Issues in interactive rendering: theory and practice (2000) (0)
Linear Approximation of Simple Objects Linear Approximation of Simple Objects (1995) (0)
Lecture 25 : Embedding Techniques (2014) (0)
Sek and S. Suri. Farthest Neighbors, Maximum Spanning Trees and Related Problems In (0)
Matching Terrains under a Linear Transformation (2009) (0)
Lecture 11 : Voronoi diagram , Delaunay triangulation (0)
Computing Optimal Kernels in Two Dimensions (2022) (0)
k Directional Assembly Sequences � (2009) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
N 86-32865 KBGIS-II : A Knowledge-Based Geographic Information System (2008) (0)
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, Clear Water Bay, Hong Kong, China, June 12-14, 2000 (2000) (0)
Lower Bound for Sparse Geometric Spanners ∗ (2005) (0)
Multi-Robot Motion Planning for Unit Discs with Revolving Areas (2022) (0)
Index of Symbols (2011) (0)
Durable Top-k Queries on Temporal Data ( Technical Report Version ) (2018) (0)
Modeling and Analyzing Massive Terrain Data Sets (2007) (0)
Hints for the exercises (2011) (0)
CHAPTER ELEVENA Simple and EÆ ient Algorithmfor High-Quality Line (2011) (0)
Cps296.2 Geometric Optimization 23.1 Introduction (2007) (0)
ITR/ACS+IM Computational Geometry for Structural Biology and Bioinformatics (2002) (0)
On Approximate Geodesic-Distance Queries amid Deforming Point Clouds (2008) (0)
Range Searching Range Searching (1996) (0)
Lecture 12: Genome Sequencing (2003) (0)
Lecture 1: Introduction to Computational Geometry (2005) (0)
09111 Abstracts Collection - Computational Geometry (2009) (0)
Efficient Random Arrangements (2011) (0)
Algorithms: Analysis, Design, Implementation (2009) (0)
CS-1996-11 Approximation Algorithms forCurvature-Constrained (2007) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
Lecture 2 : LP Duality , Simplex Method Complexity , Ellipsoid Method (2007) (0)
Algorithms in Computational Biology September 25 , 2003 Lecture 9 : Sequence Alignment II (0)
[38] O. Sudarsky and C. Gotsman. Output-sensitive Rendering and Communication in Dynamic A. Funkhouser. Ring: a Client-server System for Multi-user Virtual Environments. in Summary and Conclusions (0)
Lecture 17: Gene Prediction (2003) (0)

This paper list is powered by the following services:

Other Resources About Pankaj K. Agarwal

What Schools Are Affiliated With Pankaj K. Agarwal?

Pankaj K. Agarwal is affiliated with the following schools:

Pankaj K. Agarwal's Academic­Influence.com Rankings