I agree that this site is using cookies. You can find further informations here.
X
Mathieson, Luke
24  results:
OpenAccess-fulltext X
Search for persons X
?
1

Relational Expressions for Data Transformation and Computat..:

Pratten, David Robert ; Mathieson, Luke
http://arxiv.org/abs/2309.11178.  , 2023
Link: http://arxiv.org/abs/230..
 
?
2

Parameterized Complexity of Weighted Local Hamiltonian Prob..:

Bremner, Michael J ; Ji, Zhengfeng ; Li, Xingjian..
http://arxiv.org/abs/2211.05325.  , 2022
Link: http://arxiv.org/abs/221..
 
?
3

Maximising Influence Spread in Complex Networks by Utilisin..:

Sadaf, Abida ; Mathieson, Luke ; Bródka, Piotr.
http://arxiv.org/abs/2212.11611.  , 2022
Link: http://arxiv.org/abs/221..
 
?
4

Quantum Parameterized Complexity:

Bremner, Michael J ; Ji, Zhengfeng ; Mann, Ryan L...
http://arxiv.org/abs/2203.08002.  , 2022
Link: http://arxiv.org/abs/220..
 
?
5

On the Parameterised Complexity of Induced Multipartite Gra..:

Mann, Ryan L ; Mathieson, Luke ; Greenhill, Catherine
http://arxiv.org/abs/2004.09938.  , 2020
Link: http://arxiv.org/abs/200..
 
?
6

Separating sets of strings by finding matching patterns is ..:

Lancia, Giuseppe ; Mathieson, Luke ; Moscato, Pablo
info:eu-repo/semantics/altIdentifier/wos/WOS:000398015500005.  , 2017
Link: http://hdl.handle.net/11..
 
?
7

Synergies in critical reflective practice and science: Scie..:

Mathieson, Luke
https://ro.uow.edu.au/jutlp/vol13/iss2/4.  , 2016
Link: https://ro.uow.edu.au/ju..
 
?
8

Separating Sets of Strings by Finding Matching Patterns is ..:

Lancia, Giuseppe ; Mathieson, Luke ; Moscato, Pablo
http://arxiv.org/abs/1604.03243.  , 2016
Link: http://arxiv.org/abs/160..
 
?
9

Graph Editing Problems with Extended Regularity Constraints:

Mathieson, Luke
http://arxiv.org/abs/1510.03482.  , 2015
Link: http://arxiv.org/abs/151..
 
?
10

Augmenting Graphs to Minimize the Diameter:

FRATI, FABRIZIO ; Gaspers, Serge ; Gudmundsson, Joachim.
info:eu-repo/semantics/altIdentifier/wos/WOS:000356461400005.  , 2015
Link: http://hdl.handle.net/11..
 
?
11

On the treewidth of dynamic graphs:

Mans, Bernard ; Mathieson, Luke
Mans , B & Mathieson , L 2014 , ' On the treewidth of dynamic graphs ' , Theoretical Computer Science , vol. 554 , pp. 217-228 . https://doi.org/10.1016/j.tcs.2013.12.024.  , 2014
Link: https://researchers.mq.e..
 
?
12

Functional Graphs of Polynomials over Finite Fields:

Konyagin, Sergei V ; Luca, Florian ; Mans, Bernard...
http://arxiv.org/abs/1307.2718.  , 2013
Link: http://arxiv.org/abs/130..
 
?
13

Augmenting graphs to minimize the diameter:

Frati, Fabrizio ; Gaspers, Serge ; Gudmundsson, Joachim.
http://arxiv.org/abs/1309.5172.  , 2013
Link: http://arxiv.org/abs/130..
 
?
14

A Proof Checking View of Parameterized Complexity:

Mathieson, Luke
http://arxiv.org/abs/1206.2436.  , 2012
Link: http://arxiv.org/abs/120..
 
?
15

On the Treewidth of Dynamic Graphs:

Mans, Bernard ; Mathieson, Luke
http://arxiv.org/abs/1112.2795.  , 2011
Link: http://arxiv.org/abs/111..
 
1-15