A Simple Randomized Algorithm for All Nearest Neighbors. | 0 | 0.34 | 2019 |
Fault-Tolerant Spanners in Networks with Symmetric Directional Antennas. | 1 | 0.35 | 2017 |
A streaming algorithm for 2-center with outliers in high dimensions. | 1 | 0.35 | 2017 |
Optimal Orientation of Symmetric Directional Antennas on a Line. | 0 | 0.34 | 2017 |
On the Rectangle Escape Problem. | 1 | 0.36 | 2017 |
Finding Maximum Disjoint Set of Boundary Rectangles With Application to PCB Routing. | 2 | 0.39 | 2017 |
A Streaming Algorithm for the Convex Hull. | 0 | 0.34 | 2015 |
Diversity Maximization via Composable Coresets. | 5 | 0.41 | 2015 |
The Minimum Vulnerability Problem. | 2 | 0.64 | 2014 |
Improved algorithms for partial curve matching | 7 | 0.44 | 2014 |
The Maximum Disjoint Set of Boundary Rectangles. | 3 | 0.41 | 2014 |
α-Visibility | 0 | 0.34 | 2014 |
Finding paths with minimum shared edges. | 1 | 0.37 | 2013 |
α-visibility | 0 | 0.34 | 2012 |
Finding Maximum Edge Bicliques in Convex Bipartite Graphs | 7 | 0.51 | 2012 |
Fréchet distance with speed limits | 11 | 0.66 | 2011 |
Finding paths with minimum shared edges | 2 | 0.60 | 2011 |
An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions | 11 | 0.60 | 2011 |
Staying Close to a Curve. | 8 | 0.80 | 2011 |
Speed-constrained geodesic fréchet distance inside a simple polygon | 0 | 0.34 | 2010 |
Streaming 1-Center with Outliers in High Dimensions | 5 | 0.46 | 2009 |
Flying over a polyhedral terrain | 2 | 0.38 | 2008 |
Core-Preserving Algorithms | 2 | 0.38 | 2008 |
On the complexity of finding an unknown cut via vertex queries | 4 | 0.52 | 2007 |
An Improved Algorithm for Online Unit Clustering | 7 | 0.64 | 2007 |
Small Weak Epsilon-Nets in Three Dimensions | 4 | 0.52 | 2006 |
A randomized algorithm for online unit clustering | 9 | 0.71 | 2006 |
Path Planning Above A Polyhedral Terrain | 0 | 0.34 | 2006 |
A Simple Streaming Algorithm for Minimum Enclosing Balls | 16 | 0.78 | 2006 |