×

zbMATH — the first resource for mathematics

Stewart, Anthony

Compute Distance To:
Author ID: stewart.anthony Recent zbMATH articles by "Stewart, Anthony"
Published as: Stewart, A.; Stewart, Anthony
Documents Indexed: 16 Publications since 1990

Publications by Year

Citations contained in zbMATH

11 Publications have been cited 27 times in 13 Documents Cited by Year
A linear kernel for finding square roots of almost planar graphs. Zbl 1372.05052
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2017
A linear kernel for finding square roots of almost planar graphs. Zbl 1378.68077
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Squares of low clique number. Zbl 1356.05102
Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Finding cactus roots in polynomial time. Zbl 1391.68051
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Computing square roots of graphs with low maximum degree. Zbl 1395.05083
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
3
2018
Finding cactus roots in polynomial time. Zbl 1391.68052
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
2
2018
Reasoning about data-parallel array assignment. Zbl 0833.68027
Stewart, A.
2
1995
Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony
1
2019
Minimal disconnected cuts in planar graphs. Zbl 1434.68362
Kamiński, Marcin; Paulusma, Daniël; Stewart, Anthony; Thilikos, Dimitrios M.
1
2016
Knocking out \(P _{k }\)-free graphs. Zbl 1426.68125
Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony
1
2014
A parallel multigrid FAS scheme for transputer networks. Zbl 0716.65103
Stewart, A.; Shaw, G. J.
1
1990
Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055
Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony
1
2019
Computing square roots of graphs with low maximum degree. Zbl 1395.05083
Cochefert, Manfred; Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
3
2018
Finding cactus roots in polynomial time. Zbl 1391.68052
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
2
2018
A linear kernel for finding square roots of almost planar graphs. Zbl 1372.05052
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2017
A linear kernel for finding square roots of almost planar graphs. Zbl 1378.68077
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Squares of low clique number. Zbl 1356.05102
Golovach, Petr; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Finding cactus roots in polynomial time. Zbl 1391.68051
Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël; Stewart, Anthony
4
2016
Minimal disconnected cuts in planar graphs. Zbl 1434.68362
Kamiński, Marcin; Paulusma, Daniël; Stewart, Anthony; Thilikos, Dimitrios M.
1
2016
Knocking out \(P _{k }\)-free graphs. Zbl 1426.68125
Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony
1
2014
Reasoning about data-parallel array assignment. Zbl 0833.68027
Stewart, A.
2
1995
A parallel multigrid FAS scheme for transputer networks. Zbl 0716.65103
Stewart, A.; Shaw, G. J.
1
1990

Citations by Year