Eyal Ackerman

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 19

Top Topics

Convexity Properties

Top Venues

Discret. Comput. Geom.

Publications

Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
On the number of digons in arrangements of pairwise intersecting circles. CoRR (2024)
Eyal Ackerman, Rom Pinchasi
On partitions of two-dimensional discrete boxes. Discret. Math. 347 (4) (2024)
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay
On the Number of Digons in Arrangements of Pairwise Intersecting Circles. SoCG (2024)
Eyal Ackerman, Balázs Keszegh
On the number of tangencies among 1-intersecting x-monotone curves. Eur. J. Comb. 118 (2024)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
On tangencies among planar curves with an application to coloring L-shapes. Eur. J. Comb. 121 (2024)
Eyal Ackerman, Balázs Keszegh
The maximum size of adjacency-crossing graphs. CoRR (2023)
Eyal Ackerman, Balázs Keszegh
On the number of tangencies among 1-intersecting curves. CoRR (2023)
Eyal Ackerman, Balázs Keszegh, Günter Rote
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. Discret. Comput. Geom. 68 (4) (2022)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
Coloring Delaunay-edges and their generalizations. Comput. Geom. 96 (2021)
Eyal Ackerman, Balázs Keszegh, Günter Rote
An almost optimal bound on the number of intersections of two simple polygons. CoRR (2020)
Eyal Ackerman, Balázs Keszegh, Günter Rote
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. SoCG (2020)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs. SIAM J. Discret. Math. 34 (4) (2020)
Eyal Ackerman
On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
On the size of planarly connected crossing graphs. J. Graph Algorithms Appl. 22 (1) (2018)
Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi
Coloring Delaunay-Edges and their Generalizations. CoRR (2018)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
Coloring Points with Respect to Squares. Discret. Comput. Geom. 58 (4) (2017)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
Coloring Points with Respect to Squares. SoCG (2016)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
On the Size of Planarly Connected Crossing Graphs. Graph Drawing (2016)
Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth
The Flip Diameter of Rectangulations and Convex Subdivisions. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Eyal Ackerman, Balázs Keszegh, Máté Vizer
On the size of planarly connected crossing graphs. CoRR (2015)
Eyal Ackerman
On topological graphs with at most four crossings per edge. CoRR (2015)
Eyal Ackerman
A note on 1-planar graphs. Discret. Appl. Math. 175 (2014)
Eyal Ackerman, Marcus Schaefer
A Crossing Lemma for the Pair-Crossing Number. Graph Drawing (2014)
Eyal Ackerman, Noa Nitzan, Rom Pinchasi
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. Graphs Comb. 30 (5) (2014)
Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk
On grids in topological graphs. Comput. Geom. 47 (7) (2014)
Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth
The Flip Diameter of Rectangulations and Convex Subdivisions. LATIN (2014)
Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth
A Note on Coloring Line Arrangements. Electron. J. Comb. 21 (2) (2014)
Eyal Ackerman, Rom Pinchasi
On coloring points with respect to rectangles. J. Comb. Theory, Ser. A 120 (4) (2013)
Eyal Ackerman, Tsachik Gelander, Rom Pinchasi
Ice-creams and wedge graphs. Comput. Geom. 46 (3) (2013)
Eyal Ackerman, Rom Pinchasi
On the Degenerate Crossing Number. Discret. Comput. Geom. 49 (3) (2013)
Eyal Ackerman, Jacob Fox, Rom Pinchasi
A note on light geometric graphs. Discret. Math. 313 (11) (2013)
Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth
The Flip Diameter of Rectangulations and Convex Subdivisions. CoRR (2013)
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
On inducing polygons and related problems. Comput. Geom. 46 (7) (2013)
Eyal Ackerman, Rom Pinchasi
Covering a chessboard with staircase walks. Discret. Math. 313 (22) (2013)
Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
Graphs That Admit Polyline Drawings with Few Crossing Angles. SIAM J. Discret. Math. 26 (1) (2012)
Eyal Ackerman, Rom Pinchasi
A note on coloring line arrangements CoRR (2012)
Eyal Ackerman, Rom Pinchasi
On the light side of geometric graphs. Discret. Math. 312 (6) (2012)
Eyal Ackerman, Tsachik Gelander, Rom Pinchasi
Ice-Creams and Wedge Graphs CoRR (2011)
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
-gon. Am. Math. Mon. 118 (2) (2011)
Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles. Graph Drawing (2010)
Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
Acyclic Orientation of Drawings. J. Graph Algorithms Appl. 14 (2) (2010)
Eyal Ackerman, Oren Ben-Zwi, Guy Wolfovitz
Combinatorial model and bounds for target set selection. Theor. Comput. Sci. 411 (44-46) (2010)
Eyal Ackerman
On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. Discret. Comput. Geom. 41 (3) (2009)
Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk
On grids in topological graphs. SCG (2009)
Eyal Ackerman, Oren Ben-Zwi
On sets of points that determine only acute angles. Eur. J. Comb. 30 (4) (2009)
Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg
On Inducing Polygons and Related Problems. ESA (2009)
Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh
Improved upper bounds on the reflexivity of point sets. Comput. Geom. 42 (3) (2009)
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
There Are Not Too Many Magic Configurations. Discret. Comput. Geom. 39 (1-3) (2008)
Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote
There are not too many magic configurations. SCG (2007)
Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh
Improved Upper Bounds on the Reflexivity of Point Sets. CCCG (2007)
Eyal Ackerman, Gábor Tardos
On the maximum number of edges in quasi-planar graphs. J. Comb. Theory, Ser. A 114 (3) (2007)
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
On the number of rectangulations of a planar point set. J. Comb. Theory, Ser. A 113 (6) (2006)
Eyal Ackerman
On the maximum number of edges in topological graphs with no four pairwise crossing edges. SCG (2006)
Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote
Acyclic Orientation of Drawings. SWAT (2006)
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
A bijection between permutations and floorplans, and its applications. Discret. Appl. Math. 154 (12) (2006)
Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik
dimensions. Inf. Process. Lett. 98 (4) (2006)
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
An Upper Bound on the Number of Rectangulations of a Point Set. COCOON (2005)
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
On the number of rectangular partitions. SODA (2004)