7 citations · 17 across the 10 of their papers we have counts for
11 papers
Maximising Influence Spread in Complex Networks by Utilising Community-based Driver Nodes as Seeds
Abida Sadaf, Luke Mathieson, Piotr Bródka +1
Finding a small subset of influential nodes to maximise influence spread in a complex network is an active area of research. Different methods have been proposed in the past to ide…
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
Michael J. Bremner, Zhengfeng Ji, Xingjian Li +2
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computatio…
Quantum Parameterized Complexity
Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann +3
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish…
On the Parameterised Complexity of Induced Multipartite Graph Parameters
Ryan L. Mann, Luke Mathieson, Catherine Greenhill
We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem…
Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard
Giuseppe Lancia, Luke Mathieson, Pablo Moscato
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most no…
Graph Editing Problems with Extended Regularity Constraints
Luke Mathieson
Graph editing problems offer an interesting perspective on sub- and supergraph identification problems for a large variety of target properties. They have also attracted significan…