Packing Edge Disjoint Triangles: A Parameterized View. - Luke Mathieson; Elena Prieto-Rodriguez; Peter Shaw 001 (IWPEC, 2004)

The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction. - Pablo Moscato; Luke Mathieson; Alexandre Mendes; Regina Berretta (ACSC, 2005)

The Parameterized Complexity of Regular Subgraph Problems and Generalizations. - Luke Mathieson; Stefan Szeider (CATS, 2008)

Parameterized Graph Editing with Chosen Vertex Degrees. - Luke Mathieson; Stefan Szeider (COCOA, 2008)

The parameterized complexity of degree constrained editing problems. - Luke Mathieson (2009)

The parameterized complexity of editing graphs for bounded degeneracy. - Luke Mathieson (Theor. Comput. Sci., 2010)

Clustering Nodes in Large-Scale Biological Networks Using External Memory Algorithms. - Ahmed Shamsul Arefin; Mario Inostroza-Ponta; Luke Mathieson; Regina Berretta; Pablo Moscato (ICA3PP (2), 2011)

On the Feasibility of Maintenance Algorithms in Dynamic Graphs - Arnaud Casteigts; Bernard Mans; Luke Mathieson (CoRR, 2011)

A Proof Checking View of Parameterized Complexity - Luke Mathieson (CoRR, 2012)

Editing graphs to satisfy degree constraints: A parameterized approach. - Luke Mathieson; Stefan Szeider (J. Comput. Syst. Sci., 2012)

Functional Graphs of Polynomials over Finite Fields. - Sergei Konyagin; Florian Luca; Bernard Mans; Luke Mathieson; Igor E. Shparlinski (CoRR, 2013)

On the treewidth of dynamic graphs. - Bernard Mans; Luke Mathieson (Theor. Comput. Sci., 2014)

Augmenting Graphs to Minimize the Diameter. - Fabrizio Frati; Serge Gaspers; Joachim Gudmundsson; Luke Mathieson (Algorithmica, 2015)

Relative Neighborhood Graphs Uncover the Dynamics of Social Media Engagement. - Natalie Jane de Vries; Ahmed Shamsul Arefin; Luke Mathieson; Benjamin Lucas; Pablo Moscato (ADMA, 2016)

Complete Balancing via Rotation. - Fabrizio Luccio; Bernard Mans; Luke Mathieson; Linda Pagli (Comput. J., 2016)

Finding Patterns is Almost Always Hard. - Giuseppe Lancia; Luke Mathieson; Pablo Moscato (CoRR, 2016)

Functional graphs of polynomials over finite fields. - Sergei V. Konyagin; Florian Luca; Bernard Mans; Luke Mathieson; Min Sha; Igor E. Shparlinski (J. Comb. Theory B, 2016)

A memetic algorithm for community detection by maximising the connected cohesion. - Mohammad Nazmul Haque; Luke Mathieson; Pablo Moscato (SSCI, 2017)

Incremental Problems in the Parameterized Complexity Setting. - Bernard Mans; Luke Mathieson (Theory Comput. Syst., 2017)

Separating sets of strings by finding matching patterns is almost always hard. - Giuseppe Lancia; Luke Mathieson; Pablo Moscato (Theor. Comput. Sci., 2017)

Graph editing problems with extended regularity constraints. - Luke Mathieson (Theor. Comput. Sci., 2017)

Syntax error based quantification of the learning progress of the novice programmer. - Alireza Ahadi; Raymond Lister; Luke Mathieson (ITiCSE, 2018)

Memetic Algorithms. - Carlos Cotta; Luke Mathieson; Pablo Moscato (Handbook of Heuristics, 2018)

An Introduction to Proximity Graphs. - Luke Mathieson; Pablo Moscato (Business and Consumer Analytics: New Ideas, 2019)

Using Network Alignment to Identify Conserved Consumer Behaviour Modelling Constructs. - Luke Mathieson; Natalie Jane de Vries; Pablo Moscato (Business and Consumer Analytics: New Ideas, 2019)

Memetic Algorithms for Business Analytics and Data Science: A Brief Survey. - Pablo Moscato; Luke Mathieson (Business and Consumer Analytics: New Ideas, 2019)

ArAl: An Online Tool for Source Code Snapshot Metadata Analysis. - Alireza Ahadi; Raymond Lister; Luke Mathieson (ACE, 2019)

A Comparison of Three Popular Source code Similarity Tools for Detecting Student Plagiarism. - Alireza Ahadi; Luke Mathieson (ACE, 2019)

A memetic algorithm approach to network alignment: mapping the classification of mental disorders of DSM-IV with ICD-10. - Mohammad Nazmul Haque; Luke Mathieson; Pablo Moscato (GECCO, 2019)

On the Evidence for a Learning Hierarchy in Data Structures Exams. - Thomas Pelchen; Luke Mathieson; Raymond Lister (ACE, 2020)

The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise. - Luke Mathieson; Pablo Moscato (SSCI, 2020)

On the Parameterised Complexity of Induced Multipartite Graph Parameters. - Ryan L. Mann; Luke Mathieson; Catherine S. Greenhill (CoRR, 2020)

An insight into network structure measures and number of driver nodes. - Abida Sadaf; Luke Mathieson; Katarzyna Musial (ASONAM, 2021)

Augmented intuition: a bridge between theory and practice. - Pablo Moscato; Luke Mathieson; Mohammad Nazmul Haque (J. Heuristics, 2021)

A Bibliometrics Analysis of Australasian Computing Education Conference Proceedings. - Alireza Ahadi; Luke Mathieson (ACE, 2022)

Maximising Influence Spread in Complex Networks by Utilising Community-Based Driver Nodes as Seeds. - Abida Sadaf; Luke Mathieson; Piotr Bródka; Katarzyna Musial (SIMBig, 2022)

Quantum Parameterized Complexity. - Michael J. Bremner; Zhengfeng Ji; Ryan L. Mann; Luke Mathieson; Mauro E. S. Morales; Alexis T. E. Shaw (CoRR, 2022)

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis. - Michael J. Bremner; Zhengfeng Ji; Xingjian Li 006; Luke Mathieson; Mauro E. S. Morales (CoRR, 2022)

Relational Expressions for Data Transformation and Computation. - David Robert Pratten; Luke Mathieson (ADC, 2023)

Better Understanding of Humans for Cooperative AI through Clustering. - Edward Su; William L. Raffe; Luke Mathieson; YuKai Wang (CoG, 2024)

A bridge between influence models and control methods. - Abida Sadaf; Luke Mathieson; Piotr Bródka; Katarzyna Musial (Appl. Netw. Sci., 2024)