118 citations · 187 across the 14 of their papers we have counts for
18 papers
The Infectious Vaccination Problem: a variant of Firefighting with Spreading Defence
Jessica Enright, Melissa A. Huggan, Ethan Hunter-Frankland +2
The Firefighter Problem models a spreading process (originally a fire, alternatively an infection or rumour, for example) on a graph. A defender saves a single vertex per turn; aft…
Cops and Robbers on Multi-Layer Graphs
Jessica Enright, Kitty Meeks, William Pettersson +1
We generalise the popular cops and robbers game to multi-layer graphs, where each cop and the robber are restricted to a single layer (or set of edges). We show that initial intuit…
Bovine Tuberculosis in Britain: identifying signatures of polarisation and controversy on Twitter
Christopher J. Banks, Jessica Enright, Sibylle Mohr +1
Approaches to disease control are influenced by and reflected in public opinion, and the two are intrinsically entwined. Bovine tuberculosis (bTB) in British cattle and badgers is…
Visualization for Epidemiological Modelling: Challenges, Solutions, Reflections & Recommendations
Jason Dykes, Alfie Abdul-Rahman, Daniel Archambault +30
We report on an ongoing collaboration between epidemiological modellers and visualization researchers by documenting and reflecting upon knowledge constructs -- a series of ideas,…
Making Life More Confusing for Firefighters
Samuel Hand, Jessica Enright, Kitty Meeks
It is well known that fighting a fire is a hard task. The Firefighter problem asks how to optimally deploy firefighters to defend the vertices of a graph from a fire. This problem…
Counting Temporal Paths
Jessica Enright, Kitty Meeks, Hendrik Molter
The betweenness centrality of a vertex v is an important centrality measure that quantifies how many optimal paths between pairs of other vertices visit v. Computing betweenness ce…
Recognising the overlap graphs of subtrees of restricted trees is hard
Jessica Enright, Martin Pergel
The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The comp…
FAIR Data Pipeline: provenance-driven data management for traceable scientific workflows
Sonia Natalie Mitchell, Andrew Lahiff, Nathan Cummings +35
Modern epidemiological analyses to understand and combat the spread of disease depend critically on access to, and use of, data. Rapidly evolving data, such as data streams changin…
Tangled Paths: A Random Graph Model from Mallows Permutations
Jessica Enright, Kitty Meeks, William Pettersson +1
We introduce the random graph which results from taking the union of two paths of length , where the vertices of one of the paths have been relabelled a…
The Role of Cross-Silo Federated Learning in Facilitating Data Sharing in the Agri-Food Sector
Aiden Durrant, Milan Markovic, David Matthews +3
Data sharing remains a major hindering factor when it comes to adopting emerging AI technologies in general, but particularly in the agri-food sector. Protectiveness of data is nat…
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
Jessica Enright, Duncan Lee, Kitty Meeks +2
Understanding spatial correlation is vital in many fields including epidemiology and social science. Lee, Meeks and Pettersson (Stat. Comput. 2021) recently demonstrated that impro…
The Firebreak Problem
Kathleen D. Barnetson, Andrea C. Burgess, Jessica Enright +3
Suppose we have a network that is represented by a graph . Potentially a fire (or other type of contagion) might erupt at some vertex of . We are able to respond to this outb…
Deleting edges to restrict the size of an epidemic in temporal networks
Jessica Enright, Kitty Meeks, George B. Mertzios +1
Spreading processes on graphs are a natural model for a wide variety of real-world phenomena, including information spread over social networks and biological diseases spreading ov…
Two dichotomies for model-checking in multi-layer structures
Jessica Enright, Kitty Meeks, Jessica Ryan
Multi-layer graphs can capture qualitatively different types of connection between entities, and networks of this kind are prevalent in biological and social systems: for example,…
Equivalence of the filament and overlap graphs of subtrees of limited trees
Jessica Enright, Lorna Stewart
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of s…
Deleting edges to restrict the size of an epidemic
Jessica Enright, Kitty Meeks
Motivated by applications in network epidemiology, we consider the problem of determining whether it is possible to delete at most edges from a given input graph (of small tree…
On List Colouring and List Homomorphism of Permutation and Interval Graphs
Jessica Enright, Lorna Stewart, Gabor Tardos
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for…
3-List Colouring Permutation Graphs
Jessica Enright, Lorna Stewart
3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation gra…