Eyal Ackerman

34 papers receiving 468 citations

Peers

Eyal Ackerman
Comparison fields: 5 of 23
  • Discrete Mathematics and Combinatorics 138
  • Computer Graphics and Computer-Aided Design 130
  • Computational Theory and Mathematics 302
  • Statistical and Nonlinear Physics 89
  • Computer Vision and Pattern Recognition 20
Replace V. Neumann‐Lara with:
V. Neumann‐Lara Mexico
Michael O. Albertson United States
Stephen G. Hartke United States
Ervin Győri Hungary
Anusch Taraz Germany
Balázs Keszegh Hungary
Ruy Fabila‐Monroy Mexico
Ross J. Kang Netherlands
J.L.A. Yebra Spain
Pierre Duchet France
Eyal Ackerman relative to V. Neumann‐Lara Mexico V. Neumann‐Lara's profile →
Citations per field
00.5×5×10×15×17.8×
V. Neumann‐Lara · 1×
Citations per year

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-authors

The 24 scholars most cited alongside Eyal Ackerman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Eyal Ackerman Line = papers co-authored together Eyal Ackerman links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 40 papers — load more, or switch the sort, to bring in the rest.

#Work
1 2010124
2 200673
3 200957
4 201929
5 200623
6 200517
7 201416
8 201213
9 201212
10 200411
11 200611
12 200611
13 201411
14 201110
15 20089
16 20087
17 20097
18 20177
19 20187
20 20134

About Eyal Ackerman

Eyal Ackerman is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Algebra and Number Theory and Geometry and Topology, having authored 40 papers that have together received 489 indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (21 papers), Advanced Graph Theory Research (18 papers), Advanced Combinatorial Mathematics (16 papers), Complexity and Algorithms in Graphs (7 papers), Limits and Structures in Graph Theory (7 papers), Analytic Number Theory Research (1 paper), Mathematics and Applications (1 paper) and Complex Network Analysis Techniques (1 paper). The work is most often cited by research in Discrete Mathematics and Combinatorics (138 citations), Computer Graphics and Computer-Aided Design (130 citations), Computational Theory and Mathematics (302 citations), Statistical and Nonlinear Physics (89 citations) and Computer Vision and Pattern Recognition (20 citations). Eyal Ackerman has collaborated with scholars based in Israel, Hungary and Germany. Frequent co-authors include Oren Ben-Zwi, Gábor Tardos, Gill Barequet A, Ron Y. Pinter, Balázs Keszegh, Rom Pinchasi, Radoslav Fulek, Csaba D. Tóth, Máté Vizer and János Pach. Their work appears in journals such as Computational Geometry, Discrete & Computational Geometry, Discrete Mathematics, Journal of Combinatorial Theory Series A and European Journal of Combinatorics.

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