Eyal Ackerman

According to our database, Eyal Ackerman authored at least 43 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

On partitions of two-dimensional discrete boxes.

Eyal Ackerman, Rom Pinchasi

Discret. Math., April, 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 the number of tangencies among 1-intersecting x-monotone curves.

Eyal Ackerman, Balázs Keszegh

Eur. J. Comb., 2024

On the Number of Digons in Arrangements of Pairwise Intersecting Circles.

Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

The maximum size of adjacency-crossing graphs.

Eyal Ackerman, Balázs Keszegh

CoRR, 2023

On the number of tangencies among 1-intersecting curves.

Eyal Ackerman, Balázs Keszegh

CoRR, 2023

2022

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

2021

Coloring Delaunay-edges and their generalizations.

Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi

Comput. Geom., 2021

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

Quasi-planar Graphs.

Eyal Ackerman

Proceedings of the Beyond Planar Graphs, Communications of NII Shonan Meetings., 2020

2019

On topological graphs with at most four crossings per edge.

Eyal Ackerman

Comput. Geom., 2019

2018

On the size of planarly connected crossing graphs.

Eyal Ackerman, Balázs Keszegh, Máté Vizer

J. Graph Algorithms Appl., 2018

2017

Coloring Points with Respect to Squares.

Eyal Ackerman, Balázs Keszegh, Máté Vizer

Discret. Comput. Geom., 2017

2016

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

2014

The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges.

Eyal Ackerman, Noa Nitzan, Rom Pinchasi

Graphs Comb., 2014

A note on 1-planar graphs.

Eyal Ackerman

Discret. Appl. Math., 2014

On grids in topological graphs.

Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk

Comput. Geom., 2014

A Note on Coloring Line Arrangements.

Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth

Electron. J. Comb., 2014

A Crossing Lemma for the Pair-Crossing Number.

Eyal Ackerman, Marcus Schaefer

Proceedings of the Graph Drawing - 22nd International Symposium, 2014

2013

On coloring points with respect to rectangles.

Eyal Ackerman, Rom Pinchasi

J. Comb. Theory A, 2013

Covering a chessboard with staircase walks.

Eyal Ackerman, Rom Pinchasi

Discret. Math., 2013

A note on light geometric graphs.

Eyal Ackerman, Jacob Fox, Rom Pinchasi

Discret. Math., 2013

On the Degenerate Crossing Number.

Eyal Ackerman, Rom Pinchasi

Discret. Comput. Geom., 2013

On inducing polygons and related problems.

Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg

Comput. Geom., 2013

Ice-creams and wedge graphs.

Eyal Ackerman, Tsachik Gelander, Rom Pinchasi

Comput. Geom., 2013

2012

Graphs That Admit Polyline Drawings with Few Crossing Angles.

Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth

SIAM J. Discret. Math., 2012

On the light side of geometric graphs.

Eyal Ackerman, Rom Pinchasi

Discret. Math., 2012

A note on coloring line arrangements

Eyal Ackerman, Rom Pinchasi

CoRR, 2012

2011

Every Simple Arrangement of <i>n</i> Lines Contains an Inducing Simple <i>n</i>-gon.

Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg

Am. Math. Mon., 2011

2010

Combinatorial model and bounds for target set selection.

Eyal Ackerman, Oren Ben-Zwi, Guy Wolfovitz

Theor. Comput. Sci., 2010

Acyclic Orientation of Drawings.

Eyal Ackerman, Kevin Buchin, Christian Knauer, Günter Rote

J. Graph Algorithms Appl., 2010

On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles.

Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

On sets of points that determine only acute angles.

Eyal Ackerman, Oren Ben-Zwi

Eur. J. Comb., 2009

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges.

Eyal Ackerman

Discret. Comput. Geom., 2009

Improved upper bounds on the reflexivity of point sets.

Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh

Comput. Geom., 2009

2008

There Are Not Too Many Magic Configurations.

Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote

Discret. Comput. Geom., 2008

2007

On the maximum number of edges in quasi-planar graphs.

Eyal Ackerman, Gábor Tardos

J. Comb. Theory A, 2007

2006

Counting problems for geometric structures: rectangulations, floorplans, and quasi-planar graphs.

Eyal Ackerman

PhD thesis, 2006

On the number of rectangulations of a planar point set.

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

J. Comb. Theory A, 2006

The number of guillotine partitions in <i>d</i> dimensions.

Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik

Inf. Process. Lett., 2006

A bijection between permutations and floorplans, and its applications.

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Discret. Appl. Math., 2006

2005

An Upper Bound on the Number of Rectangulations of a Point Set.

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

On the number of rectangular partitions.

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004