| Finding cactus roots in polynomial time PA Golovach, D Kratsch, D Paulusma, A Stewart International Workshop on Combinatorial Algorithms, 361-372, 2016 | 11 | 2016 |
| 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 | 10 | 2017 |
| Surjective H-colouring: New hardness results PA Golovach, M Johnson, B Martin, D Paulusma, A Stewart Computability 8 (1), 27-42, 2019 | 7 | 2019 |
| Squares of low clique number P Golovach, D Kratsch, D Paulusma, A Stewart Electronic Notes in Discrete Mathematics 55, 195-198, 2016 | 7 | 2016 |
| 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 | 4 | 2018 |
| Surjective H-Colouring: New Hardness Results PA Golovach, M Johnson, B Martin, D Paulusma, A Stewart Conference on Computability in Europe, 270-281, 2017 | 4 | 2017 |
| Minimal disconnected cuts in planar graphs M Kamiński, D Paulusma, A Stewart, DM Thilikos Networks 68 (4), 250-259, 2016 | 4 | 2016 |
| Knocking Out P k -free Graphs M Johnson, D Paulusma, A Stewart Mathematical Foundations of Computer Science 2014: 39th International …, 2014 | 2 | 2014 |
| Squares of low maximum degree M Cochefert, JF Couturier, PA Golovach, D Kratsch, D Paulusma, ... arXiv preprint arXiv:1608.06142, 2016 | 1 | 2016 |
| Graph Algorithms and Complexity Aspects on Special Graph Classes A Stewart Durham University, 2017 | | 2017 |
