Benjamin Raichel

Discret. Comput. Geom., January, 2025

2024

Clustering with faulty centers.

[BibT_eX]

[DOI]

Emily Fox

Comput. Geom., February, 2024

The Fréchet Distance Unleashed: Approximating a Dog with a Frog.

[BibT_eX]

[DOI]

Eliot Wong Robson

CoRR, 2024

Fréchet Edit Distance.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Fréchet Distance for Uncertain Curves.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, July, 2023

Correction to: Avoiding the Global Sort: A Faster Contour Tree Algorithm.

[BibT_eX]

[DOI]

Seshadhri Comandur

Discret. Comput. Geom., 2023

Square Hardness for Clustering with Neighborhoods.

[BibT_eX]

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

On the Budgeted Hausdorff Distance Problem.

[BibT_eX]

Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022

Metric Violation Distance: Hardness and Approximation.

[BibT_eX]

[DOI]

Gregory Van Buskirk

Algorithmica, 2022

Clustering with Faulty Centers.

[BibT_eX]

[DOI]

Kyle Fox

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Computing the Fréchet Gap Distance.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Sparse convex hull coverage.

[BibT_eX]

[DOI]

Gregory Van Buskirk

Comput. Geom., 2021

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Foundations of Robotics XIV, 2021

How can classical multidimensional scaling go wrong?

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Clustering with Neighborhoods.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Fast and Exact Convex Hull Simplification.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Generalized Metric Repair on Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Convex Hull Complexity of Uncertain Points.

[BibT_eX]

Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

2019

Sparse Approximation via Generating Point Sets.

[BibT_eX]

[DOI]

Avrim Blum

ACM Trans. Algorithms, 2019

Viewing the Rings of a Tree: Minimum Distortion Embeddings into Trees.

[BibT_eX]

[DOI]

Amir Nayyeri

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Approximating Distance Measures for the Skyline.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Database Theory, 2019

2018

Metric Violation Distance: Revisited and Extended.

[BibT_eX]

[DOI]

Gregory Van Buskirk

CoRR, 2018

2017

Geometric Packing under Nonuniform Constraints.

[BibT_eX]

[DOI]

Alina Ene

SIAM J. Comput., 2017

Avoiding the Global Sort: A Faster Contour Tree Algorithm.

[BibT_eX]

[DOI]

C. Seshadhri

Discret. Comput. Geom., 2017

A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs.

[BibT_eX]

[DOI]

Amir Nayyeri

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Sparse Approximate Conic Hulls.

[BibT_eX]

[DOI]

Greg Van Buskirk

Nicholas Ruozzi

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016

On the Expected Complexity of Voronoi Diagrams on Terrains.

[BibT_eX]

[DOI]

Anne Driemel

ACM Trans. Algorithms, 2016

Space Exploration via Proximity Search.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

From Proximity to Utility: A Voronoi Partition of Pareto Optima.

[BibT_eX]

[DOI]

Hsien-Chih Chang

Discret. Comput. Geom., 2016

Most Likely Voronoi Diagrams in Higher Dimensions.

[BibT_eX]

[DOI]

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

In pursuit of linear complexity in discrete and computational geometry

[BibT_eX]

[DOI]

PhD thesis, 2015

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems.

[BibT_eX]

[DOI]

J. ACM, 2015

On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Reality Distortion: Exact and Approximate Algorithms for Embedding into the Line.

[BibT_eX]

[DOI]

Amir Nayyeri

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

The fréchet distance revisited and extended.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

A Mountaintop View Requires Minimal Sorting: A Faster Contour Tree Algorithm.

[BibT_eX]

[DOI]

C. Seshadhri

CoRR, 2014

On the Complexity of Randomly Weighted Voronoi Diagrams.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small

[BibT_eX]

[DOI]

Alina Ene

CoRR, 2013

Fault Tolerant Clustering Revisited.

[BibT_eX]

[DOI]

Nirman Kumar

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Geometric packing under non-uniform constraints.

[BibT_eX]

[DOI]

Alina Ene