102 citations · 176 across the 13 of their papers we have counts for
15 papers
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…
Bounds on the Twin-Width of Product Graphs
William Pettersson, John Sylvester
Twin-width is a graph width parameter recently introduced by Bonnet, Kim, Thomassé & Watrigant. Given two graphs and and a graph product , we address the question: i…
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…
Improved inference for areal unit count data using graph-based optimisation
Duncan Lee, Kitty Meeks
Spatial correlation in areal unit count data is typically modelled by a set of random effects that are assigned a conditional autoregressive (CAR) prior distribution. The spatial c…
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…
Directed branch-width: A directed analogue of tree-width
Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson
Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking wheth…
Multi-Objective Mixed Integer Programming: An Objective Space Algorithm
William Pettersson, Melih Ozlen
This paper introduces the first objective space algorithm which can exactly find all supported and non-supported non-dominated solutions to a mixed-integer multi-objective linear p…
Mathematical models for stable matching problems with ties and incomplete lists
Maxence Delorme, Sergio García, Jacek Gondzio +3
We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its m…
The parameterized complexity of finding a 2-sphere in a simplicial complex
Benjamin Burton, Sergio Cabello, Stefan Kratsch +1
We consider the problem of finding a subcomplex K' of a simplicial complex K such that K' is homeomorphic to the 2-dimensional sphere, S^2. We study two variants of this problem. T…
Multi-objective integer programming: Synergistic parallel approaches
William Pettersson, Melih Ozlen
Exactly solving multi-objective integer programming (MOIP) problems is often a very time consuming process, especially for large and complex problems. Parallel computing has the po…
Efficient Projection Partitioning for parallel multi-objective integer optimisation
William Pettersson, Melih Ozlen
This paper introduces a new method of partitioning the solution space of a multi-objective optimisation problem for parallel processing, called Efficient Projection Partitioning. T…
A parallel approach to bi-objective integer programming
William Pettersson, Melih Ozlen
To obtain a better understanding of the trade-offs between various objectives, Bi-Objective Integer Programming (BOIP) algorithms calculate the set of all non-dominated vectors and…
An edge-based framework for enumerating 3-manifold triangulations
Benjamin A. Burton, William Pettersson
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for…
Fixed parameter tractable algorithms in combinatorial topology
Benjamin A. Burton, William Pettersson
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts t…
Decompositions of complete graphs into cycles of arbitrary lengths
Darryn Bryant, Daniel Horsley, William Pettersson
We show that the complete graph on vertices can be decomposed into cycles of specified lengths if and only if is odd, for $i=1,\ldots…