k-Robust Multi-Agent Path Finding. - Dor Atzmon; Ariel Felner; Roni Stern; Glenn Wagner; Roman Barták; Neng-Fa Zhou (SOCS, 2017)

Robust Multi-Agent Path Finding. - Dor Atzmon; Roni Stern; Ariel Felner; Glenn Wagner; Roman Barták; Neng-Fa Zhou (SOCS, 2018)

Bounded Suboptimal Game Tree Search. - Dor Atzmon; Roni Stern; Abdallah Saffidine (SOCS, 2018)

Online Multi-Agent Pathfinding. - Jirí Svancara; Marek Vlk; Roni Stern; Dor Atzmon; Roman Barták (AAAI, 2019)

Multi-Agent Pathfinding with Continuous Time. - Anton Andreychuk; Konstantin S. Yakovlev; Dor Atzmon; Roni Stern (IJCAI, 2019)

Multi-Train Path Finding. - Dor Atzmon; Amit Diei; Daniel Rave (SOCS, 2019)

Probabilistic Robust Multi-Agent Path Finding. - Dor Atzmon; Ariel Felner; Roni Stern (SOCS, 2019)

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. - Roni Stern; Nathan R. Sturtevant; Ariel Felner; Sven Koenig; Hang Ma 001; Thayne T. Walker; Jiaoyang Li 001; Dor Atzmon; Liron Cohen 002; T. K. Satish Kumar; Roman Barták; Eli Boyarski (SOCS, 2019)

Measuring the Vulnerability of a Multi-Agent Pathfinding Solution. - Rotem Yoeli; Roni Stern; Dor Atzmon (SOCS, 2019)

Multi-Agent Pathfinding (MAPF) with Continuous Time. - Anton Andreychuk; Konstantin S. Yakovlev; Dor Atzmon; Roni Stern (CoRR, 2019)

Probabilistic Robust Multi-Agent Path Finding. - Dor Atzmon; Roni Stern; Ariel Felner; Nathan R. Sturtevant; Sven Koenig (ICAPS, 2020)

Multi-Directional Heuristic Search. - Dor Atzmon; Jiaoyang Li 001; Ariel Felner; Eliran Nachmani; Shahaf S. Shperberg; Nathan R. Sturtevant; Sven Koenig (IJCAI, 2020)

Multi-Directional Search. - Dor Atzmon; Jiaoyang Li 001; Ariel Felner; Eliran Nachmani; Shahaf S. Shperberg; Nathan R. Sturtevant; Sven Koenig (SOCS, 2020)

Generalizing Multi-Agent Path Finding for Heterogeneous Agents. - Dor Atzmon; Yonathan Zax; Einat Kivity; Lidor Avitan; Jonathan Morag; Ariel Felner (SOCS, 2020)

Robust Multi-Agent Path Finding and Executing. - Dor Atzmon; Roni Stern; Ariel Felner; Glenn Wagner; Roman Barták; Neng-Fa Zhou (J. Artif. Intell. Res., 2020)

Conflict-Free Multi-Agent Meeting. - Dor Atzmon; Shahar Idan Freiman; Oscar Epshtein; Oran Shichman; Ariel Felner (SOCS, 2021)

Studying Online Multi-Agent Path Finding. - Jonathan Morag; Roni Stern; Ariel Felner; Dor Atzmon; Eli Boyarski (SOCS, 2021)

Safe Multi-Agent Pathfinding with Time Uncertainty. - Tomer Shahar; Shashank Shekhar 002; Dor Atzmon; Abdallah Saffidine; Brendan Juba; Roni Stern (J. Artif. Intell. Res., 2021)

On Merging Agents in Multi-Agent Pathfinding Algorithms. - Eli Boyarski; Shao-Hung Chan; Dor Atzmon; Ariel Felner; Sven Koenig (SOCS, 2022)

Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract). - Yaakov Livne; Dor Atzmon; Shawn Skyler; Eli Boyarski; Amir Shapiro; Ariel Felner (SOCS, 2022)

Online Multi-Agent Path Finding: New Results. - Jonathan Morag; Ariel Felner; Roni Stern; Dor Atzmon; Eli Boyarski (SOCS, 2022)

Bounded-Cost Bi-Objective Heuristic Search. - Shawn Skyler; Dor Atzmon; Ariel Felner; Oren Salzman; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (SOCS, 2022)

Meeting at the Border of Two Separate Domains. - Alexandru Paul Tabacaru; Dor Atzmon; Ariel Felner (SOCS, 2022)

Multi-agent pathfinding with continuous time. - Anton Andreychuk; Konstantin S. Yakovlev; Pavel Surynek; Dor Atzmon; Roni Stern (Artif. Intell., 2022)

Solving the Watchman Route Problem with Heuristic Search. - Shawn Skyler; Dor Atzmon; Tamir Yaffe; Ariel Felner (J. Artif. Intell. Res., 2022)

Analyzing and Improving the Use of the FastMap Embedding in Pathfinding Tasks. - Reza Mashayekhi; Dor Atzmon; Nathan R. Sturtevant (AAAI, 2023)

Exploiting Geometric Constraints in Multi-Agent Pathfinding. - Dor Atzmon; Sara Bernardini; Fabio Fagnani; David L. Fairbairn (ICAPS, 2023)

W-restrained Bidirectional Bounded-Suboptimal Heuristic Search. - Dor Atzmon; Shahaf S. Shperberg; Netanel Sabah; Ariel Felner; Nathan R. Sturtevant (ICAPS, 2023)

Anonymous Multi-Agent Path Finding with Individual Deadlines. - Gilad Fine; Dor Atzmon; Noa Agmon (AAMAS, 2023)

Optimally Solving the Multiple Watchman Route Problem with Heuristic Search. - Yaakov Livne; Dor Atzmon; Shawn Skyler; Eli Boyarski; Amir Shapiro; Ariel Felner (AAMAS, 2023)

Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. - Shawn Skyler; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner; Oren Salzman; Shao-Hung Chan; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (SOCS, 2023)

Conflict-tolerant and conflict-free multi-agent meeting. - Dor Atzmon; Ariel Felner; Jiaoyang Li 001; Shahaf S. Shperberg; Nathan R. Sturtevant; Sven Koenig (Artif. Intell., 2023)

Minimizing State Exploration While Searching Graphs with Unknown Obstacles. - Daniel Koyfman; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner (AAMAS, 2024)

Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends. - Jirí Svancara; Dor Atzmon; Klaus Strauch; Roland Kaminski; Torsten Schaub (ICAART (3), 2024)

Theoretical Study on Multi-objective Heuristic Search. - Shawn Skyler; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner; Oren Salzman; Shao-Hung Chan; Han Zhang 018; Sven Koenig; William Yeoh 001; Carlos Hernández Ulloa (IJCAI, 2024)

Finiding All Optimal Solutions in Multi-Agent Path Finding (Extended Abstract). - Shahar Bardugo; Dor Atzmon (SOCS, 2024)

Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract). - Daniel Koyfman; Shahaf S. Shperberg; Dor Atzmon; Ariel Felner (SOCS, 2024)

Minimizing Makespan with Conflict-Based Search for Optimal Multi-Agent Path Finding. - Amir Maliah; Dor Atzmon; Ariel Felner (AAMAS, 2025)