Oren Salzman

1.3k total citations
51 papers, 615 citations indexed

About

Oren Salzman is a scholar working on Computer Vision and Pattern Recognition, Computer Networks and Communications and Control and Systems Engineering. According to data from OpenAlex, Oren Salzman has authored 51 papers receiving a total of 615 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computer Vision and Pattern Recognition, 17 papers in Computer Networks and Communications and 15 papers in Control and Systems Engineering. Recurrent topics in Oren Salzman's work include Robotic Path Planning Algorithms (40 papers), Robotics and Sensor-Based Localization (14 papers) and Optimization and Search Problems (11 papers). Oren Salzman is often cited by papers focused on Robotic Path Planning Algorithms (40 papers), Robotics and Sensor-Based Localization (14 papers) and Optimization and Search Problems (11 papers). Oren Salzman collaborates with scholars based in Israel, United States and Chile. Oren Salzman's co-authors include Dan Halperin, Kiril Solovey, Roni Stern, Pankaj K. Agarwal, Ron Alterovitz, Siddhartha S Srinivasa, Mengyu Fu, Michael Hemmer, Sven Koenig and Nika Haghtalab and has published in prestigious journals such as Communications of the ACM, Artificial Intelligence and The International Journal of Robotics Research.

In The Last Decade

Oren Salzman

50 papers receiving 605 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Oren Salzman Israel 13 514 270 199 117 113 51 615
Edward Schmerling United States 10 453 0.9× 265 1.0× 241 1.2× 138 1.2× 74 0.7× 23 675
Michael Otte United States 12 419 0.8× 262 1.0× 138 0.7× 129 1.1× 240 2.1× 39 653
Kiril Solovey Israel 11 330 0.6× 137 0.5× 113 0.6× 78 0.7× 125 1.1× 32 399
Duc Trung Tran Vietnam 2 529 1.0× 259 1.0× 239 1.2× 114 1.0× 92 0.8× 3 636
Yong K. Hwang United States 4 529 1.0× 272 1.0× 267 1.3× 85 0.7× 68 0.6× 6 620
Robert Pěnička Czechia 18 570 1.1× 468 1.7× 257 1.3× 99 0.8× 171 1.5× 41 913
Jing‐Sin Liu Taiwan 13 348 0.7× 141 0.5× 374 1.9× 59 0.5× 69 0.6× 77 660
Kwangjin Yang South Korea 12 735 1.4× 512 1.9× 594 3.0× 58 0.5× 89 0.8× 25 1.1k
Tomáš Fico Slovakia 5 533 1.0× 369 1.4× 321 1.6× 88 0.8× 102 0.9× 9 772
Hachémi Bennaceur Saudi Arabia 12 353 0.7× 154 0.6× 129 0.6× 121 1.0× 137 1.2× 27 522

Countries citing papers authored by Oren Salzman

Since Specialization
Citations

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

Fields of papers citing papers by Oren Salzman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Oren Salzman

This figure shows the co-authorship network connecting the top 25 collaborators of Oren Salzman. A scholar is included among the top collaborators of Oren Salzman 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 Salzman. Oren Salzman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hernández, Carlos, Maxim Likhachev, Ariel Felner, et al.. (2024). EMOA*: A framework for search-based multi-objective path planning. Artificial Intelligence. 339. 104260–104260. 2 indexed citations
2.
Salzman, Oren, et al.. (2024). Towards Contact-Aided Motion Planning for Tendon-Driven Continuum Robots. IEEE Robotics and Automation Letters. 9(5). 4687–4694. 3 indexed citations
3.
Salzman, Oren, et al.. (2023). Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. Proceedings of the International Conference on Automated Planning and Scheduling. 33(1). 452–461. 3 indexed citations
4.
Solovey, Kiril, et al.. (2023). Terraforming – Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery. Proceedings of the International Symposium on Combinatorial Search. 16(1). 92–100. 2 indexed citations
5.
6.
Atzmon, Dor, Ariel Felner, Oren Salzman, et al.. (2023). Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. Proceedings of the International Symposium on Combinatorial Search. 16(1). 183–184. 1 indexed citations
7.
Salzman, Oren, et al.. (2023). Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. Proceedings of the International Symposium on Combinatorial Search. 16(1). 101–109. 1 indexed citations
8.
Fu, Mengyu, Kiril Solovey, Oren Salzman, & Ron Alterovitz. (2023). Toward certifiable optimal motion planning for medical steerable needles. The International Journal of Robotics Research. 42(10). 798–826. 5 indexed citations
9.
Rucker, D. Caleb, et al.. (2023). Safer Motion Planning of Steerable Needles via a Shaft-to-Tissue Force Model. 8(01n02). 3 indexed citations
10.
Fu, Mengyu, Alan Kuntz, Oren Salzman, & Ron Alterovitz. (2023). Asymptotically optimal inspection planning via efficient near-optimal search on sampled roadmaps. The International Journal of Robotics Research. 42(4-5). 150–175. 1 indexed citations
11.
Hernández, Carlos, et al.. (2022). Simple and efficient bi-objective search algorithms via fast dominance checks. Artificial Intelligence. 314. 103807–103807. 16 indexed citations
12.
Váňa, Petr, et al.. (2022). T*$\boldsymbol{\varepsilon}$—Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems. IEEE Robotics and Automation Letters. 7(2). 4102–4109. 1 indexed citations
13.
Solovey, Kiril, et al.. (2022). Leveraging Experience in Lifelong Multi-Agent Pathfinding. Proceedings of the International Symposium on Combinatorial Search. 15(1). 118–126. 5 indexed citations
14.
Salzman, Oren, et al.. (2021). Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. Proceedings of the International Symposium on Combinatorial Search. 12(1). 173–175. 1 indexed citations
15.
Filmus, Yuval, et al.. (2021). Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. Proceedings of the International Symposium on Combinatorial Search. 12(1). 64–72. 9 indexed citations
16.
Salzman, Oren & Roni Stern. (2020). Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems. Adaptive Agents and Multi-Agents Systems. 1711–1715. 33 indexed citations
17.
Salzman, Oren, et al.. (2016). A methodological, task-based approach to Procedure-Specific Simulations training. International Journal of Computer Assisted Radiology and Surgery. 11(12). 2317–2324. 6 indexed citations
18.
Solovey, Kiril, Oren Salzman, & Dan Halperin. (2016). New perspective on sampling-based motion planning via random geometric graphs. 6 indexed citations
19.
Salzman, Oren, et al.. (2015). Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. abs 1409 8112. 2985–2990. 11 indexed citations
20.
Salzman, Oren & Dan Halperin. (2014). Asymptotically near-optimal RRT for fast, high-quality, motion planning. 4680–4685. 34 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

Breakdown of academic impact, for papers by Edward Schmerling Breakdown of academic impact, for papers by Michael Otte Breakdown of academic impact, for papers by Kiril Solovey Breakdown of academic impact, for papers by Duc Trung Tran Breakdown of academic impact, for papers by Yong K. Hwang Breakdown of academic impact, for papers by Robert Pěnička Breakdown of academic impact, for papers by Jing‐Sin Liu Breakdown of academic impact, for papers by Kwangjin Yang Breakdown of academic impact, for papers by Tomáš Fico Breakdown of academic impact, for papers by Hachémi Bennaceur
Rankless by CCL
2026