Boris Aronov

ORCID

Publication Activity (10 Years)

Years Active: 1987-2023
Publications (10 Years): 67

Top Venues

CoRR

Discret. Comput. Geom.

ACM Trans. Algorithms

SoCG

Publications

Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109 (2023)
Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson
Partitioning Axis-Parallel Lines in 3D. Comput. Geom. Topol. 2 (1) (2023)
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR (2023)
Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon
Time and space efficient collinearity indexing. Comput. Geom. 110 (2023)
Boris Aronov, Esther Ezra, Micha Sharir
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. Discret. Comput. Geom. 68 (4) (2022)
Boris Aronov, Matthew J. Katz
Dynamic Approximate Multiplicatively-Weighted Nearest Neighbors. SWAT (2022)
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. CoRR (2022)
Boris Aronov, Abdul Basit, Mark de Berg, Joachim Gudmundsson
Partitioning axis-parallel lines in 3D. CoRR (2022)
Boris Aronov, Jean Cardinal
Geometric Pattern Matching Reduces to k-SUM. Discret. Comput. Geom. 68 (3) (2022)
Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan
Bipartite Diameter and Other Measures Under Translation. Discret. Comput. Geom. 68 (3) (2022)
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. SoCG (2022)
Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi
On pseudo-disk hypergraphs. Comput. Geom. 92 (2021)
Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. SODA (2021)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC (2021)
Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
On β-Plurality Points in Spatial Voting Games. ACM Trans. Algorithms 17 (3) (2021)
Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR (2021)
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl
Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SIAM J. Comput. 50 (2) (2021)
Boris Aronov, Gali Bar-On, Matthew J. Katz
Resolving SINR Queries in a Dynamic Setting. SIAM J. Comput. 49 (6) (2020)
Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, Dan Halperin
On Two-Handed Planar Assembly Partitioning. CoRR (2020)
Boris Aronov, Esther Ezra, Micha Sharir
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. CoRR (2020)
Boris Aronov, Edward Y. Miller, Micha Sharir
Eliminating Depth Cycles Among Triangles in Three Dimensions. Discret. Comput. Geom. 64 (3) (2020)
Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
On β-Plurality Points in Spatial Voting Games. SoCG (2020)
Boris Aronov, Jean Cardinal
Geometric Pattern Matching Reduces to k-SUM. CoRR (2020)
Boris Aronov, Matthew J. Katz, Elad Sulami
Dynamic Time Warping-Based Proximity Problems. MFCS (2020)
Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton
On beta-Plurality Points in Spatial Voting Games. CoRR (2020)
Boris Aronov, Jean Cardinal
Geometric Pattern Matching Reduces to k-SUM. ISAAC (2020)
Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces. Algorithmica 82 (5) (2020)
Boris Aronov, Esther Ezra, Joshua Zahl
with Applications. SIAM J. Comput. 49 (6) (2020)
Boris Aronov, Esther Ezra, Micha Sharir
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. SoCG (2020)
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. SoCG (2019)
Boris Aronov, Esther Ezra, Joshua Zahl
with Applications. CoRR (2019)
Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan
Bipartite Diameter and Other Measures Under Translation. STACS (2019)
Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. WADS (2019)
Boris Aronov, Omrit Filtser, Michael Horton, Matthew J. Katz, Khadijeh Sheikhan
Efficient Nearest-Neighbor Query and Clustering of Planar Curves. CoRR (2019)
Boris Aronov, Matthew J. Katz
Guest Editors' Foreword. Discret. Comput. Geom. 61 (4) (2019)
Boris Aronov, Esther Ezra, Joshua Zahl
with Applications. SODA (2019)
Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira
More Turán-Type Theorems for Triangles in Convex Point Sets. Electron. J. Comb. 26 (1) (2019)
Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. CoRR (2018)
Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. Algorithmica 80 (11) (2018)
Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Joshua Zahl
An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications. CoRR (2018)
Boris Aronov, Alon Efrat, Ming Li, Jie Gao, Joseph S. B. Mitchell, Valentin Polishchuk, Boyang Wang, Hanyu Quan, Jiaxin Ding
Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World. MobiHoc (2018)
Boris Aronov, Matthew J. Katz
Batched Point Location in SINR Diagrams via Algebraic Tools. ACM Trans. Algorithms 14 (4) (2018)
Boris Aronov, Micha Sharir
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. Discret. Comput. Geom. 59 (3) (2018)
Boris Aronov, Anirudh Donakonda, Esther Ezra, Rom Pinchasi
On Pseudo-disk Hypergraphs. CoRR (2018)
Boris Aronov, Gali Bar-On, Matthew J. Katz
Resolving SINR Queries in a Dynamic Setting. ICALP (2018)
Boris Aronov, Mark de Berg, Aleksandar Markovic, Gerhard J. Woeginger
Non-monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces. COCOON (2018)
Boris Aronov, Gali Bar-On, Matthew J. Katz
Resolving SINR Queries in a Dynamic Setting. CoRR (2018)
Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira
More Turán-Type Theorems for Triangles in Convex Point Sets. CoRR (2017)
Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. Discret. Comput. Geom. 57 (1) (2017)
Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
Time-space trade-offs for triangulating a simple polygon. J. Comput. Geom. 8 (1) (2017)
Boris Aronov, John Iacono, Khadijeh Sheikhan
Nearest-Neighbor Search Under Uncertainty. CCCG (2017)
Boris Aronov, Edward Y. Miller, Micha Sharir
Eliminating Depth Cycles among Triangles in Three Dimensions. SODA (2017)
Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang
Nearest-Neighbor Searching Under Uncertainty II. CoRR (2016)
Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. SoCG (2016)
Boris Aronov, Edward Y. Miller, Micha Sharir
Eliminating Depth Cycles among Triangles in Three Dimensions. CoRR (2016)
Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals
Segmentation of Trajectories on Nonmonotone Criteria. ACM Trans. Algorithms 12 (2) (2016)
Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang
Nearest-Neighbor Searching Under Uncertainty II. ACM Trans. Algorithms 13 (1) (2016)
Guillaume Moroz, Boris Aronov
Computing the Distance between Piecewise-Linear Bivariate Functions. ACM Trans. Algorithms 12 (1) (2016)
Boris Aronov, Micha Sharir
Almost tight bounds for eliminating depth cycles in three dimensions. STOC (2016)
Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann
Distance-sensitive planar point location. Comput. Geom. 54 (2016)
Boris Aronov, Mark de Berg, David Eppstein, Marcel Roeloffzen, Bettina Speckmann
Distance-Sensitive Planar Point Location. CoRR (2016)
Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
Time-Space Trade-offs for Triangulating a Simple Polygon. SWAT (2016)
Boris Aronov, Micha Sharir
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. CoRR (2015)
Boris Aronov, Otfried Cheong, Michael Gene Dobbins, Xavier Goaoc
The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions. CoRR (2015)
Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk
Fréchet Distance for Curves, Revisited. CoRR (2015)
Boris Aronov, Matthew J. Katz
Batched Point Location in SINR Diagrams via Algebraic Tools. ICALP (1) (2015)
Boris Aronov, Matias Korman, Simon Pratt, André van Renssen, Marcel Roeloffzen
Time-Space Trade-offs for Triangulating a Simple Polygon. CoRR (2015)
Boris Aronov, Muriel Dulieu, Ferran Hurtado
Witness Rectangle Graphs. Graphs Comb. 30 (4) (2014)
Boris Aronov, Mark V. Yagnatinsky
Quickly Placing a Point to Maximize Angles. CCCG (2014)
Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir
Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. 43 (2) (2014)
Boris Aronov, Matthew J. Katz
Batched Point Location in SINR Diagrams via Algebraic Tools. CoRR (2014)
Boris Aronov, Muriel Dulieu, Ferran Hurtado
Mutual witness proximity graphs. Inf. Process. Lett. 114 (10) (2014)
Boris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals
Segmentation of Trajectories for Non-Monotone Criteria. SODA (2013)
Boris Aronov, Mark V. Yagnatinsky
How To Place a Point to Maximize Angles. CCCG (2013)
Boris Aronov, Muriel Dulieu
How to cover a point set with a V-shape of minimum width. Comput. Geom. 46 (3) (2013)
Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir
On the Union Complexity of Diametral Disks. Electron. J. Comb. 20 (2) (2013)
Boris Aronov, Mark V. Yagnatinsky
How To Place a Point to Maximize Angles. CoRR (2013)
Boris Aronov, Muriel Dulieu, Ferran Hurtado
Witness Gabriel graphs. Comput. Geom. 46 (7) (2013)
Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky
How to Cover Most of a Point Set with a V-Shape of Minimum Width. CCCG (2013)
Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang
Nearest neighbor searching under uncertainty II. PODS (2013)
Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann
Distance-Sensitive Planar Point Location. WADS (2013)
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira
Computing Correlation between Piecewise-Linear Functions. SIAM J. Comput. 42 (5) (2013)
Boris Aronov, Mark de Berg
Unions of Fat Convex Polytopes Have Short Skeletons. Discret. Comput. Geom. 48 (1) (2012)
Guillaume Moroz, Boris Aronov
Computing the distance between piecewise-linear bivariate functions. SODA (2012)
Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia
Minimizing the error of linear separators on linearly inseparable data. Discret. Appl. Math. 160 (10-11) (2012)
Boris Aronov, Muriel Dulieu, Ferran Hurtado
Witness Rectangle Graphs CoRR (2011)
Boris Aronov, Kevin Buchin, Maike Buchin, Bart M. P. Jansen, Tom de Jong, Marc J. van Kreveld, Maarten Löffler, Jun Luo, Rodrigo I. Silveira, Bettina Speckmann
Connect the dot: Computing feed-links for network extension. J. Spatial Inf. Sci. 3 (1) (2011)
Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira
Peeling Meshed Potatoes. Algorithmica 60 (2) (2011)
Boris Aronov, Muriel Dulieu, Ferran Hurtado
Witness Rectangle Graphs. WADS (2011)
Boris Aronov, Dmitriy Drusvyatskiy
Complexity of a Single Face in an Arrangement of s-Intersecting Curves CoRR (2011)
Boris Aronov, Muriel Dulieu
How to Cover a Point Set with a V-Shape of Minimum Width. WADS (2011)
Boris Aronov, Muriel Dulieu
How to Cover a Point Set with a V-Shape of Minimum Width CoRR (2011)
Mohammad Ali Abam, Boris Aronov, Mark de Berg, Amirali Khosravi
Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. SCG (2011)
Boris Aronov, Muriel Dulieu, Ferran Hurtado
Witness (Delaunay) graphs. Comput. Geom. 44 (6-7) (2011)
Boris Aronov, Otfried Cheong, Xavier Goaoc, Günter Rote
Lines Pinning Lines. Discret. Comput. Geom. 45 (2) (2011)
Guillaume Moroz, Boris Aronov
Computing the Distance between Piecewise-Linear Bivariate Functions CoRR (2011)
Esther Ezra, Boris Aronov, Micha Sharir
Improved Bound for the Union of Fat Triangles. SODA (2011)
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira
Computing similarity between piecewise-linear functions. SCG (2010)
Boris Aronov, Esther Ezra, Micha Sharir
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. 39 (7) (2010)
Boris Aronov, Tetsuo Asano, Stefan Funke
Optimal Triangulations of Points and Segments with Steiner Points. Int. J. Comput. Geom. Appl. 20 (1) (2010)

Boris Aronov.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Boris Aronov