Robust 2D Assembly Sequencing via Geometric Planning with Learned Scores. - Tzvika Geft; Aviv Tamar; Ken Goldberg; Dan Halperin (CASE, 2019)

On Two-Handed Planar Assembly Partitioning. - Pankaj K. Agarwal; Boris Aronov; Tzvika Geft; Dan Halperin (CoRR, 2020)

On the Complexity of a Family of Decoupled Multi-Robot Motion Planning Problems. - Tzvika Geft; Dan Halperin (CoRR, 2021)

Refined Hardness of Distance-Optimal Multi-Agent Path Finding. - Tzvika Geft; Dan Halperin (AAMAS, 2022)

Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity. - Mikkel Abrahamsen; Tzvika Geft; Dan Halperin; Barak Ugav (AAMAS, 2023)

Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids. - Tzvika Geft (SOCS, 2023)

Multi-robot motion planning for unit discs with revolving areas. - Pankaj K. Agarwal; Tzvika Geft; Dan Halperin; Erin Taylor 002 (Comput. Geom., 2023)

Introducing Delays in Multi Agent Path Finding. - Justin Kottinger; Tzvika Geft; Shaull Almagor; Oren Salzman; Morteza Lahijanian (SOCS, 2024)

On Two-Handed Planar Assembly Partitioning with Connectivity Constraints. - Pankaj K. Agarwal; Boris Aronov; Tzvika Geft; Dan Halperin (ACM Trans. Algorithms, 2025)

Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval. - Tzvika Geft; Kostas E. Bekris; Jingjin Yu (CoRR, 2025)