Suivre
Anthony Stewart
Anthony Stewart
PhD Student, Durham University
Adresse e-mail validée de durham.ac.uk - Page d'accueil
Titre
Citée par
Citée par
Année
Finding cactus roots in polynomial time
PA Golovach, D Kratsch, D Paulusma, A Stewart
International Workshop on Combinatorial Algorithms, 361-372, 2016
122016
Squares of low clique number
P Golovach, D Kratsch, D Paulusma, A Stewart
Electronic Notes in Discrete Mathematics 55, 195-198, 2016
82016
A linear kernel for finding square roots of almost planar graphs
PA Golovach, D Kratsch, D Paulusma, A Stewart
arXiv preprint arXiv:1608.06136, 2016
82016
Surjective H-colouring: New hardness results
PA Golovach, M Johnson, B Martin, D Paulusma, A Stewart
Computability 8 (1), 27-42, 2019
62019
Computing square roots of graphs with low maximum degree
M Cochefert, JF Couturier, PA Golovach, D Kratsch, D Paulusma, ...
Discrete Applied Mathematics 248, 93-101, 2018
52018
A linear kernel for finding square roots of almost planar graphs
PA Golovach, D Kratsch, D Paulusma, A Stewart
Theoretical Computer Science 689, 36-47, 2017
52017
Minimal disconnected cuts in planar graphs
M Kamiński, D Paulusma, A Stewart, DM Thilikos
Networks 68 (4), 250-259, 2016
52016
Surjective H-Colouring: New Hardness Results
PA Golovach, M Johnson, B Martin, D Paulusma, A Stewart
Conference on Computability in Europe, 270-281, 2017
42017
Squares of low maximum degree
M Cochefert, JF Couturier, PA Golovach, D Kratsch, D Paulusma, ...
arXiv preprint arXiv:1608.06142, 2016
22016
Knocking Out Pk-free Graphs
M Johnson, D Paulusma, A Stewart
International Symposium on Mathematical Foundations of Computer Science, 396-407, 2014
12014
Graph Algorithms and Complexity Aspects on Special Graph Classes
A STEWART
Durham University, 2017
2017
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–11