default search action
Luke Mathieson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Abida Sadaf, Luke Mathieson, Piotr Bródka, Katarzyna Musial:
A bridge between influence models and control methods. Appl. Netw. Sci. 9(1): 38 (2024) - [c20]Edward Su, William L. Raffe, Luke Mathieson, YuKai Wang:
Better Understanding of Humans for Cooperative AI through Clustering. CoG 2024: 1-8 - 2023
- [c19]David Robert Pratten
, Luke Mathieson
Relational Expressions for Data Transformation and Computation. ADC 2023: 241-255 - [i12]David Robert Pratten, Luke Mathieson:
Relational Expressions for Data Transformation and Computation. CoRR abs/2309.11178 (2023) - 2022
- [c18]Alireza Ahadi, Luke Mathieson:
A Bibliometrics Analysis of Australasian Computing Education Conference Proceedings. ACE 2022: 1-9 - [c17]Abida Sadaf, Luke Mathieson, Piotr Bródka, Katarzyna Musial:
Maximising Influence Spread in Complex Networks by Utilising Community-Based Driver Nodes as Seeds. SIMBig 2022: 126-141 - [i11]Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann, Luke Mathieson, Mauro E. S. Morales, Alexis T. E. Shaw:
Quantum Parameterized Complexity. CoRR abs/2203.08002 (2022) - [i10]Michael J. Bremner, Zhengfeng Ji, Xingjian Li
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis. CoRR abs/2211.05325 (2022) - [i9]Abida Sadaf, Luke Mathieson, Piotr Bródka, Katarzyna Musial:
Maximising Influence Spread in Complex Networks by Utilising Community-based Driver Nodes as Seeds. CoRR abs/2212.11611 (2022) - 2021
- [j10]Pablo Moscato
Augmented intuition: a bridge between theory and practice. J. Heuristics 27(4): 497-547 (2021) - [c16]Abida Sadaf
An insight into network structure measures and number of driver nodes. ASONAM 2021: 471-478 - 2020
- [c15]Thomas Pelchen
On the Evidence for a Learning Hierarchy in Data Structures Exams. ACE 2020: 122-131 - [c14]Luke Mathieson, Pablo Moscato:
The Unexpected Virtue of Problem Reductions or How to Solve Problems Being Lazy but Wise. SSCI 2020: 2381-2390 - [i8]Ryan L. Mann
On the Parameterised Complexity of Induced Multipartite Graph Parameters. CoRR abs/2004.09938 (2020)
2010 – 2019
- 2019
- [c13]Alireza Ahadi
A Comparison of Three Popular Source code Similarity Tools for Detecting Student Plagiarism. ACE 2019: 112-117 - [c12]Alireza Ahadi
ArAl: An Online Tool for Source Code Snapshot Metadata Analysis. ACE 2019: 118-125 - [c11]Mohammad Nazmul Haque
A memetic algorithm approach to network alignment: mapping the classification of mental disorders of DSM-IV with ICD-10. GECCO 2019: 258-265 - [p3]Luke Mathieson, Pablo Moscato:
An Introduction to Proximity Graphs. Business and Consumer Analytics: New Ideas 2019: 213-233 - [p2]Luke Mathieson, Natalie Jane de Vries, Pablo Moscato:
Using Network Alignment to Identify Conserved Consumer Behaviour Modelling Constructs. Business and Consumer Analytics: New Ideas 2019: 513-541 - [p1]Pablo Moscato, Luke Mathieson:
Memetic Algorithms for Business Analytics and Data Science: A Brief Survey. Business and Consumer Analytics: New Ideas 2019: 545-608 - 2018
- [c10]Alireza Ahadi
Syntax error based quantification of the learning progress of the novice programmer. ITiCSE 2018: 10-14 - [r1]Carlos Cotta
Memetic Algorithms. Handbook of Heuristics 2018: 607-638 - 2017
- [j9]Bernard Mans
Incremental Problems in the Parameterized Complexity Setting. Theory Comput. Syst. 60(1): 3-19 (2017) - [j8]Giuseppe Lancia
Separating sets of strings by finding matching patterns is almost always hard. Theor. Comput. Sci. 665: 73-86 (2017) - [j7]Luke Mathieson
Graph editing problems with extended regularity constraints. Theor. Comput. Sci. 677: 56-68 (2017) - [c9]Mohammad Nazmul Haque
A memetic algorithm for community detection by maximising the connected cohesion. SSCI 2017: 1-8 - 2016
- [j6]Fabrizio Luccio, Bernard Mans
Complete Balancing via Rotation. Comput. J. 59(8): 1252-1263 (2016) - [j5]Sergei V. Konyagin, Florian Luca
Functional graphs of polynomials over finite fields. J. Comb. Theory B 116: 87-122 (2016) - [c8]Natalie Jane de Vries, Ahmed Shamsul Arefin, Luke Mathieson
Relative Neighborhood Graphs Uncover the Dynamics of Social Media Engagement. ADMA 2016: 283-297 - [i7]Giuseppe Lancia, Luke Mathieson, Pablo Moscato:
Finding Patterns is Almost Always Hard. CoRR abs/1604.03243 (2016) - 2015
- [j4]Fabrizio Frati
Augmenting Graphs to Minimize the Diameter. Algorithmica 72(4): 995-1010 (2015) - [i6]Luke Mathieson:
Graph Editing Problems with Extended Regularity Constraints. CoRR abs/1510.03482 (2015) - 2014
- [j3]Bernard Mans
On the treewidth of dynamic graphs. Theor. Comput. Sci. 554: 217-228 (2014) - 2013
- [c7]Bernard Mans
On the Treewidth of Dynamic Graphs. COCOON 2013: 349-360 - [c6]Fabrizio Frati
Augmenting Graphs to Minimize the Diameter. ISAAC 2013: 383-393 - [i5]Sergei Konyagin, Florian Luca, Bernard Mans, Luke Mathieson, Igor E. Shparlinski:
Functional Graphs of Polynomials over Finite Fields. CoRR abs/1307.2718 (2013) - [i4]Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson:
Augmenting graphs to minimize the diameter. CoRR abs/1309.5172 (2013) - 2012
- [j2]Luke Mathieson
Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci. 78(1): 179-191 (2012) - [i3]Luke Mathieson:
A Proof Checking View of Parameterized Complexity. CoRR abs/1206.2436 (2012) - 2011
- [c5]Ahmed Shamsul Arefin
Clustering Nodes in Large-Scale Biological Networks Using External Memory Algorithms. ICA3PP (2) 2011: 375-386 - [i2]Arnaud Casteigts, Bernard Mans, Luke Mathieson:
On the Feasibility of Maintenance Algorithms in Dynamic Graphs. CoRR abs/1107.2722 (2011) - [i1]Bernard Mans, Luke Mathieson:
On the Treewidth of Dynamic Graphs. CoRR abs/1112.2795 (2011) - 2010
- [j1]Luke Mathieson
The parameterized complexity of editing graphs for bounded degeneracy. Theor. Comput. Sci. 411(34-36): 3181-3187 (2010)
2000 – 2009
- 2009
- [b1]Luke Mathieson:
The parameterized complexity of degree constrained editing problems. Durham University, UK, 2009 - 2008
- [c4]Luke Mathieson, Stefan Szeider:
The Parameterized Complexity of Regular Subgraph Problems and Generalizations. CATS 2008: 79-86 - [c3]Luke Mathieson
Parameterized Graph Editing with Chosen Vertex Degrees. COCOA 2008: 13-22 - 2005
- [c2]Pablo Moscato, Luke Mathieson, Alexandre Mendes, Regina Berretta:
The Electronic Primaries: Predicting the U.S. Presidency Using Feature Selection with Safe Data Reduction. ACSC 2005: 371-380 - 2004
- [c1]Luke Mathieson
Packing Edge Disjoint Triangles: A Parameterized View. IWPEC 2004: 127-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: