| Combinatorial model and bounds for target set selection E Ackerman, O Ben-Zwi, G Wolfovitz Theoretical Computer Science 411 (44-46), 4017-4022, 2010 | 199 | 2010 |
| 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 | 133 | 2007 |
| 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 | 112 | 2006 |
| On topological graphs with at most four crossings per edge E Ackerman Computational Geometry 85, 101574, 2019 | 97* | 2019 |
| A bijection between permutations and floorplans, and its applications E Ackerman, G Barequet, RY Pinter Discrete Applied Mathematics 154 (12), 1674-1684, 2006 | 80 | 2006 |
| A note on 1-planar graphs E Ackerman Discrete Applied Mathematics 175, 104-108, 2014 | 41 | 2014 |
| 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 | 36 | 2006 |
| On grids in topological graphs E Ackerman, J Fox, J Pach, A Suk Computational Geometry 47 (7), 710-723, 2014 | 31* | 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 | 27* | 2012 |
| On the number of rectangular partitions. E Ackerman, G Barequet, RY Pinter SODA, 736-745, 2004 | 25 | 2004 |
| The number of guillotine partitions in d dimensions E Ackerman, G Barequet, RY Pinter, D Romik Information processing letters 98 (4), 162-167, 2006 | 24 | 2006 |
| 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 | 21 | 2020 |
| Ice-creams and wedge graphs E Ackerman, T Gelander, R Pinchasi Computational Geometry 46 (3), 213-218, 2013 | 21 | 2013 |
| Coloring points with respect to squares E Ackerman, B Keszegh, M Vizer Discrete & Computational Geometry 58, 757-784, 2017 | 19 | 2017 |
| Improved upper bounds on the reflexivity of point sets E Ackerman, O Aichholzer, B Keszegh Computational Geometry 42 (3), 241-249, 2009 | 18 | 2009 |
| 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 | 16 | 2007 |
| On the size of planarly connected crossing graphs E Ackerman, B Keszegh, M Vizer Journal of Graph Algorithms and Applications 22 (1), 11-22, 2018 | 13 | 2018 |
| On sets of points that determine only acute angles E Ackerman, O Ben-Zwi European Journal of Combinatorics 30 (4), 908-910, 2009 | 11 | 2009 |
| A note on coloring line arrangements E Ackerman, R Pinchasi arXiv preprint arXiv:1207.0080, 2012 | 8 | 2012 |
| Coloring Delaunay-edges and their generalizations E Ackerman, B Keszegh, D Pálvölgyi Computational Geometry 96, 101745, 2021 | 7 | 2021 |
Balázs KeszeghResearcher, Alfréd Rényi Institute of Mathematics, BudapestEmail yang diverifikasi di renyi.hu
