Oren Weimann
About
In The Last Decade
Oren Weimann
34 papers receiving 396 citations
Peers
Comparison fields: 5 of 56
- Artificial Intelligence 234
- Computational Theory and Mathematics 177
- Computer Networks and Communications 131
- Molecular Biology 95
- Signal Processing 62
Countries citing papers authored by Oren Weimann
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
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
| # | Title | Journal | Authors | Indexed citations |
|---|---|---|---|---|
| 1 | Almost Optimal Exact Distance Oracles for Planar Graphs | Journal of the ACM | Paweł Gawrychowski, Shay Mozes et al. | 0 |
| 2 | An Almost Optimal Edit Distance Oracle | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Paweł Gawrychowski, Shay Mozes et al. | 0 |
| 3 | Minimum Cut in $O(m\log^2 n)$ Time | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Paweł Gawrychowski, Shay Mozes et al. | 2 |
| 4 | Near-Optimal Distance Emulator for Planar Graphs | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Paweł Gawrychowski, Shay Mozes et al. | 1 |
| 5 | Faster shortest paths in dense distance graphs, with applications | Theoretical Computer Science | Shay Mozes, Yahav Nussbaum et al. | 2 |
| 6 | The Nearest Colored Node in a Tree | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Paweł Gawrychowski, Gad M. Landau et al. | 1 |
| 7 | Longest common extensions in trees | Theoretical Computer Science | Philip Bille, Paweł Gawrychowski et al. | 3 |
| 8 | Tree compression with top trees | Information and Computation | Philip Bille, Inge Li Gørtz et al. | 10 |
| 9 | On approximating string selection problems with outliers | Theoretical Computer Science | Christina Boucher, Gad M. Landau et al. | 6 |
| 10 | Towards optimal packed string matching | Theoretical Computer Science | Philip Bille, Dany Breslauer et al. | 5 |
| 11 | Approximating the maximum consecutive subsums of a sequence | Theoretical Computer Science | Ferdinando Cicalese, Eduardo Sany Laber et al. | 2 |
| 12 | Improved Bounds for Online Preemptive Matching | DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) | Leah Epstein, Asaf Levin et al. | 8 |
| 13 | A note on exact distance labeling | Information Processing Letters | Oren Weimann, David Peleg | 3 |
| 14 | Fast RNA structure alignment for crossing input structures | Journal of Discrete Algorithms | Rolf Backofen, Gad M. Landau et al. | 1 |
| 15 | Replacement Paths via Fast Matrix Multiplication | Oren Weimann, Raphael Yuster | 14 | |
| 16 | Computing the Girth of a Planar Graph in $O(n \logn)$ Time | SIAM Journal on Discrete Mathematics | Oren Weimann, Raphael Yuster | 6 |
| 17 | Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2n)-time algorithm | Symposium on Discrete Algorithms | Philip N. Klein, Shay Mozes et al. | 7 |
| 18 | Fast algorithms for computing tree LCS | Theoretical Computer Science | Shay Mozes, Dekel Tsur et al. | 0 |
| 19 | Locality and Gaps in RNA Comparison | Journal of Computational Biology | Rolf Backofen, Danny Hermelin et al. | 8 |
| 20 | Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions | Algorithmica | Yury Lifshits, Shay Mozes et al. | 21 |
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.