David Fairbairn

• Bachelor of Science
• PhD Student at Durham University

The $k$-CombDMR problem is that of determining whether an $n \times n$ distance matrix can be realised by $n$ vertices in some undirected graph with $n + k$ vertices. This problem has a simple solution in the case $k=0$. In this paper we show that this problem is polynomial time solvable for $k=1$ and $k=2$. Moreover, we provide algorithms to const...

I specialise in conducting research in Multi-Agent Path- Finding (MAPF) and Algorithmic Graph Theory. Specifically, I investigate the impact of geometric constraints on a given instance of MAPF, as well as the expansion of MAPF to include resource constraints, target assignment path-finding (TAPF), and academic problems that are relevant to industr...

In tackling the multi-agent pathfinding problem (MAPF), we study a specific class of paths that are constructed by taking the agents’ shortest paths from the start to the goal locations and adding safe delays at the beginning of the paths, which guarantee that they are non-conflicting. Safe delays are calcu- lated by exploiting a set of fundamenta...