Boris Aronov

发表

Triangles in space or building (and analyzing) castles in the air

Micha Sharir, Boris Aronov, M. Sharir, 1990, SCG '88.

Modeling environmental impact of cybernetic transportation system

Boris Aronov, Leonid Tartakovsky, Albert Mosyak, 2015 .

Facility Location on a Polyhedral Surface

Boris Aronov, Marc J. van Kreveld, René van Oostrum, 2003, Discret. Comput. Geom..

Cost-driven octree construction schemes: an experimental study

Boris Aronov, Hervé Brönnimann, Yi-Jen Chiang, 2005, Comput. Geom..

The complexity of a single face of a minkowski sum

Timothy M. Chan, Boris Aronov, Sariel Har-Peled, 1995, CCCG.

On the geodesic Voronoi diagram of point sites in a simple polygon

Boris Aronov, 1987, SCG '87.

On the Zone of a Surface in a Hyperplane Arrangement

Micha Sharir, Boris Aronov, 1991, WADS.

Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 2000, SODA '00.

On geometric permutations induced by lines transversal through a fixed point

Boris Aronov, Shakhar Smorodinsky, 2005, SODA '05.

Nearest-Neighbor Search Under Uncertainty

Boris Aronov, John Iacono, Khadijeh Sheikhan, 2017, CCCG.

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Joachim Gudmundsson, Michiel H. M. Smid, Prosenjit Bose, 2017, Algorithmica.

The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains

Boris Aronov, Mark de Berg, Shripad Thite, 2008, ESA.

A lower bound on Voronoi diagram complexity

Boris Aronov, B. Aronov, 2002, Inf. Process. Lett..

Almost tight bounds for eliminating depth cycles in three dimensions

Micha Sharir, Boris Aronov, 2016, STOC.

On the number of minimal 1-Steiner trees

David Eppstein, Boris Aronov, Marshall W. Bern, 1994, Discret. Comput. Geom..

On the complexity of many faces in arrangements of circles

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

The furthest-site geodesic voronoi diagram

Boris Aronov, Gordon T. Wilfong, Steven Fortune, 1993, Discret. Comput. Geom..

On approximate halfspace range counting and relative epsilon-approximations

Micha Sharir, Boris Aronov, Sariel Har-Peled, 2007, SCG '07.

How To Place a Point to Maximize Angles pdf

Boris Aronov, Mark V. Yagnatinsky, 2013, CCCG.

On the Union Complexity of Diametral Disks

Micha Sharir, Boris Aronov, Rom Pinchasi, 2013, Electron. J. Comb..

Computing envelopes in four dimensions with applications

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 1994, SCG '94.

Fréchet Distance for Curves, Revisited

Boris Aronov, Sariel Har-Peled, Christian Knauer, 2006, ESA.

How to Cover a Point Set with a V-Shape of Minimum Width

Boris Aronov, Muriel Dulieu, 2011, WADS.

Visibility with Multiple Reflections

Boris Aronov, Tamal K. Dey, Sudebkumar Prasant Pal, 1998, Discret. Comput. Geom..

Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces

Micha Sharir, Boris Aronov, 2002, Discret. Comput. Geom..

Batched Point Location in SINR Diagrams via Algebraic Tools

Boris Aronov, Matthew J. Katz, M. J. Katz, 2014, ICALP.

Complexity of a Single Face in an Arrangement of s-Intersecting Curves pdf

Boris Aronov, Dmitriy Drusvyatskiy, 2011, ArXiv.

Efficient algorithms for bichromatic separability

Boris Aronov, Pankaj K. Agarwal, Vladlen Koltun, 2004, SODA '04.

Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors

Boris Aronov, Matthew J. Katz, 2017, Symposium on Computational Geometry.

Counting facets and incidences

Boris Aronov, Pankaj K. Agarwal, 1992, Discret. Comput. Geom..

Geometric Permutations Induced by Line Transversals through a Fixed Point

Boris Aronov, Shakhar Smorodinsky, 2005, Discret. Comput. Geom..

Maarten Löffler, Boris Aronov, Pankaj K. Agarwal, 2010, SoCG '10.

Constructive Polynomial Partitioning for Algebraic Curves in ℝ3 with Applications

Joshua Zahl, Boris Aronov, Esther Ezra, 2020, SIAM J. Comput..

35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA

Micha Sharir, Boris Aronov, Esther Ezra, 2019, International Symposium on Computational Geometry.

Minimum-Speed Motions

Boris Aronov, Gordon T. Wilfong, Steven Fortune, 1991, Int. J. Robotics Res..

Connect the Dot: Computing Feed-Links with Minimum Dilation

Bettina Speckmann, Maarten Löffler, Boris Aronov, 2009, WADS.

Algorithms and Computation

Boris Aronov, Marc van Kreveld, René van Oostrum, 1998, Lecture Notes in Computer Science.

Geometric Pattern Matching Reduces to k-SUM

Jean Cardinal, Boris Aronov, 2020, ISAAC.

Results on k-sets and j-facets via continuous motion

Boris Aronov, Sariel Har-Peled, Artur Andrzejak, 1998, SCG '98.

Connect the dot: Computing feed-links for network extension

Bettina Speckmann, Maarten Löffler, Boris Aronov, 2011, J. Spatial Inf. Sci..

Cell Complexities in Hyperplane Arrangements

Micha Sharir, Boris Aronov, 2004, Discret. Comput. Geom..

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

Boris Aronov, Mark de Berg, Chris Gray, 2006, SCG '06.

Visibility with reflection

Boris Aronov, Tamal K. Dey, Sudebkumar Prasant Pal, 1995, SCG '95.

Computing the Distance between Piecewise-Linear Bivariate Functions

Boris Aronov, Guillaume Moroz, B. Aronov, 2011, TALG.

More Turán-Type Theorems for Triangles in Convex Point Sets pdf

Pat Morin, Boris Aronov, Vida Dujmovic, 2019, Electron. J. Comb..

Are Friends of My Friends Too Social?: Limitations of Location Privacy in a Socially-Connected World

Jie Gao, Joseph S. B. Mitchell, Ming Li, 2018, MobiHoc.

On the sum of squares of cell complexities in hyperplane arrangements

Micha Sharir, Jirí Matousek, Boris Aronov, 1991, SCG '91.

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

Joshua Zahl, Boris Aronov, Pankaj K. Agarwal, 2019, Symposium on Computational Geometry.

Points and triangles in the plane and halving planes in space

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1990, SCG '90.

On the zone of a surface in a hyperplane arrangement

Micha Sharir, Boris Aronov, Marco Pellegrini, 1993, Discret. Comput. Geom..

Results on -facets via continuous motion

Boris Aronov, Sariel Har-Peled, Artur Andrzejak, 1998, SoCG 1998.

Computing external farthest neighbors for a simple polygon

Alok Aggarwal, Subhash Suri, Boris Aronov, 1991, Discret. Appl. Math..

The union of convex polyhedra in three dimensions

Micha Sharir, Boris Aronov, M. Sharir, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Peeling Meshed Potatoes

Maarten Löffler, Boris Aronov, Marc J. van Kreveld, 2009, Algorithmica.

The number of edges of many faces in a line segment arrangement

Leonidas J. Guibas, Micha Sharir, Boris Aronov, 1992, Comb..

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

Micha Sharir, Boris Aronov, Esther Ezra, 2010, SIAM J. Comput..

Small weak epsilon nets

Franz Aurenhammer, Boris Aronov, Stefan Langerman, 2005, CCCG.

Time-space trade-offs for triangulating a simple polygon

Boris Aronov, Marcel Roeloffzen, André van Renssen, 2017, J. Comput. Geom..

Ray shooting and intersection searching amidst fat convex polyhedra in 3-space

Boris Aronov, Mark de Berg, Chris Gray, 2008, Comput. Geom..

Non-Monochromatic and Conflict-Free Coloring on Tree Spaces and Planar Network Spaces

Gerhard J. Woeginger, Boris Aronov, Mark de Berg, 2018, COCOON.

Facility Location on Terrains

Boris Aronov, Marc J. van Kreveld, René van Oostrum, 1998, ISAAC.

Witness Rectangle Graphs pdf

Boris Aronov, Ferran Hurtado, Muriel Dulieu, 2011, Graphs Comb..

Efficient Nearest-Neighbor Query and Clustering of Planar Curves

Boris Aronov, Matthew J. Katz, Omrit Filtser, 2019, WADS.

Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications

Joshua Zahl, Boris Aronov, Esther Ezra, 2019, SODA.

Castles in the air revisited

Micha Sharir, Boris Aronov, 1992, SCG '92.

Visibility with Multiple Reflections

Boris Aronov, Tamal K. Dey, Sudebkumar Prasant Pal, 1996, SWAT.

Motion Planning for a Convex Polygon in a Polygonal Environment

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 1999, Discret. Comput. Geom..

Detecting duplicates among similar bit vectors

Boris Aronov, John Iacono, 2004 .

Polyline Fitting of Planar Points under Min-sum Criteria

Kurt Mehlhorn, Boris Aronov, Tetsuo Asano, 2006, Int. J. Comput. Geom. Appl..

Nonoverlap of the star unfolding

Boris Aronov, Joseph O'Rourke, 1992, Discret. Comput. Geom..

Bipartite Diameter and Other Measures Under Translation

Boris Aronov, Matthew J. Katz, Omrit Filtser, 2019, Discrete & Computational Geometry.

Visibility with One Reflection

Boris Aronov, Tamal K. Dey, Sudebkumar Prasant Pal, 1998, Discret. Comput. Geom..

Selecting distances in the plane

Micha Sharir, Subhash Suri, Boris Aronov, 1990, SCG '90.

Visibility Queries and Maintenance in Simple Polygons

Leonidas J. Guibas, Boris Aronov, Marek Teichmann, 2002, Discret. Comput. Geom..

Cost prediction for ray shooting

Boris Aronov, Hervé Brönnimann, Yi-Jen Chiang, 2002, SCG '02.

Star Unfolding of a Polytope with Applications (Extended Abstract)

Boris Aronov, Pankaj K. Agarwal, Joseph O'Rourke, 1990, SWAT.

Sparse geometric graphs with small dilation pdf

Joachim Gudmundsson, Michiel H. M. Smid, Boris Aronov, 2008, Comput. Geom..

A Generalization of Magic Squares with Applications to Digital Halftoning

Boris Aronov, Takeaki Uno, Tetsuo Asano, 2004, ISAAC.

Points and triangles in the plane and halving planes in space

Leonidas J. Guibas, Bernard Chazelle, Micha Sharir, 1991, Discret. Comput. Geom..

Polytopes in Arrangements

Boris Aronov, Tamal K. Dey, 2001, Discret. Comput. Geom..

On levels in arrangements of lines, segments, planes, and triangles

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 1997, SCG '97.

Polytopes in Arrangements

Boris Aronov, Tamal K. Dey, B. Aronov, 1999, SCG '99.

Cost-driven octree construction schemes: an experimental study

Boris Aronov, Hervé Brönnimann, Yi-Jen Chiang, 2003, SCG '03.

An invariant property of balls in arrangements of hyperplanes

Micha Sharir, Boris Aronov, János Pach, 1993, Discret. Comput. Geom..

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%

Micha Sharir, Timothy M. Chan, Boris Aronov, 1998, Discret. Comput. Geom..

Crossing families

Wayne Goddard, Paul Erdös, Boris Aronov, 1991, SCG '91.

On the Union of κ-Round Objects in Three and Four Dimensions

Micha Sharir, Boris Aronov, Vladlen Koltun, 2004, Discret. Comput. Geom..

A Helly-type theorem for higher-dimensional transversals

Boris Aronov, Richard Pollack, Jacob E. Goodman, 2002, Comput. Geom..

Feed-links for network extensions

Bettina Speckmann, Maarten Löffler, Jin Luo, 2008, GIS '08.

A Generalization of Magic Squares with Applications to Digital Halftoning

Boris Aronov, Takeaki Uno, Tetsuo Asano, 2004, Theory of Computing Systems.

On the union of kapa-round objects.

Micha Sharir, Boris Aronov, Vladlen Koltun, 2004, International Symposium on Computational Geometry.

Nearest-Neighbor Searching Under Uncertainty II

Boris Aronov, Pankaj K. Agarwal, Sariel Har-Peled, 2016 .

Unions of Fat Convex Polytopes Have Short Skeletons

Boris Aronov, Mark de Berg, 2012, Discret. Comput. Geom..

Mutual witness proximity graphs

Boris Aronov, Ferran Hurtado, Muriel Dulieu, 2014, Inf. Process. Lett..

Approximation and exact algorithms for minimum-width annuli and shells

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 1999, SCG '99.

Selecting distances in the plane

Micha Sharir, Subhash Suri, Boris Aronov, 2005, Algorithmica.

Batched Point Location in SINR Diagrams via Algebraic Tools pdf

Boris Aronov, Matthew J. Katz, 2015, ICALP.

Largest Subsets of Triangles in a Triangulation

Maarten Löffler, Boris Aronov, Marc J. van Kreveld, 2007, CCCG.

Distinct Distances in Three and Higher Dimensions

Micha Sharir, Boris Aronov, János Pach, 2004, Comb. Probab. Comput..

Sparse Geometric Graphs with Small Dilation

Joachim Gudmundsson, Boris Aronov, Mark de Berg, 2005, ISAAC.

Approximating Minimum-Weight Triangulations in Three Dimensions

Boris Aronov, Steven Fortune, 1999, Discret. Comput. Geom..

Dynamic Time Warping-Based Proximity Problems

Boris Aronov, Matthew J. Katz, Elad Sulami, 2020, MFCS.

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets

Boris Aronov, Rephael Wenger, Richard Pollack, 2000, SCG '00.

On Compatible Triangulations of Simple Polygons

Boris Aronov, Raimund Seidel, Diane L. Souvaine, 1993, Comput. Geom..

On lines avoiding unit balls in three dimensions

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 2004, SCG '04.

Motion Planning for Multiple Robots

Boris Aronov, Mark de Berg, Jules Vleugels, 1998, SCG '98.

Quickly Placing a Point to Maximize Angles

Boris Aronov, Mark V. Yagnatinsky, B. Aronov, 2014, CCCG.

Cutting cycles of rods in space: hardness and approximation

Boris Aronov, Mark de Berg, Elena Mumford, 2008, SODA '08.

Distance-Sensitive Planar Point Location

Bettina Speckmann, David Eppstein, Boris Aronov, 2016, Comput. Geom..

Eliminating Depth Cycles Among Triangles in Three Dimensions

Micha Sharir, Boris Aronov, Edward Y. Miller, 2020, Discret. Comput. Geom..

Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets

Micha Sharir, Boris Aronov, Esther Ezra, 2020, Symposium on Computational Geometry.

The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions

Xavier Goaoc, Boris Aronov, Otfried Cheong, 2016, Symposium on Computational Geometry.

Non-Monochromatic and Conflict-Free Colorings on Tree Spaces and Planar Network Spaces

Boris Aronov, Aleksandar Markovic, Gerhard Woeginger, 2019, Algorithmica.

Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons

Boris Aronov, Mark de Berg, Mohammad Ali Abam, 2011, SoCG '11.

A Helly-Type Theorem for Hyperplane Transversals to Well-Separated Convex Sets

Boris Aronov, Rephael Wenger, Richard Pollack, 2001, Discret. Comput. Geom..

On the Number of Views of Polyhedral Scenes

Boris Aronov, Hervé Brönnimann, Dan Halperin, 2000, JCDCG.

Time-Space Trade-offs for Triangulating a Simple Polygon

Boris Aronov, Marcel Roeloffzen, André van Renssen, 2016, SWAT.

Minimum-Cost Load-Balancing Partitions

Boris Aronov, Matthew J. Katz, Paz Carmi, 2007, Algorithmica.

Incidences between Points and Circles in Three and Higher Dimensions

Micha Sharir, Boris Aronov, Vladlen Koltun, 2005, Discret. Comput. Geom..

Triangles in space or building (and analyzing) castles in the air

Micha Sharir, Boris Aronov, M. Sharir, 1990, Comb..

Guest Editors’ Foreword

Boris Aronov, Matthew J. Katz, 2019, Discret. Comput. Geom..

Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 1997, SODA '97.

Can visibility graphs Be represented compactly?

Noga Alon, Subhash Suri, Boris Aronov, 1993, SCG '93.

On Pseudo-disk Hypergraphs pdf

Boris Aronov, Rom Pinchasi, Esther Ezra, 2021, Comput. Geom..

Approximation Algorithms for Minimum-Width Annuli and Shells

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 2000, Discret. Comput. Geom..

Quasi-planar graphs have a linear number of edges

Micha Sharir, Boris Aronov, János Pach, 1995, GD.

Improved bound for the union of fat triangles

Micha Sharir, Boris Aronov, Esther Ezra, 2011, SODA '11.

Resolving SINR Queries in a Dynamic Setting

Boris Aronov, Matthew J. Katz, Gali Bar-On, 2018, ICALP.

On Translational Motion Planning of a Convex Polyhedron in 3-Space

Micha Sharir, Boris Aronov, M. Sharir, 1997, SIAM J. Comput..

On approximating the depth and related problems

Boris Aronov, Sariel Har-Peled, B. Aronov, 2005, SODA '05.

Eliminating Depth Cycles among Triangles in Three Dimensions pdf

Micha Sharir, Boris Aronov, Edward Y. Miller, 2017, SODA.

Cost prediction for ray shooting in octrees

Boris Aronov, Hervé Brönnimann, Yi-Jen Chiang, 2006, Comput. Geom..

Castles in the air revisited

Micha Sharir, Boris Aronov, 1994, Discret. Comput. Geom..

On the number of views of translates of a cube and related problems

Micha Sharir, Boris Aronov, Robert Schiffenbauer, 2004, Comput. Geom..

On the geodesic voronoi diagram of point sites in a simple polygon

Boris Aronov, B. Aronov, 1989, SCG '87.

Cutting Triangular Cycles of Lines in Space

Micha Sharir, Boris Aronov, Vladlen Koltun, 2005, Discret. Comput. Geom..

Average-case ray shooting and minimum weight triangulations

Boris Aronov, Steven Fortune, 1997, SCG '97.

Polyline Fitting of Planar Points Under Min-sum Criteria

Kurt Mehlhorn, Boris Aronov, Tetsuo Asano, 2004, ISAAC.

Lines Avoiding Unit Balls in Three Dimensions

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 2005, Discret. Comput. Geom..

On the number of regular vertices of the union of jordan regions

Micha Sharir, Boris Aronov, Alon Efrat, 2001, Discret. Comput. Geom..

Heat Transfer in Solar Collectors

Boris Aronov, Y. Zvirin, 1998 .

Segmentation of Trajectories on Nonmonotone Criteria

Maarten Löffler, Boris Aronov, Frank Staals, 2015, ACM Trans. Algorithms.

Cutting Triangular Cycles of Lines in Space

Micha Sharir, Boris Aronov, Vladlen Koltun, 2003, STOC '03.

Minimizing the error of linear separators on linearly inseparable data

Boris Aronov, Jorge Urrutia, David Rappaport, 2012, Discret. Appl. Math..

The furthest-site geodesic voronoi diagram

Boris Aronov, Gordon T. Wilfong, Steven Fortune, 1993, SCG '88.

Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions

Micha Sharir, Boris Aronov, 2018, Discret. Comput. Geom..

Witness (Delaunay) graphs pdf

Boris Aronov, Ferran Hurtado, Muriel Dulieu, 2010, Comput. Geom..

On the Helly Number for Hyperplane Transversals to Unit Balls

Boris Aronov, Rephael Wenger, Richard Pollack, 2000, Discret. Comput. Geom..

ACOUSTICS2008/774 Broadband transducers for underwater communications

Boris Aronov, D. Brown, Corey Bachand, 2008 .

Incidences between points and circles in three and higher dimensions

Micha Sharir, Boris Aronov, Vladlen Koltun, 2002, SCG '02.

Optimal Triangulation with Steiner Points

Boris Aronov, Tetsuo Asano, Stefan Funke, 2007, ISAAC.

Computing envelopes in four dimensions with applications

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 1994, SCG '94.

On the union of κ-round objects

Micha Sharir, Boris Aronov, Vladlen Koltun, 2004, SCG '04.

Can visibility graphs Be represented compactly?

Noga Alon, Subhash Suri, Boris Aronov, 1994, Discret. Comput. Geom..

Visibility with reflection in triangulated surfaces

Boris Aronov, Alan R. Davis, 1998 .

Witness Gabriel graphs pdf

Boris Aronov, Ferran Hurtado, Muriel Dulieu, 2010, Comput. Geom..

Distance-Sensitive Planar Point Location

Bettina Speckmann, Boris Aronov, Mark de Berg, 2013, WADS.

The Common Exterior of Convex Polygons in the Plane

Micha Sharir, Boris Aronov, 1997, Comput. Geom..

Nonoverlap of the star unfolding

Boris Aronov, Joseph O'Rourke, J. O'Rourke, 1991, SCG '91.

Minkowski-Type Theorems and Least-Squares Clustering

Franz Aurenhammer, Boris Aronov, F. Hoffmann, 1998, Algorithmica.

On Two-Handed Planar Assembly Partitioning pdf

Boris Aronov, Pankaj K. Agarwal, Dan Halperin, 2020, ArXiv.

Quasi-Planar Graphs Have a Linear Number of Edges

Micha Sharir, Boris Aronov, János Pach, 1995, Graph Drawing.

On beta-Plurality Points in Spatial Voting Games

Joachim Gudmundsson, Boris Aronov, Mark de Berg, 2020, SoCG.

Witness Rectangle Graphs

Boris Aronov, Ferran Hurtado, Muriel Dulieu, 2014, Graphs Comb..

Resolving SINR Queries in a Dynamic Setting

Boris Aronov, Matthew J. Katz, Gali Bar-On, 2020, SIAM J. Comput..

Optimal Triangulations of Points and Segments with Steiner Points

Boris Aronov, Tetsuo Asano, Stefan Funke, 2010, Int. J. Comput. Geom. Appl..

Minkowski-type theorems and least-squares partitioning

Franz Aurenhammer, Boris Aronov, Friedrich Hoffmann, 1992, SCG '92.

Lines Pinning Lines

Xavier Goaoc, Günter Rote, Boris Aronov, 2010, Discret. Comput. Geom..

Stabbing triangulations by lines in 3D

Subhash Suri, Boris Aronov, Pankaj K. Agarwal, 1995, SCG '95.

Improved Bounds for the Union of Locally Fat Objects in the Plane

Micha Sharir, Boris Aronov, Mark de Berg, 2014, SIAM J. Comput..

On the Number of Regular Vertices of the Union of Jordan Regions

Micha Sharir, Boris Aronov, Alon Efrat, 1998, SWAT.

On translational motion planning in 3-space

Micha Sharir, Boris Aronov, M. Sharir, 1994, SCG '94.

How to cover a point set with a V-shape of minimum width

Boris Aronov, Muriel Dulieu, 2013, Comput. Geom..

Star Unfolding of a Polytope with Applications

Boris Aronov, Pankaj K. Agarwal, Joseph O'Rourke, 1997, SIAM J. Comput..

How to Cover Most of a Point Set with a V-Shape of Minimum Width

Boris Aronov, Özgür Özkan, John Iacono, 2013, CCCG.

Visibility Queries in Simple Polygons and Applications

Leonidas J. Guibas, Boris Aronov, Marek Teichmann, 1998, ISAAC.

Largest Placements and Motion Planning of a Convex Polygon

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 1996 .

The Complexity of Diffuse Reflections in a Simple Polygon

Boris Aronov, John Iacono, Alan R. Davis, 2006, LATIN.

Distinct distances in three and higher dimensions

Micha Sharir, Boris Aronov, János Pach, 2003, STOC '03.

Computing Correlation between Piecewise-Linear Functions

Maarten Löffler, Boris Aronov, Pankaj K. Agarwal, 2013, SIAM J. Comput..

Approximate Halfspace Range Counting

Micha Sharir, Boris Aronov, 2010, SIAM J. Comput..

Segmentation of Trajectories for Non-Monotone Criteria

Maarten Löffler, Boris Aronov, Frank Staals, 2013, SODA.

Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

Joshua Zahl, Boris Aronov, Pankaj K. Agarwal, 2021, SIAM J. Comput..

On Two-Handed Planar Assembly Partitioning with Connectivity Constraints

Boris Aronov, Pankaj K. Agarwal, Dan Halperin, 2021, SODA.

Geometric Pattern Matching Reduces to k -SUM

Jean Cardinal, Boris Aronov, 2021, Discrete & Computational Geometry.

Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model pdf

Jean Cardinal, Micha Sharir, Boris Aronov, 2022, ISAAC.

Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model

Jean Cardinal, Micha Sharir, Boris Aronov, 2021, ISAAC.

Cutting cycles of rods in space : Hardness results and approximation algorithms

Boris Aronov, Elena Mumford, Chris Gray, 2008 .

On translational motion planning in three dimensions

Micha Sharir, Boris Aronov, M. Sharir, 1994 .

Results on -Sets and -Facets via Continuous Motion

Boris Aronov, Raimund Seidel, Sariel Har-Peled, 1997 .

Distinct Distances in Three Dimensions

Micha Sharir, Boris Aronov, M. Sharir, 2001 .

Convex equipartitions: the spicy chicken theorem

Alfredo Hubard, Boris Aronov, Roman Karasev, 2013 .

On the Complexity of Many Faces in Arrangements of Pseudo-Segments and Circles

Micha Sharir, Boris Aronov, Pankaj K. Agarwal, 2003 .