Eyal Ackerman

Available identifiers

zbMath Open ackerman.eyalDBLP73/5639WikidataQ102302633 ScholiaQ102302633MaRDI QIDQ359747

List of research outcomes

Publication	Date of Publication	Type
Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs	2024-10-18	Paper
On tangencies among planar curves with an application to coloring L-shapes	2024-09-30	Paper
On tangencies among planar curves with an application to coloring L-shapes	2024-09-13	Paper
On the number of tangencies among 1-intersecting \(x\)-monotone curves	2024-03-26	Paper
On partitions of two-dimensional discrete boxes	2024-02-19	Paper
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons.	2023-11-02	Paper
The maximum size of adjacency-crossing graphs	2023-09-12	Paper
On the number of tangencies among 1-intersecting curves	2023-05-23	Paper
An almost optimal bound on the number of intersections of two simple polygons	2022-12-08	Paper
Coloring Delaunay-edges and their generalizations	2021-09-16	Paper
Quasi-planar Graphs	2021-07-22	Paper
On tangencies among planar curves with an application to coloring L-shapes	2021-03-04	Paper
Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs	2020-12-04	Paper
On topological graphs with at most four crossings per edge	2020-04-29	Paper
Coloring Points with Respect to Squares	2018-01-30	Paper
On the size of planarly connected crossing graphs	2018-01-12	Paper
Coloring points with respect to squares	2018-01-11	Paper
On grids in topological graphs	2017-10-20	Paper
The Flip Diameter of Rectangulations and Convex Subdivisions	2017-03-03	Paper
On the Size of Planarly Connected Crossing Graphs	2017-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q5501333	2015-08-03	Paper
A Crossing Lemma for the Pair-Crossing Number	2015-01-07	Paper
The maximum number of edges in geometric graphs with pairwise virtually avoiding edges	2014-09-19	Paper
A note on coloring line arrangements	2014-09-04	Paper
A note on 1-planar graphs	2014-08-26	Paper
On grids in topological graphs	2014-06-27	Paper
The Flip Diameter of Rectangulations and Convex Subdivisions	2014-03-31	Paper
Covering a chessboard with staircase walks	2014-01-24	Paper
A note on light geometric graphs	2014-01-20	Paper
The Maximum Number of Tangencies Among Convex Regions with a Triangle-Free Intersection Graph	2013-09-25	Paper
On inducing polygons and related problems	2013-08-22	Paper
On the degenerate crossing number	2013-06-07	Paper
On coloring points with respect to rectangles	2013-04-15	Paper
Ice-creams and wedge graphs	2013-01-25	Paper
Graphs that admit polyline drawings with few crossing angles	2012-08-22	Paper
On the light side of geometric graphs	2012-04-13	Paper
Combinatorial model and bounds for target set selection	2012-04-03	Paper
Every Simple Arrangement of <em>n</em> Lines Contains an Inducing Simple <em>n</em>-gon	2011-03-08	Paper
Acyclic Orientation of Drawings	2011-02-16	Paper
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles	2011-02-11	Paper
The number of guillotine partitions in \(d\) dimensions	2010-01-18	Paper
On Inducing Polygons and Related Problems	2009-10-29	Paper
On sets of points that determine only acute angles	2009-06-17	Paper
On the maximum number of edges in topological graphs with no four pairwise crossing edges	2009-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q3619929	2009-04-14	Paper
Improved upper bounds on the reflexivity of point sets	2009-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q3602870	2009-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q3601547	2009-02-10	Paper
There are not too many magic configurations	2008-04-16	Paper
Acyclic Orientation of Drawings	2007-09-07	Paper
On the maximum number of edges in quasi-planar graphs	2007-05-04	Paper
On the number of rectangulations of a planar point set	2006-08-17	Paper
A bijection between permutations and floorplans, and its applications	2006-08-14	Paper
Computing and Combinatorics	2006-01-11	Paper

Research outcomes over time

This page was built for person: Eyal Ackerman