Ofer Neiman

1.1k total citations
44 papers, 395 citations indexed

About

Ofer Neiman is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Ofer Neiman has authored 44 papers receiving a total of 395 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 10 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Ofer Neiman's work include Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (25 papers) and Optimization and Search Problems (10 papers). Ofer Neiman is often cited by papers focused on Complexity and Algorithms in Graphs (27 papers), Advanced Graph Theory Research (25 papers) and Optimization and Search Problems (10 papers). Ofer Neiman collaborates with scholars based in Israel, United States and Denmark. Ofer Neiman's co-authors include Ittai Abraham, Yair Bartal, Michael Elkin, Shay Solomon, Aleksandrs Slivkins, Y. Bartal, Jon Kleinberg, Kedar Dhamdhere, Anupam Gupta and Alexandr Andoni and has published in prestigious journals such as SIAM Journal on Computing, Advances in Mathematics and Theoretical Computer Science.

In The Last Decade

Ofer Neiman

41 papers receiving 371 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Ofer Neiman Israel	12	278	151	99	88	72	44	395
Avner Magen Canada	12	220 0.8×	70 0.5×	67 0.7×	117 1.3×	36 0.5×	32	325
Eden Chlamtáč United States	7	212 0.8×	85 0.6×	60 0.6×	72 0.8×	24 0.3×	15	294
Alexander V. Karzanov Russia	12	266 1.0×	103 0.7×	40 0.4×	46 0.5×	21 0.3×	37	409
Sushant Sachdeva United States	10	154 0.6×	63 0.4×	19 0.2×	132 1.5×	31 0.4×	32	307
Christine Rüb Germany	6	124 0.4×	158 1.0×	41 0.4×	158 1.8×	33 0.5×	12	384
Patrice Ossona de Mendez France	16	721 2.6×	98 0.6×	141 1.4×	73 0.8×	41 0.6×	68	874
Jochen Alber Germany	11	373 1.3×	193 1.3×	44 0.4×	74 0.8×	20 0.3×	17	455
Daniel Dadush Netherlands	10	160 0.6×	35 0.2×	39 0.4×	92 1.0×	20 0.3×	37	282
Zeev Dvir United States	13	332 1.2×	111 0.7×	38 0.4×	346 3.9×	32 0.4×	53	562
Hans Raj Tiwary Belgium	8	194 0.7×	37 0.2×	35 0.4×	56 0.6×	27 0.4×	22	315

Countries citing papers authored by Ofer Neiman

Since Specialization

Citations

This map shows the geographic impact of Ofer Neiman'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 Ofer Neiman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ofer Neiman more than expected).

Fields of papers citing papers by Ofer Neiman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ofer Neiman. 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 Ofer Neiman. The network helps show where Ofer Neiman may publish in the future.

Co-authorship network of co-authors of Ofer Neiman

This figure shows the co-authorship network connecting the top 25 collaborators of Ofer Neiman. A scholar is included among the top collaborators of Ofer Neiman 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 Ofer Neiman. Ofer Neiman 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

Elkin, Michael & Ofer Neiman. (2022). Distributed strong diameter network decomposition. Theoretical Computer Science. 922. 150–157.

Elkin, Michael & Ofer Neiman. (2022). Lossless Prioritized Embeddings. SIAM Journal on Discrete Mathematics. 36(3). 1529–1550. 2 indexed citations

Elkin, Michael, et al.. (2019). Almost Shortest Paths and PRAM Distance Oracles in Weighted Graphs.. arXiv (Cornell University).

Bartal, Yair, et al.. (2019). Dimensionality reduction: theoretical perspective on practical measures. Neural Information Processing Systems. 32. 10576–10588. 3 indexed citations

Bartal, Yair, et al.. (2019). On notions of distortion and an almost minimum spanning tree with constant average distortion. Journal of Computer and System Sciences. 105. 116–129. 5 indexed citations

Abraham, Ittai & Ofer Neiman. (2019). Using Petal-Decompositions to Build a Low Stretch Spanning Tree. SIAM Journal on Computing. 48(2). 227–248. 9 indexed citations

Elkin, Michael & Ofer Neiman. (2018). Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. ACM Transactions on Algorithms. 15(1). 1–29. 16 indexed citations

Abraham, Ittai, et al.. (2018). Metric embedding via shortest path decompositions. 8 indexed citations

Andoni, Alexandr, Assaf Naor, & Ofer Neiman. (2018). Snowflake universality of Wasserstein spaces. Annales Scientifiques de l École Normale Supérieure. 51(3). 657–700. 6 indexed citations

10.

Bartal, Yair, et al.. (2016). On notions of distortion and an almost minimum spanning tree with constant average distortion. arXiv (Cornell University). 873–882. 1 indexed citations

11.

Neiman, Ofer, et al.. (2015). On vertex rankings of graphs and its relatives. Discrete Mathematics. 338(8). 1460–1467. 3 indexed citations

12.

Elkin, Michael, et al.. (2015). Prioritized Metric Structures and Embedding. 489–498. 1 indexed citations

13.

Bartal, Yair, et al.. (2013). Bandwidth and low dimensional embedding. Theoretical Computer Science. 500. 44–56. 3 indexed citations

14.

Neiman, Ofer & Shay Solomon. (2012). Deterministic Algorithms for Fully Dynamic Maximal Matching. arXiv (Cornell University). 1 indexed citations

15.

Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2011). Advances in metric embedding theory. Advances in Mathematics. 228(6). 3026–3126. 32 indexed citations

16.

Andoni, Alexandr, Moses Charikar, Ofer Neiman, & Huy L. Nguyên. (2011). Near Linear Lower Bound for Dimension Reduction in L1. 61. 315–323. 5 indexed citations

17.

Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2009). On low dimensional local embeddings. Symposium on Discrete Algorithms. 875–884. 6 indexed citations

18.

Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2008). Nearly Tight Low Stretch Spanning Trees. 781–790. 43 indexed citations

19.

Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2007). Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. Symposium on Discrete Algorithms. 502–511. 22 indexed citations

20.

Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2007). Embedding metric spaces in their intrinsic dimension. CaltechAUTHORS (California Institute of Technology). 17 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