Anthony Stewart

According to our database, Anthony Stewart authored at least 9 papers between 2014 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2019

Surjective H-colouring: New hardness results.

Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart

Comput., 2019

2018

Finding Cactus Roots in Polynomial Time.

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Theory Comput. Syst., 2018

Computing square roots of graphs with low maximum degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Discret. Appl. Math., 2018

2017

A linear kernel for finding square roots of almost planar graphs.

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Theor. Comput. Sci., 2017

2016

Minimal disconnected cuts in planar graphs.

Marcin Kaminski, Daniël Paulusma, Anthony Stewart, Dimitrios M. Thilikos

Networks, 2016

Squares of Low Clique Number.

Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

Electron. Notes Discret. Math., 2016

Squares of Low Maximum Degree.

Manfred Cochefert, Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart

CoRR, 2016

2015

Knocking out _P_k-free graphs.

Matthew Johnson, Daniël Paulusma, Anthony Stewart

Discret. Appl. Math., 2015

2014

Knocking Out P k -free Graphs.

Matthew Johnson, Daniël Paulusma, Anthony Stewart

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014