Skip to main content

Staff profile

Overview

David Fairbairn

3P

Affiliations
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. (in press). 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). Exploiting Geometric Constraints in Multi-Agent Pathfinding. In S. Koenig, R. Stern, & M. Vallati (Eds.), Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (pp. 17-25). Association for the Advancement of Artificial Intelligence (AAAI). https://doi.org/10.1609/icaps.v33i1.27174
  • Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract)
    Fairbairn, D. (2023). Multi-Agent Path-Finding and Algorithmic Graph Theory (Student Abstract). In Proceedings of the International Symposium on Combinatorial Search (pp. 190-191). Association for the Advancement of Artificial Intelligence (AAAI). https://doi.org/10.1609/socs.v16i1.27308