Oren Weimann

1.6k total citations
40 papers, 423 citations indexed

About

Oren Weimann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Oren Weimann has authored 40 papers receiving a total of 423 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 9 papers in Computer Networks and Communications. Recurrent topics in Oren Weimann's work include Algorithms and Data Compression (20 papers), Complexity and Algorithms in Graphs (17 papers) and Advanced Graph Theory Research (12 papers). Oren Weimann is often cited by papers focused on Algorithms and Data Compression (20 papers), Complexity and Algorithms in Graphs (17 papers) and Advanced Graph Theory Research (12 papers). Oren Weimann collaborates with scholars based in Israel, United States and Poland. Oren Weimann's co-authors include Shay Mozes, Erik D. Demaine, Gad M. Landau, Benjamin Rossman, Raphael Yuster, Philip N. Klein, Danny Hermelin, Philip Bille, Laxmi Parida and Krzysztof Onak and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Oren Weimann

34 papers receiving 396 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Oren Weimann Israel	11	234	177	131	95	62	40	423
Stephen Alstrup Denmark	14	281 1.2×	300 1.7×	194 1.5×	50 0.5×	104 1.7×	43	604
Omer Berkman United States	9	253 1.1×	194 1.1×	119 0.9×	88 0.9×	34 0.5×	17	396
Jérémy Barbay Chile	11	229 1.0×	67 0.4×	111 0.8×	60 0.6×	106 1.7×	31	320
Theis Rauhe Denmark	12	245 1.0×	218 1.2×	140 1.1×	53 0.6×	92 1.5×	26	424
Francisco Claude Chile	12	264 1.1×	45 0.3×	101 0.8×	73 0.8×	55 0.9×	21	341
Domenico Cantone Italy	11	340 1.5×	255 1.4×	76 0.6×	52 0.5×	53 0.9×	112	509
Francis Y. L. Chin Hong Kong	12	126 0.5×	110 0.6×	311 2.4×	69 0.7×	18 0.3×	50	641
Funda Ergün United States	14	281 1.2×	251 1.4×	251 1.9×	44 0.5×	43 0.7×	31	565
Paul F. Dietz United States	9	301 1.3×	134 0.8×	253 1.9×	36 0.4×	149 2.4×	16	471
F. Dehne Canada	12	97 0.4×	75 0.4×	182 1.4×	77 0.8×	123 2.0×	36	422

Countries citing papers authored by Oren Weimann

Since Specialization

Citations

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

Fields of papers citing papers by Oren Weimann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Oren Weimann

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

Gawrychowski, Paweł, et al.. (2023). Almost Optimal Exact Distance Oracles for Planar Graphs. Journal of the ACM. 70(2). 1–50.

Gawrychowski, Paweł, et al.. (2021). An Almost Optimal Edit Distance Oracle. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 20.

Gawrychowski, Paweł, Shay Mozes, & Oren Weimann. (2019). Minimum Cut in $O(m\log^2 n)$ Time. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 2 indexed citations

Gawrychowski, Paweł, et al.. (2018). Near-Optimal Distance Emulator for Planar Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 1 indexed citations

Mozes, Shay, Yahav Nussbaum, & Oren Weimann. (2017). Faster shortest paths in dense distance graphs, with applications. Theoretical Computer Science. 711. 11–35. 2 indexed citations

Gawrychowski, Paweł, Gad M. Landau, Shay Mozes, & Oren Weimann. (2016). The Nearest Colored Node in a Tree. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Bille, Philip, Paweł Gawrychowski, Inge Li Gørtz, Gad M. Landau, & Oren Weimann. (2015). Longest common extensions in trees. Theoretical Computer Science. 638. 98–107. 3 indexed citations

Bille, Philip, Inge Li Gørtz, Gad M. Landau, & Oren Weimann. (2015). Tree compression with top trees. Information and Computation. 243. 166–177. 10 indexed citations

Boucher, Christina, Gad M. Landau, Avivit Levy, David Pritchard, & Oren Weimann. (2013). On approximating string selection problems with outliers. Theoretical Computer Science. 498. 107–114. 6 indexed citations

10.

Bille, Philip, et al.. (2013). Towards optimal packed string matching. Theoretical Computer Science. 525. 111–129. 5 indexed citations

11.

Cicalese, Ferdinando, Eduardo Sany Laber, Oren Weimann, & Raphael Yuster. (2013). Approximating the maximum consecutive subsums of a sequence. Theoretical Computer Science. 525. 130–137. 2 indexed citations

12.

Epstein, Leah, Asaf Levin, Danny Segev, & Oren Weimann. (2013). Improved Bounds for Online Preemptive Matching. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 389–399. 8 indexed citations

13.

Weimann, Oren & David Peleg. (2011). A note on exact distance labeling. Information Processing Letters. 111(14). 671–673. 3 indexed citations

14.

Backofen, Rolf, Gad M. Landau, Mathias Möhl, Dekel Tsur, & Oren Weimann. (2010). Fast RNA structure alignment for crossing input structures. Journal of Discrete Algorithms. 9(1). 2–11. 1 indexed citations

15.

Weimann, Oren & Raphael Yuster. (2010). Replacement Paths via Fast Matrix Multiplication. 655–662. 14 indexed citations

16.

Weimann, Oren & Raphael Yuster. (2010). Computing the Girth of a Planar Graph in $O(n \logn)$ Time. SIAM Journal on Discrete Mathematics. 24(2). 609–616. 6 indexed citations

17.

Klein, Philip N., Shay Mozes, & Oren Weimann. (2009). Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2n)-time algorithm. Symposium on Discrete Algorithms. 236–245. 7 indexed citations

18.

Mozes, Shay, Dekel Tsur, Oren Weimann, & Michal Ziv-Ukelson. (2009). Fast algorithms for computing tree LCS. Theoretical Computer Science. 410(43). 4303–4314.

19.

Backofen, Rolf, Danny Hermelin, Gad M. Landau, et al.. (2007). Locality and Gaps in RNA Comparison. Journal of Computational Biology. 14(8). 1074–1087. 8 indexed citations

20.

Lifshits, Yury, Shay Mozes, Oren Weimann, & Michal Ziv-Ukelson. (2007). Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica. 54(3). 379–399. 21 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