Oren Weimann
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 5%
- Computer Networks and Communications top 10%
- Molecular Biology
- Signal Processing top 10%
- Co-authors
- Shay MozesErik D. DemaineGad M. LandauBenjamin RossmanRaphael YusterPhilip N. KleinDanny HermelinPhilip Bille
- Topics
- Algorithms and Data Compression (20 papers)Complexity and Algorithms in Graphs (17 papers)Advanced Graph Theory Research (12 papers)
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignArtificial Intelligence
- Partner nations
- IsraelUnited StatesPoland
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 2 | |
| 4 | 1 | |
| 5 | 2 | |
| 6 | 1 | |
| 7 | 3 | |
| 8 | 10 | |
| 9 | 6 | |
| 10 | 5 | |
| 11 | 2 | |
| 12 | 8 | |
| 13 | 3 | |
| 14 | 1 | |
| 15 | 14 | |
| 16 | 6 | |
| 17 | 7 | |
| 18 | 0 | |
| 19 | 8 | |
| 20 | 21 |
About Oren Weimann
Oren Weimann is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Hardware and Architecture, having authored 40 papers that have together received 423 indexed citations. Recurring topics across this work include Algorithms and Data Compression (20 papers), Complexity and Algorithms in Graphs (17 papers) and Advanced Graph Theory Research (12 papers). The work is most often cited by research in Computational Theory and Mathematics (177 citations), Computer Graphics and Computer-Aided Design (27 citations) and Artificial Intelligence (234 citations). Oren Weimann has collaborated with scholars based in Israel, United States and Poland. Frequent 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. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.
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.