Luke Mathieson
YOU?
Author Swipe
Relational Algebras for Subset Selection and Optimisation Open
The database community lacks a unified relational query language for subset selection and optimisation queries, limiting both user expression and query optimiser reasoning about such problems. Decades of research (latterly under the rubric…
Fullerene-encapsulated Cyclic Ozone for the Next Generation of Nano-sized Propellants via Quantum Computation Open
Cyclic ozone additives have the potential to significantly increase the specific impulse of rocket fuel, which would lead to greater efficiency and reduced costs for space launches, allowing up to one third more payload per rocket. Althoug…
A bridge between influence models and control methods Open
Understanding how influence is seeded and spreads through social networks is an increasingly important study area. While there are many methods to identify seed nodes that are used to initialize a spread of influence, the idea of using met…
Quantum computing for corrosion-resistant materials and anti-corrosive coatings design Open
Corrosion is a pervasive issue that impacts the structural integrity and performance of materials across various industries, imposing a significant economic impact globally. In fields like aerospace and defense, developing corrosion-resist…
Relational Expressions for Data Transformation and Computation Open
Separate programming models for data transformation (declarative) and computation (procedural) impact programmer ergonomics, code reusability and database efficiency. To eliminate the necessity for two models or paradigms, we propose a sma…
Maximising Influence Spread in Complex Networks by Utilising Community-based Driver Nodes as Seeds Open
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 identify a set of seed nodes that can help achieve a faster sp…
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis Open
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computational basis states of Hamming weight $k$. The Hamming weight …
Quantum Parameterized Complexity Open
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 a quantum equivalent of classical parameterized complexity …
A Bibliometrics Analysis of Australian Computing Education Conference Proceedings Open
The bib file includes the bib records of all research publications of Australasian Computing Education Conference prior to 2022.
A Bibliometrics Analysis of Australian Computing Education Conference Proceedings Open
The bib file includes the bib records of all research publications of Australasian Computing Education Conference prior to 2022.
View article: On the Parameterised Complexity of Induced Multipartite Graph Parameters
On the Parameterised Complexity of Induced Multipartite Graph Parameters Open
We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem: an instance is an induced multipartite graph parameter $p…
Separating sets of strings by finding matching patterns is almost always hard Open
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 notably in data mining, computational biology, and in underst…
Synergies in critical reflective practice and science: Science as reflection and reflection as science Open
The conceptions of reflective practice in education have their roots at least partly in the work of Dewey, who describes reflection as “the active, persistent, and careful consideration of any belief or supposed form of knowledge in the li…
Complete Balancing via Rotation Open
Trees are a fundamental structure in algorithmics. In this paper, we study the transformation of an arbitrary binary tree S with n vertices into a completely balanced tree T via rotations, a widely studied elementary tree operation. Combin…
Finding Patterns is Almost Always Hard. Open
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 notably in data mining, computational biology, and in underst…