| Locally Fair Partitioning. | 0 | 0.34 | 2022 |
| An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D. | 0 | 0.34 | 2021 |
| Flood Risk Analysis on Terrains. | 0 | 0.34 | 2021 |
| Dynamic Enumeration of Similarity Joins | 0 | 0.34 | 2021 |
| Dynamic geometric set cover and hitting set | 0 | 0.34 | 2020 |
| Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead. | 0 | 0.34 | 2019 |
| Computing Shortest Paths in the Plane with Removable Obstacles. | 0 | 0.34 | 2018 |
| Durable Top-k Queries on Temporal Data. | 0 | 0.34 | 2018 |
| Approximate Minimum-Weight Matching with Outliers under Translation. | 0 | 0.34 | 2018 |
| Nearest neighbor searching under uncertainty II | 4 | 0.39 | 2016 |
| Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains. | 3 | 0.42 | 2016 |
| Stable Delaunay Graphs. | 1 | 0.36 | 2015 |
| Contour trees of uncertain terrains. | 3 | 0.38 | 2015 |
| Maintaining Contour Trees of Dynamic Terrains. | 2 | 0.40 | 2014 |
| Top-k preferences in high dimensions. | 3 | 0.37 | 2014 |
| Toward Computational Fact-Checking. | 0 | 0.34 | 2014 |
| Union of Random Minkowski Sums and Network Vulnerability Analysis | 8 | 0.54 | 2013 |
| Computing Correlation between Piecewise-Linear Functions. | 2 | 0.39 | 2013 |
| Sparsification of motion-planning roadmaps by edge contraction | 8 | 0.54 | 2012 |
| Processing and Notifying Range Top-k Subscriptions | 2 | 0.36 | 2012 |
| Range searching on uncertain data | 9 | 0.53 | 2012 |
| Processing a large number of continuous preference top-k queries | 42 | 1.00 | 2012 |
| The resilience of WDM networks to probabilistic geographical failures | 66 | 2.91 | 2011 |
| TerraNNI: natural neighbor interpolation on a 3D grid using a GPU | 4 | 0.50 | 2011 |
| Guarding a Terrain by Two Watchtowers | 5 | 0.57 | 2010 |
| Lipschitz unimodal and isotonic regression on paths and trees | 2 | 0.39 | 2010 |
| Input-sensitive scalable continuous join query processing | 1 | 0.35 | 2009 |
| On Approximate Geodesic-Distance Queries amid Deforming Point Clouds | 0 | 0.34 | 2008 |
| Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets | 13 | 0.81 | 2008 |
| I/o-efficient efficient algorithms for computing contours on a terrain | 5 | 0.51 | 2008 |
| Untangling triangulations through local explorations | 4 | 0.42 | 2008 |
| Fast Molecular Shape Matching Using Contact Maps | 8 | 0.54 | 2007 |
| A scalable algorithm for dispersing population | 6 | 0.82 | 2007 |
| A space-optimal data-stream algorithm for coresets in the plane | 9 | 0.63 | 2007 |
| From Data Reverence to Data Relevance: Model-Mediated Wireless Sensing of the Physical Environment | 2 | 0.38 | 2007 |
| A New Bucket-Based A New Bucket-Based Algorithm for Finding LCS from two given Molecular Sequences | 0 | 0.34 | 2006 |
| A Low Leakage and SNM Free SRAM Cell Design in Deep Sub Micron CMOS Technology | 14 | 1.05 | 2006 |
| A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes | 7 | 0.58 | 2006 |
| Extreme elevation on a 2-manifold | 36 | 2.73 | 2006 |
| Segmenting object space by geometric reference structures | 2 | 0.43 | 2006 |
| Efficient algorithms for bichromatic separability | 6 | 0.50 | 2006 |
| Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons | 0 | 0.34 | 2005 |
| I/O-efficient construction of constrained delaunay triangulations | 15 | 1.03 | 2005 |
| Lower bound for sparse Euclidean spanners | 9 | 0.43 | 2005 |
| Near-Linear Time Approximation Algorithms for Curve Simplification | 40 | 2.31 | 2005 |
| Guarding a terrain by two watchtowers. | 0 | 0.34 | 2005 |
| Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks | 3 | 0.41 | 2004 |
| Collision detection for deforming necklaces | 34 | 1.50 | 2004 |
| Cache-oblivious data structures for orthogonal range searching | 17 | 0.72 | 2003 |
| HPRM: a hierarchical PRM | 3 | 0.44 | 2003 |
