| Refined hardness of distance-optimal multi-agent path finding T Geft, D Halperin Autonomous Agents and Multiagent Systems (AAMAS), 481-488, 2022 | 18 | 2022 |
| Multi-robot motion planning for unit discs with revolving areas PK Agarwal, T Geft, D Halperin, E Taylor Computational Geometry 114, 102019, 2023 | 7 | 2023 |
| On two-handed planar assembly partitioning with connectivity constraints PK Agarwal, B Aronov, T Geft, D Halperin ACM-SIAM Symposium on Discrete Algorithms (SODA), 1740-1756, 2021 | 7 | 2021 |
| Robust 2D assembly sequencing via geometric planning with learned scores T Geft, A Tamar, K Goldberg, D Halperin International Conference on Automation Science and Engineering (CASE), 1603-1610, 2019 | 6 | 2019 |
| Introducing delays in multi-agent path finding J Kottinger, T Geft, S Almagor, O Salzman, M Lahijanian arXiv preprint arXiv:2307.11252, 2023 | 4 | 2023 |
| Coordination of multiple robots along given paths with bounded junction complexity M Abrahamsen, T Geft, D Halperin, B Ugav Autonomous Agents and Multiagent Systems (AAMAS), 932-940, 2023 | 4 | 2023 |
| Tractability frontiers in multi-robot coordination and geometric reconfiguration T Geft, D Halperin, Y Nakar arXiv preprint arXiv:2104.07011, 2021 | 4* | 2021 |
| Fine-grained complexity analysis of multi-agent path finding on 2D grids T Geft International Symposium on Combinatorial Search (SoCS) 16 (1), 20-28, 2023 | 2 | 2023 |
| Optimal Algorithms for Separating a Polyhedron from Its Single-Part Mold P Bose, T Geft, D Halperin, S Shamai arXiv preprint arXiv:1708.04203, 2021 | | 2021 |
Dan HalperinProfessor of Computer Science, Tel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
