| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Anne Driemel, Sariel Har-Peled, Carola Wenk |
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time.  |
Discrete & Computational Geometry  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Benjamin Raichel |
Fréchet Distance Revisited and Extended |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled |
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Mohammad Ali Abam, Sariel Har-Peled |
New constructions of SSPDs and their applications. |
Comput. Geom. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Driemel, Sariel Har-Peled |
Jaywalking your dog: computing the Fréchet distance with shortcuts. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Micha Sharir |
Relative (p, ε)-Approximations in Geometry. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk |
Computing the Fréchet Distance Between Folded Polygons |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anne Driemel, Sariel Har-Peled, Benjamin Raichel |
On the Expected Complexity of Voronoi Diagrams on Terrains |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled |
A Simple Proof of the Existence of a Planar Separator |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Alina Ene, Sariel Har-Peled, Benjamin Raichel |
Geometric Packing under Non-uniform Constraints |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Sariel Har-Peled, Csaba D. Tóth |
Minimum Convex Partitions and Maximum Empty Polytopes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Nirman Kumar |
Down the Rabbit Hole: Robust Proximity Search in Sublinear Space |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled |
On the Expected Complexity of Random Convex Hulls |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timothy M. Chan, Sariel Har-Peled |
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Anne Driemel, Sariel Har-Peled |
Jaywalking your Dog - Computing the Fréchet Distance with Shortcuts |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Nirman Kumar |
Approximate Nearest Neighbor Search for Low Dimensional Queries. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Benjamin Raichel |
The frechet distance revisited and extended. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Atlas F. Cook, Anne Driemel, Sariel Har-Peled, Jessica Sherette, Carola Wenk |
Computing the Fréchet Distance between Folded Polygons. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rachit Agarwal, Philip Brighten Godfrey, Sariel Har-Peled |
Approximate distance queries and compact routing in sparse graphs. |
INFOCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang |
Hausdorff distance under translation for points and balls. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Nirman Kumar |
Approximate Nearest Neighbor Search for Low Dimensional Queries |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anne Driemel, Sariel Har-Peled, Carola Wenk |
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Anne Driemel, Sariel Har-Peled, Carola Wenk |
Approximating the Fréchet distance for realistic curves in near linear time. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
frechet distance, realistic input models, approximation algorithms |
| 1 | Mohammad Ali Abam, Sariel Har-Peled |
New constructions of SSPDs and their applications. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
separated pair decomposition, separators, geometric spanners |
| 1 | Sariel Har-Peled |
Being Fat and Friendly is Not Enough |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled |
On the Set Multi-Cover Problem in Geometric Settings |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled |
Approximating Spanning Trees with Low Crossing Number |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Amitabha Bagchi, Sariel Har-Peled, Achal Premi, Adit Madan |
Hierarchical neighbor graphs: A low stretch connected structure for points in Euclidean space |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Micha Sharir |
Relative (p,epsilon)-Approximations in Geometry |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled |
Randomized Incremental Construction of Compressed Quadtrees |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled |
Carnival of Samplings: Nets, Approximations, Relative and Sensitive |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Mark de Berg, Sergio Cabello, Sariel Har-Peled |
Covering Many or Few Points with Unit Disks. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Weighted points, Facility location, Random sample, Geometric optimization |
| 1 | Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled |
On the set multi-cover problem in geometric settings. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
set cover, cuttings, LP rounding |
| 1 | Timothy M. Chan, Sariel Har-Peled |
Approximation algorithms for maximum independent set of pseudo-disks. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
approximation., local search |
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu |
Robust Shape Fitting via Peeling and Grating Coresets. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
Geometric approximation algorithms, Shape fitting, Coresets |
| 1 | Sariel Har-Peled, S. Muthukrishnan |
Range Medians |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ke Chen 0006, Sariel Har-Peled |
The Euclidean Orienteering Problem Revisited. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Sariel Har-Peled |
On Approximating the Depth and Related Problems. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, S. Muthukrishnan |
Range Medians. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Akash Kushal |
Smaller Coresets for k-Median and k-Means Clustering. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Otfried Cheong, Alon Efrat, Sariel Har-Peled |
Finding a Guard that Sees Most and a Shop that Sells Most. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled |
How to get close to the median shape. |
Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Dan Roth, Dav Zimak |
Maximum Margin Coresets for Active and Noise Tolerant Learning. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu |
Embeddings of surfaces, curves, and moving points in euclidean space. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
moving points, dimensionality reduction, random projection, doubling dimension |
| 1 | Boris Aronov, Sariel Har-Peled, Micha Sharir |
On approximate halfspace range counting and relative epsilon-approximations. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
approximate range queries, epsilon-approximations, partition trees, range spaces, queries, discrepancy, range, VC-dimension, halfspaces |
| 1 | Alon Efrat, Sariel Har-Peled |
Guarding galleries and terrains. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Erickson, Sariel Har-Peled, David M. Mount |
On the Least Median Square Problem. |
Discrete & Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Manor Mendel |
Fast Construction of Nets in Low-Dimensional Metrics and Their Applications. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk |
Fréchet Distance for Curves, Revisited. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu |
Robust shape fitting via peeling and grating coresets. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Chen 0006, Sariel Har-Peled |
The orienteering problem in the plane revisited. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
k-TSP, approximation, orienteering problem |
| 1 | Sariel Har-Peled |
How to get close to the median shape. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
approximation, shape fitting |
| 1 | Mark de Berg, Sergio Cabello, Sariel Har-Peled |
Covering Many or Few Points with Unit Disks. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled |
Coresets for Discrete Integration and Clustering. |
FSTTCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella |
Approximating k-hop minimum-spanning trees. |
Oper. Res. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal |
Geographic Quorum System Approximations. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Clustering, Quorum system, Geometric optimization |
| 1 | Sariel Har-Peled, Bardia Sadri |
How Fast Is the k-Means Method? |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Means method, Clustering, Classification |
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang |
Near-Linear Time Approximation Algorithms for Curve Simplification. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Curve simplification, Approximation algorithms, Computational geometry |
| 1 | Sariel Har-Peled, Soham Mazumdar |
Fast Algorithms for Computing the Smallest k-Enclosing Circle. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Clustering, Outliers, Shape fitting |
| 1 | Shivani Agarwal, Thore Graepel, Ralf Herbrich, Sariel Har-Peled, Dan Roth |
Generalization Bounds for the Area Under the ROC Curve. |
Journal of Machine Learning Research |
2005 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Shakhar Smorodinsky |
Conflict-Free Coloring of Points and Simple Regions in the Plane. |
Discrete & Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Alper Üngör |
A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Paz Carmi, Sariel Har-Peled, Matthew J. Katz |
On the Fermat-Weber center of a convex object. |
Comput. Geom. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Bardia Sadri |
How fast is the k-means method? |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Sariel Har-Peled |
On approximating the depth and related problems. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Efrat, Sariel Har-Peled, Joseph S. B. Mitchell |
Approximation algorithms for location problems in sensor networks. |
BROADNETS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Alper Üngör |
A time-optimal delaunay refinement algorithm in two dimensions. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
delaunay triangulation, quadtree, steiner points, mesh quality, mesh refinement |
| 1 | Sariel Har-Peled, Akash Kushal |
Smaller coresets for k-median and k-means clustering. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
clustering, coresets |
| 1 | Sariel Har-Peled, Manor Mendel |
Fast construction of nets in low dimensional metrics, and their applications. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
approximate distance oracle, compact representation scheme, well separated pair decomposition, spanners, approximate nearest neighbor search, doubling metrics |
| 1 | John Fischer, Sariel Har-Peled |
Dynamic Well-Separated Pair Decomposition Made Easy. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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. |
CCCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled |
Approximation algorithm for the L1-fitting circle problem. |
EuroCG |
2005 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Vladlen Koltun |
Separability with Outliers. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Kasturi R. Varadarajan |
Approximating extent measures of points. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
Computational geometry, approximation |
| 1 | Sariel Har-Peled |
Clustering Motion. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Kasturi R. Varadarajan |
High-Dimensional Shape Fitting in Linear Time. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek |
The One-Round Voronoi Game. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Erickson, Sariel Har-Peled |
Optimally Cutting a Surface into a Disk. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Manor Mendel |
Fast Construction of Nets in Low Dimensional Metrics, and Their Applications |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Yusu Wang |
Shape Fitting with Outliers. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Otfried Cheong, Alon Efrat, Sariel Har-Peled |
On finding a guard that sees most and a shop that sells most. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Erickson, Sariel Har-Peled, David M. Mount |
On the least median square problem. |
Symposium on Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
LMS regression, approximation algorithms, lower bounds, robust statistics |
| 1 | Sariel Har-Peled |
No, Coreset, No Cry. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Soham Mazumdar |
On coresets for k-means and k-median clustering. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
clustering, streaming, k-means, k-median, Coreset |
| 1 | Sariel Har-Peled, Piotr Indyk |
When Crossings Count - Approximating the Minimum Spanning Tree |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Chaim Linhart, Dan Halperin, Iddo Hanniel, Sariel Har-Peled |
An Experimental Study of On-Line Methods for Zone Construction in Arrangements of Lines in the Plane. |
Int. J. Comput. Geometry Appl. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Soham Mazumdar |
Fast Algorithms for Computing the Smallest k-Enclosing Disc. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Shakhar Smorodinsky |
On conflict-free coloring of points and simple regions in the plane. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
coloring, cellular network, frequency assignment |
| 1 | Sariel Har-Peled, Kasturi R. Varadarajan |
High-dimensional shape fitting in linear time. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
computational convexity, projective clustering |
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang |
Hausdorff distance under translation for points and balls. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
1-median, Voronoi diagrams, shape matching, Hausdorff distance |
| 1 | Sariel Har-Peled, Yusu Wang |
Shape fitting with outliers. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
approximation, outliers, shape fitting |
| 1 | Sariel Har-Peled, Vladlen Koltun, Dezhen Song, Kenneth Y. Goldberg |
Efficient algorithms for shared camera control. |
Symposium on Computational Geometry |
2003 |
DBLP DOI BibTeX RDF |
webcamera, collaboration, approximation, sweep |
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Meetesh Karia |
Computing Approximate Shortest Paths on Convex Polytopes. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, Joseph S. B. Mitchell, T. M. Murali |
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping. |
Discrete & Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Erickson, Sariel Har-Peled |
Optimally cutting a surface into a disk |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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. |
Comput. Geom. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
ACM Comput. Surv. |
2002 |
DBLP DOI BibTeX RDF |
robotoics, modeling, computer vision, Computational geometry, mobile networks, spatio-temporal databases, physical simulation, motion modeling, molecular biology |
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa, Yusu Wang |
Near-Linear Time Approximation Algorithms for Curve Simplification. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Cecilia Magdalena Procopiuc, Pankaj K. Agarwal, Sariel Har-Peled |
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects. |
ALENEX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Otfried Cheong, Sariel Har-Peled, Nathan Linial, Jirí Matousek |
The one-round Voronoi game. |
Symposium on Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
Voronoi game, competitive facility location, Voronoi diagram |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")