Knocking Out P k -free Graphs. - Matthew Johnson 002; Daniël Paulusma; Anthony Stewart (MFCS (2), 2014)

Minimal Disconnected Cuts in Planar Graphs. - Marcin Kaminski 001; Daniël Paulusma; Anthony Stewart; Dimitrios M. Thilikos (FCT, 2015)

Knocking out Pk-free graphs. - Matthew Johnson 002; Daniël Paulusma; Anthony Stewart (Discret. Appl. Math., 2015)

Finding Cactus Roots in Polynomial Time. - Petr A. Golovach; Dieter Kratsch; Daniël Paulusma; Anthony Stewart (IWOCA, 2016)

A Linear Kernel for Finding Square Roots of Almost Planar Graphs. - Petr A. Golovach; Dieter Kratsch; Daniël Paulusma; Anthony Stewart (SWAT, 2016)

Squares of Low Maximum Degree. - Manfred Cochefert; Jean-François Couturier 001; Petr A. Golovach; Dieter Kratsch; Daniël Paulusma; Anthony Stewart (CoRR, 2016)

Squares of Low Clique Number. - Petr A. Golovach; Dieter Kratsch; Daniël Paulusma; Anthony Stewart (Electron. Notes Discret. Math., 2016)

Surjective H-Colouring: New Hardness Results. - Petr A. Golovach; Matthew Johnson 002; Barnaby Martin; Daniël Paulusma; Anthony Stewart (CiE, 2017)

Computing square roots of graphs with low maximum degree. - Manfred Cochefert; Jean-François Couturier 001; Petr A. Golovach; Dieter Kratsch; Daniël Paulusma; Anthony Stewart (Discret. Appl. Math., 2018)