On the number of rectangular partitions. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (SODA, 2004)

An Upper Bound on the Number of Rectangulations of a Point Set. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (COCOON, 2005)

A bijection between permutations and floorplans, and its applications. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (Discret. Appl. Math., 2006)

The number of guillotine partitions in d dimensions. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter; Dan Romik (Inf. Process. Lett., 2006)

On the number of rectangulations of a planar point set. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (J. Comb. Theory A, 2006)

Counting problems for geometric structures: rectangulations, floorplans, and quasi-planar graphs. - Eyal Ackerman (2006)

On the maximum number of edges in quasi-planar graphs. - Eyal Ackerman; Gábor Tardos (J. Comb. Theory A, 2007)

There Are Not Too Many Magic Configurations. - Eyal Ackerman; Kevin Buchin; Christian Knauer; Rom Pinchasi; Günter Rote (Discret. Comput. Geom., 2008)

Improved upper bounds on the reflexivity of point sets. - Eyal Ackerman; Oswin Aichholzer; Balázs Keszegh (Comput. Geom., 2009)

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. - Eyal Ackerman (Discret. Comput. Geom., 2009)

On sets of points that determine only acute angles. - Eyal Ackerman; Oren Ben-Zwi (Eur. J. Comb., 2009)

On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. - Eyal Ackerman; Radoslav Fulek; Csaba D. Tóth (GD, 2010)

Acyclic Orientation of Drawings. - Eyal Ackerman; Kevin Buchin; Christian Knauer; Günter Rote (J. Graph Algorithms Appl., 2010)

Combinatorial model and bounds for target set selection. - Eyal Ackerman; Oren Ben-Zwi; Guy Wolfovitz (Theor. Comput. Sci., 2010)

Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon. - Eyal Ackerman; Rom Pinchasi; Ludmila Scharf; Marc Scherfenberg (Am. Math. Mon., 2011)

A note on coloring line arrangements - Eyal Ackerman; Rom Pinchasi (CoRR, 2012)

On the light side of geometric graphs. - Eyal Ackerman; Rom Pinchasi (Discret. Math., 2012)

Graphs That Admit Polyline Drawings with Few Crossing Angles. - Eyal Ackerman; Radoslav Fulek; Csaba D. Tóth (SIAM J. Discret. Math., 2012)

Ice-creams and wedge graphs. - Eyal Ackerman; Tsachik Gelander; Rom Pinchasi (Comput. Geom., 2013)

On inducing polygons and related problems. - Eyal Ackerman; Rom Pinchasi; Ludmila Scharf; Marc Scherfenberg (Comput. Geom., 2013)

On the Degenerate Crossing Number. - Eyal Ackerman; Rom Pinchasi (Discret. Comput. Geom., 2013)

A note on light geometric graphs. - Eyal Ackerman; Jacob Fox; Rom Pinchasi (Discret. Math., 2013)

Covering a chessboard with staircase walks. - Eyal Ackerman; Rom Pinchasi (Discret. Math., 2013)

On coloring points with respect to rectangles. - Eyal Ackerman; Rom Pinchasi (J. Comb. Theory A, 2013)

A Crossing Lemma for the Pair-Crossing Number. - Eyal Ackerman; Marcus Schaefer 001 (GD, 2014)

A Note on Coloring Line Arrangements. - Eyal Ackerman; János Pach; Rom Pinchasi; Rados Radoicic; Géza Tóth 001 (Electron. J. Comb., 2014)

On grids in topological graphs. - Eyal Ackerman; Jacob Fox; János Pach; Andrew Suk (Comput. Geom., 2014)

A note on 1-planar graphs. - Eyal Ackerman (Discret. Appl. Math., 2014)

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. - Eyal Ackerman; Noa Nitzan; Rom Pinchasi (Graphs Comb., 2014)

The Flip Diameter of Rectangulations and Convex Subdivisions. - Eyal Ackerman; Michelle M. Allen; Gill Barequet; Maarten Löffler; Joshua Mermelstein; Diane L. Souvaine; Csaba D. Tóth (Discret. Math. Theor. Comput. Sci., 2016)

Coloring Points with Respect to Squares. - Eyal Ackerman; Balázs Keszegh; Máté Vizer (Discret. Comput. Geom., 2017)

On the size of planarly connected crossing graphs. - Eyal Ackerman; Balázs Keszegh; Máté Vizer (J. Graph Algorithms Appl., 2018)

On topological graphs with at most four crossings per edge. - Eyal Ackerman (Comput. Geom., 2019)

Quasi-planar Graphs. - Eyal Ackerman (Beyond Planar Graphs, 2020)

Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. - Eyal Ackerman; Balázs Keszegh; Dömötör Pálvölgyi (SIAM J. Discret. Math., 2020)

Coloring Delaunay-edges and their generalizations. - Eyal Ackerman; Balázs Keszegh; Dömötör Pálvölgyi (Comput. Geom., 2021)

An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. - Eyal Ackerman; Balázs Keszegh; Günter Rote (Discret. Comput. Geom., 2022)

On the number of tangencies among 1-intersecting curves. - Eyal Ackerman; Balázs Keszegh (CoRR, 2023)

The maximum size of adjacency-crossing graphs. - Eyal Ackerman; Balázs Keszegh (CoRR, 2023)

The maximum number of digons formed by pairwise crossing pseudocircles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (CoRR, 2024)

On the number of tangencies among 1-intersecting x-monotone curves. - Eyal Ackerman; Balázs Keszegh (Eur. J. Comb., 2024)

On tangencies among planar curves with an application to coloring L-shapes. - Eyal Ackerman; Balázs Keszegh; Dömötör Pálvölgyi (Eur. J. Comb., 2024)

On partitions of two-dimensional discrete boxes. - Eyal Ackerman; Rom Pinchasi (Discret. Math., 2024)

The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (SoCG, 2025)

The Zarankiewicz Problem for Polygon Visibility Graphs. - Eyal Ackerman; Balázs Keszegh (CoRR, 2025)

On the Number of Digons in Arrangements of Pairwise Intersecting Circles. - Eyal Ackerman; Gábor Damásdi; Balázs Keszegh; Rom Pinchasi; Rebeka Raffay (Comb., 2025)