Luke Mathieson

According to our database1, Luke Mathieson authored at least 32 papers between 2004 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



On the Parameterised Complexity of Induced Multipartite Graph Parameters.
CoRR, 2020

The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise.
Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence, 2020

On the Evidence for a Learning Hierarchy in Data Structures Exams.
Proceedings of the ACE 2020, 2020

A memetic algorithm approach to network alignment: mapping the classification of mental disorders of DSM-IV with ICD-10.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

A Comparison of Three Popular Source code Similarity Tools for Detecting Student Plagiarism.
Proceedings of the Twenty-First Australasian Computing Education Conference, 2019

ArAl: An Online Tool for Source Code Snapshot Metadata Analysis.
Proceedings of the Twenty-First Australasian Computing Education Conference, 2019

Memetic Algorithms for Business Analytics and Data Science: A Brief Survey.
Proceedings of the Business and Consumer Analytics: New Ideas, 2019

Using Network Alignment to Identify Conserved Consumer Behaviour Modelling Constructs.
Proceedings of the Business and Consumer Analytics: New Ideas, 2019

An Introduction to Proximity Graphs.
Proceedings of the Business and Consumer Analytics: New Ideas, 2019

Memetic Algorithms.
Proceedings of the Handbook of Heuristics., 2018

Syntax error based quantification of the learning progress of the novice programmer.
Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science Education, 2018

Graph editing problems with extended regularity constraints.
Theor. Comput. Sci., 2017

Separating sets of strings by finding matching patterns is almost always hard.
Theor. Comput. Sci., 2017

Incremental Problems in the Parameterized Complexity Setting.
Theory Comput. Syst., 2017

A memetic algorithm for community detection by maximising the connected cohesion.
Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

Functional graphs of polynomials over finite fields.
J. Comb. Theory, Ser. B, 2016

Finding Patterns is Almost Always Hard.
CoRR, 2016

Complete Balancing via Rotation.
Comput. J., 2016

Relative Neighborhood Graphs Uncover the Dynamics of Social Media Engagement.
Proceedings of the Advanced Data Mining and Applications - 12th International Conference, 2016

Augmenting Graphs to Minimize the Diameter.
Algorithmica, 2015

On the treewidth of dynamic graphs.
Theor. Comput. Sci., 2014

Functional Graphs of Polynomials over Finite Fields.
CoRR, 2013

Editing graphs to satisfy degree constraints: A parameterized approach.
J. Comput. Syst. Sci., 2012

A Proof Checking View of Parameterized Complexity
CoRR, 2012

On the Feasibility of Maintenance Algorithms in Dynamic Graphs
CoRR, 2011

Clustering Nodes in Large-Scale Biological Networks Using External Memory Algorithms.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2011

The parameterized complexity of editing graphs for bounded degeneracy.
Theor. Comput. Sci., 2010

The parameterized complexity of degree constrained editing problems.
PhD thesis, 2009

Parameterized Graph Editing with Chosen Vertex Degrees.
Proceedings of the Combinatorial Optimization and Applications, 2008

The Parameterized Complexity of Regular Subgraph Problems and Generalizations.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction.
Proceedings of the Computer Science 2005, 2005

Packing Edge Disjoint Triangles: A Parameterized View.
Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004