27 citations · 100 across the 27 of their papers we have counts for
9 papers · 1 filter
The parameterised complexity of generalised temporal domination on temporal graphs with modular structure
Jessica Enright, Kitty Meeks, Elena Moss
Inspired by the static problem -Dominating Set, we propose a general temporal domination problem, called -Temporal Dominating Set (-TDS). We show that this pro…
Temporal Role Colouring
Jessica Enright, Kitty Meeks, Puck Rombach +1
A role colouring of a graph is an assignment of colours to the vertices of such that two vertices of the same colour have identical sets of colours in their neighbourhoods.…
Temporal Orienteering with Changing Fuel Costs
Timothée Corsini, Jessica Enright, Laura Larios-Jones +1
The problem Orienteering asks whether there exists a walk which visits a number of sites without exceeding some fuel budget. In the variant of the problem we consider, the cost of…
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
Jessica Enright, Samuel D. Hand, Laura Larios-Jones +1
Temporal graphs are graphs whose edges are labelled with times at which they are active. Their time-sensitivity provides a useful model of real networks, but renders many problems…
Reachability in temporal graphs under perturbation
Jessica Enright, Laura Larios-Jones, Kitty Meeks +1
Reachability and other path-based measures on temporal graphs can be used to understand spread of infection, information, and people in modelled systems. Due to delays and errors i…
Structural Parameters for Dense Temporal Graphs
Jessica Enright, Samuel D. Hand, Laura Larios-Jones +1
Temporal graphs provide a useful model for many real-world networks. Unfortunately the majority of algorithmic problems we might consider on such graphs are intractable. There has…
A New Temporal Interpretation of Cluster Editing
Cristiano Bocci, Chiara Capresi, Kitty Meeks +1
The NP-complete graph problem Cluster Editing seeks to transform a static graph into a disjoint union of cliques by making the fewest possible edits to the edges. We introduce a na…
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,…
The Interactive Sum Choice Number of Graphs
Marthe Bonamy, Kitty Meeks
We introduce a variant of the well-studied sum choice number of graphs, which we call the interactive sum choice number. In this variant, we request colours to be added to the vert…