3 papers
cs.RO2026
Fast and Near-Optimal Collision-Free Robot Scheduling On Paths
Duncan Adamson, Nathan Flaherty, Igor Potapov +2
In this paper, we address the problem of scheduling a set of robots to complete tasks in a laboratory environment, modelled as a graph, while avoiding collisions. We analyze the dy…
cs.DS2025
Maintaining Bipartite Colourings on Temporal Graphs on a Budget
Duncan Adamson, George B. Mertzios, Paul G. Spirakis
Graph colouring is a fundamental problem for networks, serving as a tool for avoiding conflicts via symmetry breaking, for example, avoiding multiple computer processes simultaneou…
cs.DC2024
Distributed weak independent sets in hypergraphs: Upper and lower bounds
Duncan Adamson, Will Rosenbaum, Paul G. Spirakis
In this paper, we consider the problem of finding weak independent sets in a distributed network represented by a hypergraph. In this setting, each edge contains a set of r vertice…