The Design and Implementation of Planar Maps in CGAL. - Eyal Flato; Dan Halperin; Iddo Hanniel; Oren Nechushtan; Eti Ezra (ACM J. Exp. Algorithmics, 2000)

Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. - Eti Ezra; Dan Halperin; Micha Sharir (ESA, 2002)

Counting and representing intersections among triangles in three dimensions. - Esther Ezra; Micha Sharir (SCG, 2004)

Output-sensitive construction of the union of triangles. - Eti Ezra; Micha Sharir (SODA, 2004)

Almost tight bound for a single cell in an arrangement of convex polyhedra in R3. - Esther Ezra (SCG, 2005)

On the ICP algorithm. - Esther Ezra; Micha Sharir; Alon Efrat (SCG, 2006)

On regular vertices on the union of planar objects. - Esther Ezra; János Pach; Micha Sharir (SCG, 2007)

Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. - Esther Ezra; Micha Sharir (FOCS, 2007)

A Single Cell in an Arrangement of Convex Polyhedra in Bbb R3. - Esther Ezra; Micha Sharir (Discret. Comput. Geom., 2007)

Geometric arrangements: substructures and algorithms - Esther Ezra (2007)

On the Union of Cylinders in Three Dimensions. - Esther Ezra (FOCS, 2008)

On the performance of the ICP algorithm. - Esther Ezra; Micha Sharir; Alon Efrat (Comput. Geom., 2008)

Near-linear approximation algorithms for geometric hitting sets. - Pankaj K. Agarwal; Esther Ezra; Micha Sharir (SCG, 2009)

Efficient Sensor Placement for Surveillance Problems. - Pankaj K. Agarwal; Esther Ezra; Shashidhara K. Ganjugunte (DCOSS, 2009)

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

On Regular Vertices of the Union of Planar Convex Objects. - Esther Ezra; János Pach; Micha Sharir (Discret. Comput. Geom., 2009)

On the union of fat tetrahedra in three dimensions. - Esther Ezra; Micha Sharir (J. ACM, 2009)

A note about weak epsilon-nets for axis-parallel boxes in d-space. - Esther Ezra (Inf. Process. Lett., 2010)

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

Convex hull of imprecise points in o(n log n) time after preprocessing. - Esther Ezra; Wolfgang Mulzer (SCG, 2011)

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

Convex Hull of Imprecise Points in o(n log{n}) Time after Preprocessing - Esther Ezra; Wolfgang Mulzer (CoRR, 2011)

A New Active Learning Scheme with Applications to Learning to Rank from Pairwise Preferences - Nir Ailon; Ron Begleiter; Esther Ezra (CoRR, 2011)

Small-Size Relative (p,Epsilon)-Approximations for Well-Behaved Range Spaces - Esther Ezra (CoRR, 2012)

Small-size relative (p, ε)-approximations for well-behaved range spaces. - Esther Ezra (SoCG, 2013)

Convex hull of points lying on lines in time after preprocessing. - Esther Ezra; Wolfgang Mulzer (Comput. Geom., 2013)

A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension. - Esther Ezra (SODA, 2014)

Shallow Packings in Geometry. - Esther Ezra (CoRR, 2014)

Active learning using smooth relative regret approximations with applications. - Nir Ailon; Ron Begleiter; Esther Ezra (J. Mach. Learn. Res., 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)

Two Proofs for Shallow Packings. - Kunal Dutta; Esther Ezra; Arijit Ghosh (SoCG, 2015)

Data recovery after geographic correlated attacks. - Guy Grebla; Alon Efrat; Esther Ezra; Rom Pinchasi; Swaminathan Sankararaman (DRCN, 2015)

On the Beck-Fiala Conjecture for Random Set Systems. - Esther Ezra; Shachar Lovett (APPROX-RANDOM, 2016)

The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. - Esther Ezra; Micha Sharir (CoRR, 2016)

A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. - Esther Ezra; Micha Sharir (SoCG, 2017)

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

Constructive Polynomial Partitioning for Algebraic Curves in R3 with Applications. - Boris Aronov; Esther Ezra; Joshua Zahl (SODA, 2019)

A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model. - Esther Ezra; Micha Sharir (Discret. Comput. Geom., 2019)

Geometric Optimization Revisited. - Pankaj K. Agarwal; Esther Ezra; Kyle Fox (Computing and Software Science, 2019)

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

Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. - Esther Ezra; Sariel Har-Peled; Haim Kaplan; Micha Sharir (Discret. Comput. Geom., 2020)

On 3SUM-hard Problems in the Decision Tree Model. - Esther Ezra (CiE, 2021)

On Rich Lenses in Planar Arrangements of Circles and Related Problems. - Esther Ezra; Orit E. Raz; Micha Sharir; Joshua Zahl (SoCG, 2021)

On Ray Shooting for Triangles in 3-Space and Related Problems. - Esther Ezra; Micha Sharir (SoCG, 2021)

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 (ISAAC, 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)

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)

Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. - Esther Ezra; Micha Sharir (ESA, 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)

Counting and Cutting Rich Lenses in Arrangements of Circles. - Esther Ezra; Orit E. Raz; Micha Sharir; Joshua Zahl (SIAM J. Discret. Math., 2022)

Line Intersection Searching Amid Unit Balls in 3-Space. - Pankaj K. Agarwal; Esther Ezra (SoCG, 2023)

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

Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane. - Pankaj K. Agarwal; Esther Ezra; Micha Sharir (SoCG, 2024)

Lower Envelopes of Surface Patches in 3-Space. - Pankaj K. Agarwal; Esther Ezra; Micha Sharir (ESA, 2024)

Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. - Pankaj K. Agarwal; Esther Ezra; Micha Sharir (SODA, 2024)

Intersection Searching amid Tetrahedra in Four Dimensions. - Esther Ezra; Micha Sharir (Discret. Comput. Geom., 2025)