Follow
Eyal Ackerman
Title
Cited by
Cited by
Year
Combinatorial model and bounds for target set selection
E Ackerman, O Ben-Zwi, G Wolfovitz
Theoretical Computer Science 411 (44-46), 4017-4022, 2010
1562010
On the maximum number of edges in quasi-planar graphs
E Ackerman, G Tardos
Journal of Combinatorial Theory, Series A 114 (3), 563-571, 2007
1092007
On the maximum number of edges in topological graphs with no four pairwise crossing edges
E Ackerman
Proceedings of the twenty-second annual symposium on Computational geometry …, 2006
972006
A bijection between permutations and floorplans, and its applications
E Ackerman, G Barequet, RY Pinter
Discrete Applied Mathematics 154 (12), 1674-1684, 2006
742006
On topological graphs with at most four crossings per edge
E Ackerman
Computational Geometry 85, 101574, 2019
62*2019
A note on 1-planar graphs
E Ackerman
Discrete Applied Mathematics 175, 104-108, 2014
312014
On the number of rectangulations of a planar point set
E Ackerman, G Barequet, RY Pinter
Journal of Combinatorial Theory, Series A 113 (6), 1072-1091, 2006
292006
On grids in topological graphs
E Ackerman, J Fox, J Pach, A Suk
Computational Geometry 47 (7), 710-723, 2014
25*2014
Graphs that admit polyline drawings with few crossing angles
E Ackerman, R Fulek, CD Tóth
SIAM Journal on Discrete Mathematics 26 (1), 305-320, 2012
23*2012
On the number of rectangular partitions.
E Ackerman, G Barequet, RY Pinter
SODA, 736-745, 2004
212004
The number of guillotine partitions in d dimensions
E Ackerman, G Barequet, RY Pinter, D Romik
Information processing letters 98 (4), 162-167, 2006
202006
Ice-creams and wedge graphs
E Ackerman, T Gelander, R Pinchasi
Computational Geometry 46 (3), 213-218, 2013
192013
On the size of planarly connected crossing graphs
E Ackerman, B Keszegh, M Vizer
Graph Drawing and Network Visualization: 24th International Symposium, GD …, 2016
162016
Improved upper bounds on the reflexivity of point sets
E Ackerman, O Aichholzer, B Keszegh
Computational Geometry 42 (3), 241-249, 2009
162009
There are not too many magic configurations
E Ackerman, K Buchin, C Knauer, R Pinchasi, G Rote
Proceedings of the twenty-third annual symposium on Computational geometry …, 2007
162007
Coloring points with respect to squares
E Ackerman, B Keszegh, M Vizer
Discrete & Computational Geometry 58, 757-784, 2017
152017
On sets of points that determine only acute angles
E Ackerman, O Ben-Zwi
European Journal of Combinatorics 30 (4), 908-910, 2009
102009
A note on coloring line arrangements
E Ackerman, R Pinchasi
arXiv preprint arXiv:1207.0080, 2012
82012
Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
E Ackerman, B Keszegh, D Pálvölgyi
SIAM Journal on Discrete Mathematics 34 (4), 2250-2269, 2020
72020
On coloring points with respect to rectangles
E Ackerman, R Pinchasi
Journal of Combinatorial Theory, Series A 120 (4), 811-815, 2013
72013
The system can't perform the operation now. Try again later.
Articles 1–20