Staff profile
Overview
https://apps.dur.ac.uk/biography/image/2415
| Affiliation |
|---|
| 3P in the Department of Mathematical Sciences |
Biography
Supervisors
Norbert Peyerimhoff (1st)
Research interests
- Multi-Agent Path Finding
- Graph Theory
- Complexity Theory
Publications
Conference Paper
- NP-completeness of the combinatorial distance matrix realisation problem
Fairbairn, D., Mertzios, G., & Peyerimhoff, N. (2025, December). NP-completeness of the combinatorial distance matrix realisation problem. Presented at 14th International Symposium on Algorithms and Complexity (CIAC 2025), Rome, Italy - Exploiting Geometric Constraints in Multi-Agent Pathfinding
Atzmon, D., Bernardini, S., Fagnani, F., & Fairbairn, D. (2023, July). Exploiting Geometric Constraints in Multi-Agent Pathfinding. Presented at Thirty-Third International Conference on Automated Planning and Scheduling, Prague, Czech Republic - Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract)
Fairbairn, D. (2023, July). Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract). Presented at Sixteenth International Symposium on Combinatorial Search, Prague, Czech Republic