On the Geodesic Voronoi Diagram of Point Sites in a Simple Polygon. - Boris Aronov (Algorithmica, 1989)

Combinatorial and algorithmic analysis of space decomposition problems. - Boris Aronov (1989)

Star Unfolding of a Polytope with Applications (Extended Abstract). - Pankaj K. Agarwal; Boris Aronov; Joseph O'Rourke; Catherine A. Schevon (SWAT, 1990)

Triangles in space or building (and analyzing) castles in the air. - Boris Aronov; Micha Sharir (Comb., 1990)

On the Zone of a Surface in a Hyperplane Arrangement. - Boris Aronov; Micha Sharir (WADS, 1991)

Computing external farthest neighbors for a simple polygon. - Pankaj K. Agarwal; Alok Aggarwal; Boris Aronov; S. Rao Kosaraju; Baruch Schieber; Subhash Suri (Discret. Appl. Math., 1991)

Points and Triangles in the Plane and Halving Planes in Space. - Boris Aronov; Bernard Chazelle; Herbert Edelsbrunner; Leonidas J. Guibas; Micha Sharir; Rephael Wenger (Discret. Comput. Geom., 1991)

Minimum-Speed Motions. - Boris Aronov; Steven Fortune; Gordon T. Wilfong (Int. J. Robotics Res., 1991)

Minkowski-Type Theorems and Least-Squares Partitioning. - Franz Aurenhammer; Friedrich Hoffmann; Boris Aronov (SCG, 1992)

The number of edges of many faces in a line segment arrangement. - Boris Aronov; Herbert Edelsbrunner; Leonidas J. Guibas; Micha Sharir (Comb., 1992)

Counting Facets and Incidences. - Pankaj K. Agarwal; Boris Aronov (Discret. Comput. Geom., 1992)

Nonoverlap of the Star Unfolding. - Boris Aronov; Joseph O'Rourke (Discret. Comput. Geom., 1992)

The Union of Convex Polyhedra in Three Dimensions - Boris Aronov; Micha Sharir (FOCS, 1993)

Selecting Distances in the Plane. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir; Subhash Suri (Algorithmica, 1993)

On Compatible Triangulations of Simple Polygons. - Boris Aronov; Raimund Seidel; Diane L. Souvaine (Comput. Geom., 1993)

The Furthest-Site Geodesic Voronoi Diagram. - Boris Aronov; Steven Fortune; Gordon T. Wilfong (Discret. Comput. Geom., 1993)

An Invariant Property of Balls in Arrangements of Hyperplanes. - Boris Aronov; Daniel Q. Naiman; János Pach; Micha Sharir (Discret. Comput. Geom., 1993)

On the Zone of a Surface in a Hyperplane Arrangement. - Boris Aronov; Marco Pellegrini 001; Micha Sharir (Discret. Comput. Geom., 1993)

On Translational Motion Planning in 3-Space. - Boris Aronov; Micha Sharir (SCG, 1994)

Crossing Families. - Boris Aronov; Paul Erdös; Wayne Goddard; Daniel J. Kleitman; Michael Klugerman; János Pach; Leonard J. Schulman (Comb., 1994)

Can Visibility Graphs Be Represented Compactly?. - Pankaj K. Agarwal; Noga Alon; Boris Aronov; Subhash Suri (Discret. Comput. Geom., 1994)

On the Number of Minimal 1-Steiner Trees. - Boris Aronov; Marshall W. Bern; David Eppstein (Discret. Comput. Geom., 1994)

Castles in the Air Revisited. - Boris Aronov; Micha Sharir (Discret. Comput. Geom., 1994)

On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. - Boris Aronov; Jirí Matousek 001; Micha Sharir (J. Comb. Theory A, 1994)

The complexity of a single face of a minkowski sum. - Sariel Har-Peled; Timothy M. Chan; Boris Aronov; Dan Halperin; Jack Snoeyink (CCCG, 1995)

Stabbing Triangulations by Lines in 3D. - Pankaj K. Agarwal; Boris Aronov; Subhash Suri (SCG, 1995)

Visibility with Reflection. - Boris Aronov; Alan R. Davis; Tamal K. Dey; Sudebkumar Prasant Pal; D. Chithra Prasad (SCG, 1995)

On Levels in Arrangements of Lines, Segments, Planes, and Triangles. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir (SCG, 1997)

Average-Case Ray Shooting and Minimum Weight Triangulations. - Boris Aronov; Steven Fortune (SCG, 1997)

Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir (SODA, 1997)

Quasi-Planar Graphs Have a Linear Number of Edges. - Pankaj K. Agarwal; Boris Aronov; János Pach; Richard Pollack; Micha Sharir (Comb., 1997)

The Common Exterior of Convex Polygons in the Plane. - Boris Aronov; Micha Sharir (Comput. Geom., 1997)

Star Unfolding of a Polytope with Applications. - Pankaj K. Agarwal; Boris Aronov; Joseph O'Rourke; Catherine A. Schevon (SIAM J. Comput., 1997)

Computing Envelopes in Four Dimensions with Applications. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir (SIAM J. Comput., 1997)

On Translational Motion Planning of a Convex Polyhedron in 3-Space. - Boris Aronov; Micha Sharir (SIAM J. Comput., 1997)

The Union of Convex Polyhedra in Three Dimensions. - Boris Aronov; Micha Sharir; Boaz Tagansky (SIAM J. Comput., 1997)

Results on k-Sets and j-Facets via Continuous Motion. - Artur Andrzejak 001; Boris Aronov; Sariel Har-Peled; Raimund Seidel; Emo Welzl (SCG, 1998)

Visibility Queries in Simple Polygons and Applications. - Boris Aronov; Leonidas J. Guibas; Marek Teichmann; Li Zhang 001 (ISAAC, 1998)

Facility Location on Terrains. - Boris Aronov; Marc J. van Kreveld; René van Oostrum; Kasturi R. Varadarajan (ISAAC, 1998)

Minkowski-Type Theorems and Least-Squares Clustering. - Franz Aurenhammer; F. Hoffmann; Boris Aronov (Algorithmica, 1998)

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. - Pankaj K. Agarwal; Boris Aronov; Timothy M. Chan; Micha Sharir (Discret. Comput. Geom., 1998)

Visibility with Multiple Reflections. - Boris Aronov; Alan R. Davis; Tamal K. Dey; Sudebkumar Prasant Pal; D. Chithra Prasad (Discret. Comput. Geom., 1998)

Visibility with One Reflection. - Boris Aronov; Alan R. Davis; Tamal K. Dey; Sudebkumar Prasant Pal; D. Chithra Prasad (Discret. Comput. Geom., 1998)

Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. - Pankaj K. Agarwal; Boris Aronov; Sariel Har-Peled; Micha Sharir (SCG, 1999)

Motion Planning for a Convex Polygon in a Polygonal Environment. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir (Discret. Comput. Geom., 1999)

Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir (Discret. Comput. Geom., 1999)

Motion Planning for Multiple Robots. - Boris Aronov; Mark de Berg; A. Frank van der Stappen; Petr Svestka; Jules Vleugels (Discret. Comput. Geom., 1999)

Approximating Minimum-Weight Triangulations in Three Dimensions. - Boris Aronov; Steven Fortune (Discret. Comput. Geom., 1999)

On the Number of Views of Polyhedral Scenes. - Boris Aronov; Hervé Brönnimann; Dan Halperin; Robert Schiffenbauer (JCDCG, 2000)

Approximation Algorithms for Minimum-Width Annuli and Shells. - Pankaj K. Agarwal; Boris Aronov; Sariel Har-Peled; Micha Sharir (Discret. Comput. Geom., 2000)

On the Helly Number for Hyperplane Transversals to Unit Balls. - Boris Aronov; Jacob E. Goodman; Richard Pollack; Rephael Wenger (Discret. Comput. Geom., 2000)

On the Complexity of Many Faces in Arrangements of Circles. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir (FOCS, 2001)

Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. - Pankaj K. Agarwal; Boris Aronov; Micha Sharir (Discret. Comput. Geom., 2001)

Polytopes in Arrangements. - Boris Aronov; Tamal K. Dey (Discret. Comput. Geom., 2001)

On the Number of Regular Vertices of the Union of Jordan Regions. - Boris Aronov; Alon Efrat; Dan Halperin; Micha Sharir (Discret. Comput. Geom., 2001)

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets. - Boris Aronov; Jacob E. Goodman; Richard Pollack; Rephael Wenger (Discret. Comput. Geom., 2001)

Cost prediction for ray shooting. - Boris Aronov; Hervé Brönnimann; Allen Y. Chang; Yi-Jen Chiang (SCG, 2002)

A Helly-type theorem for higher-dimensional transversals. - Boris Aronov; Jacob E. Goodman; Richard Pollack (Comput. Geom., 2002)

Visibility Queries and Maintenance in Simple Polygons. - Boris Aronov; Leonidas J. Guibas; Marek Teichmann; Li Zhang 001 (Discret. Comput. Geom., 2002)

Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. - Boris Aronov; Micha Sharir (Discret. Comput. Geom., 2002)

A lower bound on Voronoi diagram complexity. - Boris Aronov (Inf. Process. Lett., 2002)

Facility Location on a Polyhedral Surface. - Boris Aronov; Marc J. van Kreveld; René van Oostrum; Kasturi R. Varadarajan (Discret. Comput. Geom., 2003)

On the union of kapa-round objects. - Boris Aronov; Alon Efrat; Vladlen Koltun; Micha Sharir (SCG, 2004)

On the number of views of translates of a cube and related problems. - Boris Aronov; Robert Schiffenbauer; Micha Sharir (Comput. Geom., 2004)

Distinct Distances in Three and Higher Dimensions. - Boris Aronov; János Pach; Micha Sharir; Gábor Tardos (Comb. Probab. Comput., 2004)

Cell Complexities in Hyperplane Arrangements. - Boris Aronov; Micha Sharir (Discret. Comput. Geom., 2004)

Sparse Geometric Graphs with Small Dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Antoine Vigneron (ISAAC, 2005)

On geometric permutations induced by lines transversal through a fixed point. - Boris Aronov; Shakhar Smorodinsky (SODA, 2005)

Cost-driven octree construction schemes: an experimental study. - Boris Aronov; Hervé Brönnimann; Allen Y. Chang; Yi-Jen Chiang (Comput. Geom., 2005)

Lines Avoiding Unit Balls in Three Dimensions. - Pankaj K. Agarwal; Boris Aronov; Vladlen Koltun; Micha Sharir (Discret. Comput. Geom., 2005)

Incidences between Points and Circles in Three and Higher Dimensions. - Boris Aronov; Vladlen Koltun; Micha Sharir (Discret. Comput. Geom., 2005)

Cutting Triangular Cycles of Lines in Space. - Boris Aronov; Vladlen Koltun; Micha Sharir (Discret. Comput. Geom., 2005)

Geometric Permutations Induced by Line Transversals through a Fixed Point. - Boris Aronov; Shakhar Smorodinsky (Discret. Comput. Geom., 2005)

Fréchet Distance for Curves, Revisited. - Boris Aronov; Sariel Har-Peled; Christian Knauer; Yusu Wang 001; Carola Wenk (ESA, 2006)

The Complexity of Diffuse Reflections in a Simple Polygon. - Boris Aronov; Alan R. Davis; John Iacono; Albert Siu Cheong Yu (LATIN, 2006)

Cost prediction for ray shooting in octrees. - Boris Aronov; Hervé Brönnimann; Allen Y. Chang; Yi-Jen Chiang (Comput. Geom., 2006)

On the Union of kappa-Round Objects in Three and Four Dimensions. - Boris Aronov; Alon Efrat; Vladlen Koltun; Micha Sharir (Discret. Comput. Geom., 2006)

Polyline Fitting of Planar Points under Min-sum Criteria. - Boris Aronov; Tetsuo Asano; Naoki Katoh; Kurt Mehlhorn; Takeshi Tokuyama (Int. J. Comput. Geom. Appl., 2006)

Efficient algorithms for bichromatic separability. - Pankaj K. Agarwal; Boris Aronov; Vladlen Koltun (ACM Trans. Algorithms, 2006)

Largest Subsets of Triangles in a Triangulation. - Boris Aronov; Marc J. van Kreveld; Maarten Löffler; Rodrigo I. Silveira (CCCG, 2007)

On approximate halfspace range counting and relative epsilon-approximations. - Boris Aronov; Sariel Har-Peled; Micha Sharir (SCG, 2007)

Optimal Triangulation with Steiner Points. - Boris Aronov; Tetsuo Asano; Stefan Funke (ISAAC, 2007)

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains. - Boris Aronov; Mark de Berg; Shripad Thite (ESA, 2008)

Feed-links for network extensions. - Boris Aronov; Kevin Buchin; Maike Buchin; Bart M. P. Jansen; Tom de Jong; Marc J. van Kreveld; Maarten Löffler; Jin Luo; Rodrigo I. Silveira; Bettina Speckmann (GIS, 2008)

Cutting cycles of rods in space: hardness and approximation. - Boris Aronov; Mark de Berg; Chris Gray; Elena Mumford (SODA, 2008)

Sparse geometric graphs with small dilation. - Boris Aronov; Mark de Berg; Otfried Cheong; Joachim Gudmundsson; Herman J. Haverkort; Michiel H. M. Smid; Antoine Vigneron (Comput. Geom., 2008)

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space. - Boris Aronov; Mark de Berg; Chris Gray (Comput. Geom., 2008)

A Generalization of Magic Squares with Applications to Digital Halftoning. - Boris Aronov; Tetsuo Asano; Yosuke Kikuchi; Subhas C. Nandy; Shinji Sasahara; Takeaki Uno (Theory Comput. Syst., 2008)

On Approximating the Depth and Related Problems. - Boris Aronov; Sariel Har-Peled (SIAM J. Comput., 2008)

Small-size epsilon-nets for axis-parallel rectangles and boxes. - Boris Aronov; Esther Ezra; Micha Sharir (STOC, 2009)

Connect the Dot: Computing Feed-Links with Minimum Dilation. - Boris Aronov; Kevin Buchin; Maike Buchin; Marc J. van Kreveld; Maarten Löffler; Jun Luo 008; Rodrigo I. Silveira; Bettina Speckmann (WADS, 2009)

Minimum-Cost Load-Balancing Partitions. - Boris Aronov; Paz Carmi; Matthew J. Katz (Algorithmica, 2009)

Small weak epsilon-nets. - Boris Aronov; Franz Aurenhammer; Ferran Hurtado; Stefan Langerman; David Rappaport; Carlos Seara; Shakhar Smorodinsky (Comput. Geom., 2009)

Computing similarity between piecewise-linear functions. - Pankaj K. Agarwal; Boris Aronov; Marc J. van Kreveld; Maarten Löffler; Rodrigo I. Silveira (SCG, 2010)

Optimal Triangulations of Points and Segments with Steiner Points. - Boris Aronov; Tetsuo Asano; Stefan Funke (Int. J. Comput. Geom. Appl., 2010)

Small-Size $ eps$-Nets for Axis-Parallel Rectangles and Boxes. - Boris Aronov; Esther Ezra; Micha Sharir (SIAM J. Comput., 2010)

Approximate Halfspace Range Counting. - Boris Aronov; Micha Sharir (SIAM J. Comput., 2010)

Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. - Mohammad Ali Abam; Boris Aronov; Mark de Berg; Amirali Khosravi (SCG, 2011)

Improved Bound for the Union of Fat Triangles. - Esther Ezra; Boris Aronov; Micha Sharir (SODA, 2011)

Peeling Meshed Potatoes. - Boris Aronov; Marc J. van Kreveld; Maarten Löffler; Rodrigo I. Silveira (Algorithmica, 2011)

Witness (Delaunay) graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Comput. Geom., 2011)

Complexity of a Single Face in an Arrangement of s-Intersecting Curves - Boris Aronov; Dmitriy Drusvyatskiy (CoRR, 2011)

Lines Pinning Lines. - Boris Aronov; Otfried Cheong; Xavier Goaoc; Günter Rote (Discret. Comput. Geom., 2011)

Connect the dot: Computing feed-links for network extension. - Boris Aronov; Kevin Buchin; Maike Buchin; Bart M. P. Jansen; Tom de Jong; Marc J. van Kreveld; Maarten Löffler; Jun Luo 008; Rodrigo I. Silveira; Bettina Speckmann (J. Spatial Inf. Sci., 2011)

Minimizing the error of linear separators on linearly inseparable data. - Boris Aronov; Delia Garijo; Yurai Núñez Rodríguez; David Rappaport; Carlos Seara; Jorge Urrutia (Discret. Appl. Math., 2012)

Unions of Fat Convex Polytopes Have Short Skeletons. - Boris Aronov; Mark de Berg (Discret. Comput. Geom., 2012)

How to Cover Most of a Point Set with a V-Shape of Minimum Width. - Boris Aronov; John Iacono; Özgür Özkan; Mark V. Yagnatinsky (CCCG, 2013)

How To Place a Point to Maximize Angles. - Boris Aronov; Mark V. Yagnatinsky (CCCG, 2013)

Segmentation of Trajectories for Non-Monotone Criteria. - Boris Aronov; Anne Driemel; Marc J. van Kreveld; Maarten Löffler; Frank Staals (SODA, 2013)

Distance-Sensitive Planar Point Location. - Boris Aronov; Mark de Berg; Marcel Roeloffzen; Bettina Speckmann (WADS, 2013)

On the Union Complexity of Diametral Disks. - Boris Aronov; Muriel Dulieu; Rom Pinchasi; Micha Sharir (Electron. J. Comb., 2013)

How to cover a point set with a V-shape of minimum width. - Boris Aronov; Muriel Dulieu (Comput. Geom., 2013)

Witness Gabriel graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Comput. Geom., 2013)

Computing Correlation between Piecewise-Linear Functions. - Pankaj K. Agarwal; Boris Aronov; Marc J. van Kreveld; Maarten Löffler; Rodrigo I. Silveira (SIAM J. Comput., 2013)

Quickly Placing a Point to Maximize Angles. - Boris Aronov; Mark V. Yagnatinsky (CCCG, 2014)

Witness Rectangle Graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Graphs Comb., 2014)

Mutual witness proximity graphs. - Boris Aronov; Muriel Dulieu; Ferran Hurtado (Inf. Process. Lett., 2014)

Improved Bounds for the Union of Locally Fat Objects in the Plane. - Boris Aronov; Mark de Berg; Esther Ezra; Micha Sharir (SIAM J. Comput., 2014)

Distance-sensitive planar point location. - Boris Aronov; Mark de Berg; David Eppstein; Marcel Roeloffzen; Bettina Speckmann (Comput. Geom., 2016)

Nearest-Neighbor Searching Under Uncertainty II. - Pankaj K. Agarwal; Boris Aronov; Sariel Har-Peled; Jeff M. Phillips; Ke Yi 001; Wuzhou Zhang (ACM Trans. Algorithms, 2016)

Segmentation of Trajectories on Nonmonotone Criteria. - Boris Aronov; Anne Driemel; Marc J. van Kreveld; Maarten Löffler; Frank Staals (ACM Trans. Algorithms, 2016)

Computing the Distance between Piecewise-Linear Bivariate Functions. - Guillaume Moroz; Boris Aronov (ACM Trans. Algorithms, 2016)

Nearest-Neighbor Search Under Uncertainty. - Boris Aronov; John Iacono; Khadijeh Sheikhan (CCCG, 2017)

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. - Boris Aronov; Otfried Cheong; Michael Gene Dobbins; Xavier Goaoc (Discret. Comput. Geom., 2017)

Time-space trade-offs for triangulating a simple polygon. - Boris Aronov; Matias Korman; Simon Pratt; André van Renssen; Marcel Roeloffzen (J. Comput. Geom., 2017)

Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. - Boris Aronov; Mark de Berg; Aleksandar Markovic 001; Gerhard J. Woeginger (COCOON, 2018)

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World. - Boris Aronov; Alon Efrat; Ming Li 003; Jie Gao 001; Joseph S. B. Mitchell; Valentin Polishchuk; Boyang Wang; Hanyu Quan; Jiaxin Ding (MobiHoc, 2018)

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. - Boris Aronov; Prosenjit Bose; Erik D. Demaine; Joachim Gudmundsson; John Iacono; Stefan Langerman; Michiel H. M. Smid (Algorithmica, 2018)

Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. - Boris Aronov; Micha Sharir (Discret. Comput. Geom., 2018)

Batched Point Location in SINR Diagrams via Algebraic Tools. - Boris Aronov; Matthew J. Katz (ACM Trans. Algorithms, 2018)

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. - Pankaj K. Agarwal; Boris Aronov; Esther Ezra; Joshua Zahl (SoCG, 2019)

Efficient Nearest-Neighbor Query and Clustering of Planar Curves. - Boris Aronov; Omrit Filtser; Michael Horton; Matthew J. Katz; Khadijeh Sheikhan (WADS, 2019)

More Turán-Type Theorems for Triangles in Convex Point Sets. - Boris Aronov; Vida Dujmovic; Pat Morin; Aurélien Ooms; Luís Fernando Schultz Xavier da Silveira (Electron. J. Comb., 2019)

Guest Editors' Foreword. - Boris Aronov; Matthew J. Katz (Discret. Comput. Geom., 2019)

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. - Boris Aronov; Esther Ezra; Micha Sharir (SoCG, 2020)

Dynamic Time Warping-Based Proximity Problems. - Boris Aronov; Matthew J. Katz; Elad Sulami (MFCS, 2020)

Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. - Boris Aronov; Mark de Berg; Aleksandar Markovic 001; Gerhard J. Woeginger (Algorithmica, 2020)

On beta-Plurality Points in Spatial Voting Games. - Boris Aronov; Mark de Berg; Joachim Gudmundsson; Michael Horton (CoRR, 2020)

On Two-Handed Planar Assembly Partitioning. - Pankaj K. Agarwal; Boris Aronov; Tzvika Geft; Dan Halperin (CoRR, 2020)

Eliminating Depth Cycles Among Triangles in Three Dimensions. - Boris Aronov; Edward Y. Miller; Micha Sharir (Discret. Comput. Geom., 2020)

Resolving SINR Queries in a Dynamic Setting. - Boris Aronov; Gali Bar-On; Matthew J. Katz (SIAM J. Comput., 2020)

Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications. - Boris Aronov; Esther Ezra; Joshua Zahl (SIAM J. Comput., 2020)

On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. - Pankaj K. Agarwal; Boris Aronov; Tzvika Geft; Dan Halperin (SODA, 2021)

On pseudo-disk hypergraphs. - Boris Aronov; Anirudh Donakonda; Esther Ezra; Rom Pinchasi (Comput. Geom., 2021)

Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. - Pankaj K. Agarwal; Boris Aronov; Esther Ezra; Joshua Zahl (SIAM J. Comput., 2021)

On β-Plurality Points in Spatial Voting Games. - Boris Aronov; Mark de Berg; Joachim Gudmundsson; Michael Horton (ACM Trans. Algorithms, 2021)

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. - Pankaj K. Agarwal; Boris Aronov; Esther Ezra; Matthew J. Katz; Micha Sharir (SoCG, 2022)

Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors. - Boris Aronov; Matthew J. Katz (SWAT, 2022)

Geometric Pattern Matching Reduces to k-SUM. - Boris Aronov; Jean Cardinal (Discret. Comput. Geom., 2022)

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. - Boris Aronov; Esther Ezra; Micha Sharir (Discret. Comput. Geom., 2022)

Bipartite Diameter and Other Measures Under Translation. - Boris Aronov; Omrit Filtser; Matthew J. Katz; Khadijeh Sheikhan (Discret. Comput. Geom., 2022)

Partitioning Axis-Parallel Lines in 3D. - Boris Aronov; Abdul Basit; Mark de Berg; Joachim Gudmundsson (Comput. Geom. Topol., 2023)

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. - Boris Aronov; Mark de Berg; Jean Cardinal; Esther Ezra; John Iacono; Micha Sharir (Comput. Geom., 2023)

Time and space efficient collinearity indexing. - Boris Aronov; Esther Ezra; Micha Sharir; Guy Zigdon (Comput. Geom., 2023)

Eight-Partitioning Points in 3D, and Efficiently Too. - Boris Aronov; Abdul Basit 001; Indu Ramesh; Gianluca Tasinato; Uli Wagner 001 (SoCG, 2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in ℝ². - Boris Aronov; Mark de Berg; Leonidas Theocharous (SoCG, 2024)

Discrete Fréchet Distance Oracles. - Boris Aronov; Tsuri Farhana; Matthew J. Katz; Indu Ramesh (SoCG, 2024)

A General Technique for Searching in Implicit Sets via Function Inversion. - Boris Aronov; Jean Cardinal; Justin Dallant; John Iacono (SOSA, 2024)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in R2. - Boris Aronov; Mark de Berg; Leonidas Theocharous (CoRR, 2024)

Discrete Fr 'echet Distance Oracles. - Boris Aronov; Tsuri Farhana; Matthew J. Katz; Indu Ramesh (CoRR, 2024)