Weak critical sets in cyclic Latin squares. - Matthew Johnson 002; David Bedford (Australas. J Comb., 2001)

Defining sets for Latin squares given that they are based on groups. - David Bedford; Matthew Johnson 002; Matthew A. Ollis (Eur. J. Comb., 2003)

Amalgamations of connected k-factorizations. - Anthony J. W. Hilton; Matthew Johnson 002; Christopher A. Rodger; Evan B. Wantland (J. Comb. Theory B, 2003)

An algorithm for finding factorizations of complete graphs. - Anthony J. W. Hilton; Matthew Johnson 002 (J. Graph Theory, 2003)

The External Network Problem with Edge- or Arc-Connectivity Requirements. - Jan van den Heuvel; Matthew Johnson 002 (CAAN, 2004)

Amalgamations of factorizations of complete equipartite graphs. - Anthony J. W. Hilton; Matthew Johnson 002 (Discret. Math., 2004)

Characterization of graphs with hall number 2. - Changiz Eslahchi; Matthew Johnson 002 (J. Graph Theory, 2004)

Cycle decompositions of the complete graph. - Anthony J. W. Hilton; Matthew Johnson 002 (Ars Comb., 2006)

Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. - Paul S. Bonsma; Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Electron. Notes Discret. Math., 2007)

Amalgamations of factorizations of complete graphs. - Matthew Johnson 002 (J. Comb. Theory B, 2007)

Finding Paths Between 3-Colourings. - Matthew Johnson 002; Luis Cereceda; Jan van den Heuvel (IWOCA, 2008)

Connectedness of the graph of vertex-colourings. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Discret. Math., 2008)

Preface. - Hajo Broersma; Stefan S. Dantchev; Matthew Johnson 002; Stefan Szeider (J. Discrete Algorithms, 2008)

Transversals of subtree hypergraphs and the source location problem in digraphs. - Jan van den Heuvel; Matthew Johnson 002 (Networks, 2008)

The computational complexity of the parallel knock-out problem. - Hajo Broersma; Matthew Johnson 002; Daniël Paulusma; Iain A. Stewart (Theor. Comput. Sci., 2008)

Mixing 3-colourings in bipartite graphs. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (Eur. J. Comb., 2009)

Upper bounds and algorithms for parallel knock-out numbers. - Hajo Broersma; Matthew Johnson 002; Daniël Paulusma (Theor. Comput. Sci., 2009)

Path factors and parallel knock-out schemes of almost claw-free graphs. - Matthew Johnson 002; Daniël Paulusma; Chantal Wood (Discret. Math., 2010)

Editorial. - Hajo Broersma; Stefan S. Dantchev; Matthew Johnson 002; Stefan Szeider (J. Discrete Algorithms, 2010)

On the diameter of reconfiguration graphs for vertex colourings. - Marthe Bonamy; Matthew Johnson 002; Ioannis Lignos; Viresh Patel; Daniël Paulusma (Electron. Notes Discret. Math., 2011)

Finding paths between 3-colorings. - Luis Cereceda; Jan van den Heuvel; Matthew Johnson 002 (J. Graph Theory, 2011)

Editorial. - Iain A. Stewart; Daniël Paulusma; Matthew Johnson 002 (J. Discrete Algorithms, 2012)

Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. - Matthew Johnson 002; Daniël Paulusma; Erik Jan van Leeuwen (ISAAC, 2013)

Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. - Shenwei Huang; Matthew Johnson 002; Daniël Paulusma (AAIM, 2014)

A Reconfigurations Analogue of Brooks' Theorem. - Carl Feghali; Matthew Johnson 002; Daniël Paulusma (MFCS (2), 2014)

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

Colouring Reconfiguration Is Fixed-Parameter Tractable. - Matthew Johnson 002; Dieter Kratsch; Stefan Kratsch; Viresh Patel; Daniël Paulusma (CoRR, 2014)

A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. - Petr A. Golovach; Matthew Johnson 002; Daniël Paulusma; Jian Song 005 (CoRR, 2014)

Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. - Shenwei Huang; Matthew Johnson 002; Daniël Paulusma (CoRR, 2014)

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. - Marthe Bonamy; Matthew Johnson 002; Ioannis Lignos; Viresh Patel; Daniël Paulusma (J. Comb. Optim., 2014)

Obtaining Online Ecological Colourings by Generalizing First-Fit. - Matthew Johnson 002; Viresh Patel; Daniël Paulusma; Théophile Trunck (Theory Comput. Syst., 2014)

A Multi-level Hypergraph Partitioning Algorithm Using Rough Set Clustering. - Foad Lotfifar; Matthew Johnson 002 (Euro-Par, 2015)

Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs. - Shenwei Huang; Matthew Johnson 002; Daniël Paulusma (Comput. J., 2015)

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

Kempe Equivalence of Colourings of Cubic Graphs. - Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Electron. Notes Discret. Math., 2015)

Algorithms for diversity and clustering in social networks through dot product graphs. - Matthew Johnson 002; Daniël Paulusma; Erik Jan van Leeuwen (Soc. Networks, 2015)

Finding Shortest Paths Between Graph Colourings. - Matthew Johnson 002; Dieter Kratsch; Stefan Kratsch; Viresh Patel; Daniël Paulusma (Algorithmica, 2016)

Smart Grid-aware scheduling in data centres. - Markus Mäsker; Lars Nagel 001; André Brinkmann; Foad Lotfifar; Matthew Johnson 002 (Comput. Commun., 2016)

Colouring on Hereditary Graph Classes Closed under Complementation. - Alexandre Blanché; Konrad Kazimierz Dabrowski; Matthew Johnson 002; Daniël Paulusma (CoRR, 2016)

A Serial Multilevel Hypergraph Partitioning Algorithm. - Foad Lotfifar; Matthew Johnson 002 (CoRR, 2016)

The price of connectivity for cycle transversals. - Tatiana Romina Hartinger; Matthew Johnson 002; Martin Milanic; Daniël Paulusma (Eur. J. Comb., 2016)

A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. - Carl Feghali; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2016)

Independent Feedback Vertex Set for P_5-free Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (ISAAC, 2017)

Recognizing Graphs Close to Bipartite Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (MFCS, 2017)

Connected Vertex Cover for (sP1+P5)-Free Graphs. - Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (CoRR, 2017)

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. - Petr A. Golovach; Matthew Johnson 002; Daniël Paulusma; Jian Song 005 (J. Graph Theory, 2017)

Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. - Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (WG, 2018)

Erdős-Ko-Rado theorems for a family of trees. - Carl Feghali; Matthew Johnson 002; Daniel Thomas (Discret. Appl. Math., 2018)

Independent feedback vertex sets for graphs of bounded diameter. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Inf. Process. Lett., 2018)

Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. - Nina Chiarelli; Tatiana Romina Hartinger; Matthew Johnson 002; Martin Milanic; Daniël Paulusma (Theor. Comput. Sci., 2018)

Clique-width for hereditary graph classes. - Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma (BCC, 2019)

Finding a Small Number of Colourful Components. - Laurent Bulteau; Konrad K. Dabrowski; Guillaume Fertin; Matthew Johnson 002; Daniël Paulusma; Stéphane Vialette (CPM, 2019)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (FCT, 2019)

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. - Marthe Bonamy; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma (WADS, 2019)

Independent Feedback Vertex Set for P5-Free Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Algorithmica, 2019)

Surjective H-colouring: New hardness results. - Petr A. Golovach; Matthew Johnson 002; Barnaby Martin; Daniël Paulusma; Anthony Stewart (Comput., 2019)

Report on BCTCS & AlgoUK 2019. - Matthew Johnson 002; Barnaby Martin; George B. Mertzios; Daniël Paulusma (Bull. EATCS, 2019)

On a conjecture of Mohar concerning Kempe equivalence of regular graphs. - Marthe Bonamy; Nicolas Bousquet 001; Carl Feghali; Matthew Johnson 002 (J. Comb. Theory B, 2019)

Hereditary graph classes: When the complexities of coloring and clique cover coincide. - Alexandre Blanché; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2019)

Filling the complexity gaps for colouring planar and bounded degree graphs. - Konrad K. Dabrowski; François Dross; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2019)

Steiner Trees for Hereditary Graph Classes. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (LATIN, 2020)

Computing Subset Transversals in H-Free Graphs. - Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (WG, 2020)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (Algorithmica, 2020)

Connected Vertex Cover for (sP1+P5)-Free Graphs. - Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (Algorithmica, 2020)

Clique-Width for Graph Classes Closed under Complementation. - Alexandre Blanché; Konrad K. Dabrowski; Matthew Johnson 002; Vadim V. Lozin; Daniël Paulusma; Viktor Zamaraev (SIAM J. Discret. Math., 2020)

Preface. - Konrad K. Dabrowski; Maximilien Gadouleau; Nicholas Georgiou; Matthew Johnson 002; George B. Mertzios; Daniël Paulusma (BCC, 2021)

Computing Weighted Subset Transversals in H-Free Graphs. - Nick Brettell; Matthew Johnson 002; Daniël Paulusma (WADS, 2021)

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy. - Marthe Bonamy; Nicolas Bousquet 001; Konrad K. Dabrowski; Matthew Johnson 002; Daniël Paulusma; Théo Pierron (Algorithmica, 2021)

What Graphs are 2-Dot Product Graphs? - Matthew Johnson 002; Daniël Paulusma; Erik Jan van Leeuwen (Int. J. Comput. Geom. Appl., 2021)

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2021)

Steiner trees for hereditary graph classes: A treewidth perspective. - Hans L. Bodlaender; Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Erik Jan van Leeuwen (Theor. Comput. Sci., 2021)

Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. - Matthew Johnson 002; Barnaby Martin; Siani Smith; Sukanya Pandey; Daniël Paulusma; Erik Jan van Leeuwen (CoRR, 2022)

Complexity Framework For Forbidden Subgraphs. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (CoRR, 2022)

Computing Weighted Subset Odd Cycle Transversals in H-free graphs. - Nick Brettell; Matthew Johnson 002; Daniël Paulusma (J. Comput. Syst. Sci., 2022)

Computing subset transversals in H-free graphs. - Nick Brettell; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (Theor. Comput. Sci., 2022)

Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (MFCS, 2023)

The Complexity of Matching Games: A Survey. - Márton Benedek; Péter Biró 001; Matthew Johnson 002; Daniël Paulusma; Xin Ye (J. Artif. Intell. Res., 2023)

Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. - Márton Benedek; Péter Biró 001; Gergely Csáji; Matthew Johnson 002; Daniël Paulusma; Xin Ye (AAMAS, 2024)

Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. - Matthew Johnson 002; Barnaby Martin; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (SWAT, 2024)

On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. - Konrad K. Dabrowski; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Viktor Zamaraev (Eur. J. Comb., 2024)

Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. - Hans L. Bodlaender; Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (J. Comput. Syst. Sci., 2025)

Complexity Framework for Forbidden Subgraphs I: The Framework. - Matthew Johnson 002; Barnaby Martin; Jelle J. Oostveen; Sukanya Pandey; Daniël Paulusma; Siani Smith; Erik Jan van Leeuwen (Algorithmica, 2025)

Finding d-Cuts in Probe H-Free Graphs. - Konrad K. Dabrowski; Tala Eagling-Vose; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (CoRR, 2025)