Eyal Ackerman

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