research
∙
03/07/2023
Cops and Robbers on Multi-Layer Graphs
We generalise the popular cops and robbers game to multi-layer graphs, w...
share
research
∙
11/07/2022
Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
We study a query model of computation in which an n-vertex k-hypergraph ...
research
∙
09/07/2022
Counting Subgraphs in Somewhere Dense Graphs
We study the problems of counting copies and induced copies of a small p...
research
∙
02/25/2022
Making Life More Confusing for Firefighters
It is well known that fighting a fire is a hard task. The Firefighter pr...
research
∙
02/24/2022
Counting Temporal Paths
The betweenness centrality of a vertex v is an important centrality meas...
research
∙
02/02/2022
A New Temporal Interpretation of Cluster Editing
The NP-complete graph problem Cluster Editing seeks to transform a stati...
research
∙
08/10/2021
Tangled Paths: A Random Graph Model from Mallows Permutations
We introduce the random graph 𝒫(n,q) which results from taking the union...
research
∙
03/09/2021
Edge exploration of temporal graphs
We introduce a natural temporal analogue of Eulerian circuits and prove ...
research
∙
10/21/2020
Improved inference for areal unit count data using graph-based optimisation
Spatial correlation in areal unit count data is typically modelled by a ...
research
∙
10/20/2020
On the complexity of optimally modifying graphs representing spatial correlation in areal unit count data
Lee and Meeks recently demonstrated that improved inference for areal un...
research
∙
09/18/2020
Directed branch-width: A directed analogue of tree-width
We introduce a new digraph width measure called directed branch-width. T...
research
∙
07/10/2019
Approximately counting and sampling small witnesses using a colourful decision oracle
In this paper, we prove "black box" results for turning algorithms which...
research
∙
07/18/2018
The parameterised complexity of computing the maximum modularity of a graph
The maximum modularity of a graph is a parameter widely used to describe...
research
∙
05/17/2018
Deleting edges to restrict the size of an epidemic in temporal networks
A variety of potentially disease-spreading contact networks can be natur...
research
∙
05/03/2018
On the Enumeration of Minimal Hitting Sets in Lexicographical Order
It is a long-standing open problem whether there exists an output-polyno...
research
∙
02/16/2018
Changing times to optimise reachability in temporal graphs
Temporal graphs (in which edges are active only at specified time steps)...
research
∙
10/24/2017
Counting small subgraphs in multi-layer networks
Motivated by the prevalence of multi-layer network structures in biologi...
research
∙
08/14/2017