Eyal Ackerman

649 total citations
26 papers, 229 citations indexed

About

Eyal Ackerman is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Computer Vision and Pattern Recognition. According to data from OpenAlex, Eyal Ackerman has authored 26 papers receiving a total of 229 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computer Graphics and Computer-Aided Design, 13 papers in Computational Theory and Mathematics and 6 papers in Computer Vision and Pattern Recognition. Recurrent topics in Eyal Ackerman's work include Computational Geometry and Mesh Generation (21 papers), Advanced Graph Theory Research (10 papers) and Digital Image Processing Techniques (6 papers). Eyal Ackerman is often cited by papers focused on Computational Geometry and Mesh Generation (21 papers), Advanced Graph Theory Research (10 papers) and Digital Image Processing Techniques (6 papers). Eyal Ackerman collaborates with scholars based in Israel, Germany and Hungary. Eyal Ackerman's co-authors include Oren Ben-Zwi, Gill Barequet, Ron Y. Pinter, Gábor Tardos, Rom Pinchasi, Balázs Keszegh, Tsachik Gelander, Dan Romik, Oswin Aichholzer and Radoslav Fulek and has published in prestigious journals such as American Mathematical Monthly, Theoretical Computer Science and Discrete Applied Mathematics.

In The Last Decade

Eyal Ackerman

22 papers receiving 218 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Eyal Ackerman Israel	9	92	89	58	48	34	26	229
Tsung‐Hsi Tsai Taiwan	10	23 0.3×	54 0.6×	11 0.2×	38 0.8×	14 0.4×	22	261
Luděk Kučera Czechia	8	12 0.1×	177 2.0×	20 0.3×	37 0.8×	19 0.6×	35	303
Yann Vaxès France	9	41 0.4×	171 1.9×	14 0.2×	28 0.6×	14 0.4×	36	271
Zhi Lü China	8	8 0.1×	72 0.8×	21 0.4×	43 0.9×	14 0.4×	44	219
Geir Agnarsson United States	7	13 0.1×	154 1.7×	10 0.2×	73 1.5×	14 0.4×	27	246
Elena Lodi Italy	10	57 0.6×	67 0.8×	51 0.9×	5 0.1×	38 1.1×	27	250
Thomas Andreae Germany	10	37 0.4×	275 3.1×	11 0.2×	94 2.0×	47 1.4×	39	365
Janka Chlebı́ková Slovakia	8	38 0.4×	241 2.7×	11 0.2×	27 0.6×	14 0.4×	25	327
Bertrand Estellon France	10	12 0.1×	82 0.9×	12 0.2×	14 0.3×	10 0.3×	18	267
Karl Heinz Borgwardt Germany	6	31 0.3×	97 1.1×	4 0.1×	14 0.3×	12 0.4×	14	217

Countries citing papers authored by Eyal Ackerman

Since Specialization

Citations

This map shows the geographic impact of Eyal Ackerman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Eyal Ackerman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eyal Ackerman more than expected).

Fields of papers citing papers by Eyal Ackerman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eyal Ackerman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eyal Ackerman. The network helps show where Eyal Ackerman may publish in the future.

Co-authorship network of co-authors of Eyal Ackerman

This figure shows the co-authorship network connecting the top 25 collaborators of Eyal Ackerman. A scholar is included among the top collaborators of Eyal Ackerman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Eyal Ackerman. Eyal Ackerman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ackerman, Eyal, Balázs Keszegh, & Dömötör Pálvölgyi. (2023). On tangencies among planar curves with an application to coloring L-shapes. European Journal of Combinatorics. 121. 103837–103837.

Ackerman, Eyal & Balázs Keszegh. (2023). On the number of tangencies among 1-intersecting curves. 4–11. 1 indexed citations

Ackerman, Eyal, et al.. (2016). The Flip Diameter of Rectangulations and Convex Subdivisions. Discrete Mathematics & Theoretical Computer Science. Vol. 18 no. 3(Combinatorics). 1 indexed citations

Ackerman, Eyal. (2014). A note on 1-planar graphs. Discrete Applied Mathematics. 175. 104–108. 8 indexed citations

Ackerman, Eyal, Jacob Fox, János Pach, & Andrew Suk. (2014). On grids in topological graphs. Computational Geometry. 47(7). 710–723. 3 indexed citations

Ackerman, Eyal & Rom Pinchasi. (2013). On coloring points with respect to rectangles. Journal of Combinatorial Theory Series A. 120(4). 811–815. 1 indexed citations

Ackerman, Eyal & Rom Pinchasi. (2013). Covering a chessboard with staircase walks. Discrete Mathematics. 313(22). 2547–2551.

Ackerman, Eyal & Rom Pinchasi. (2013). On the Degenerate Crossing Number. Discrete & Computational Geometry. 49(3). 695–702. 1 indexed citations

Ackerman, Eyal & Rom Pinchasi. (2012). On the light side of geometric graphs. Discrete Mathematics. 312(6). 1213–1217.

10.

Ackerman, Eyal, Tsachik Gelander, & Rom Pinchasi. (2012). Ice-creams and wedge graphs. Computational Geometry. 46(3). 213–218. 8 indexed citations

11.

Ackerman, Eyal, et al.. (2011). On inducing polygons and related problems. Computational Geometry. 46(7). 861–878. 1 indexed citations

12.

Ackerman, Eyal, et al.. (2010). Combinatorial model and bounds for target set selection. Theoretical Computer Science. 411(44-46). 4017–4022. 87 indexed citations

13.

Ackerman, Eyal, Jacob Fox, János Pach, & Andrew Suk. (2009). On grids in topological graphs. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 403–412. 2 indexed citations

14.

Ackerman, Eyal. (2009). On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges. Discrete & Computational Geometry. 41(3). 365–375. 22 indexed citations

15.

Ackerman, Eyal & Oren Ben-Zwi. (2008). On sets of points that determine only acute angles. European Journal of Combinatorics. 30(4). 908–910. 6 indexed citations

16.

Ackerman, Eyal, Oswin Aichholzer, & Balázs Keszegh. (2008). Improved upper bounds on the reflexivity of point sets. Computational Geometry. 42(3). 241–249. 6 indexed citations

17.

Ackerman, Eyal, Gill Barequet, & Ron Y. Pinter. (2006). A bijection between permutations and floorplans, and its applications. Discrete Applied Mathematics. 154(12). 1674–1684. 16 indexed citations

18.

Ackerman, Eyal & Gábor Tardos. (2006). On the maximum number of edges in quasi-planar graphs. Journal of Combinatorial Theory Series A. 114(3). 563–571. 24 indexed citations

19.

Ackerman, Eyal, Gill Barequet, & Ron Y. Pinter. (2005). On the number of rectangulations of a planar point set. Journal of Combinatorial Theory Series A. 113(6). 1072–1091. 11 indexed citations

20.

Ackerman, Eyal, Gill Barequet, & Ron Y. Pinter. (2004). On the number of rectangular partitions. Symposium on Discrete Algorithms. 736–745. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact