Matthew Johnson

126 papers A 1B 18C 6Misc 1Journal 88Unranked 9

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Complexity Framework for Forbidden Subgraphs I: The Framework. Algorithmica Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	J	`jnl`	Complexity framework for forbidden subgraphs IV: The Steiner Forest problem. J. Comput. Syst. Sci. Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2025	J	`jnl`	Finding CoRR Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2025	B	`conf`	Finding d-Cuts in Probe H-Free Graphs. FCT Konrad K. Dabrowski, Tala Eagling-Vose, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2024	C	`conf`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. IWOCA Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	A	`conf`	Computing Balanced Solutions for Large International Kidney Exchange Schemes when Cycle Length is Unbounded. AAMAS Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
2024	—	`conf`	Edge Multiway Cut and Node Multiway Cut Are Hard for Planar Subcubic Graphs. SWAT Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2024	J	`jnl`	On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Eur. J. Comb. Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2023	B	`conf`	Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs. CoRR Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem. CoRR Hans L. Bodlaender, Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2023	J	`jnl`	Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded. CoRR Márton Benedek, Péter Biró, Gergely Csáji, Matthew Johnson, Daniël Paulusma, Xin Ye
2023	J	`jnl`	The Complexity of Matching Games: A Survey. J. Artif. Intell. Res. Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye
2022	J	`jnl`	Complexity Framework For Forbidden Subgraphs. CoRR Matthew Johnson, Barnaby Martin, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen
2022	J	`jnl`	Computing Weighted Subset Odd Cycle Transversals in J. Comput. Syst. Sci. Nick Brettell, Matthew Johnson, Daniël Paulusma
2022	J	`jnl`	Computing subset transversals in Theor. Comput. Sci. Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2022	J	`jnl`	Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs. CoRR Matthew Johnson, Barnaby Martin, Siani Smith, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen
2022	J	`jnl`	The Complexity of Matching Games: A Survey. CoRR Márton Benedek, Péter Biró, Matthew Johnson, Daniël Paulusma, Xin Ye
2021	B	`conf`	Computing Weighted Subset Transversals in H-Free Graphs. WADS Nick Brettell, Matthew Johnson, Daniël Paulusma
2021	J	`jnl`	Graph Isomorphism for (H Algorithmica Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
2021	—	`conf`	Preface. BCC Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
2021	J	`jnl`	Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2021	J	`jnl`	Steiner trees for hereditary graph classes: A treewidth perspective. Theor. Comput. Sci. Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2021	—	`ed.`	Surveys in Combinatorics, 2021: Invited lectures from the 28th British Combinatorial Conference, Durham, UK, July 5-9, 2021. BCC Konrad K. Dabrowski, Maximilien Gadouleau, Nicholas Georgiou, Matthew Johnson, George B. Mertzios, Daniël Paulusma
2021	J	`jnl`	What Graphs are 2-Dot Product Graphs? Int. J. Comput. Geom. Appl. Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Clique-Width for Graph Classes Closed under Complementation. SIAM J. Discret. Math. Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
2020	B	`conf`	Computing Subset Transversals in H-Free Graphs. WG Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020	J	`jnl`	Computing Subset Transversals in H-Free Graphs. CoRR Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020	J	`jnl`	Computing Weighted Subset Transversals in H-Free Graphs. CoRR Nick Brettell, Matthew Johnson, Daniël Paulusma
2020	J	`jnl`	Connected Vertex Cover for (sP Algorithmica Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2020	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2020	B	`conf`	Steiner Trees for Hereditary Graph Classes. LATIN Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2020	J	`jnl`	Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. CoRR Hans L. Bodlaender, Nick Brettell, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Erik Jan van Leeuwen
2019	J	`jnl`	Clique-Width for Hereditary Graph Classes. CoRR Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	—	`conf`	Clique-width for hereditary graph classes. BCC Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	J	`jnl`	Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2019	B	`conf`	Finding a Small Number of Colourful Components. CPM Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2019	B	`conf`	Graph Isomorphism for (H WADS Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	J	`jnl`	Hereditary graph classes: When the complexities of coloring and clique cover coincide. J. Graph Theory Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2019	J	`jnl`	Independent Feedback Vertex Set for P Algorithmica Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2019	B	`conf`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2019	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2019	J	`jnl`	On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
2019	J	`jnl`	On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. CoRR Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2019	J	`jnl`	Report on BCTCS & AlgoUK 2019. Bull. EATCS Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma
2019	J	`jnl`	Surjective H-colouring: New hardness results. Comput. Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2018	B	`conf`	Connected Vertex Cover for (sP_1+P_5) ( s P 1 + P 5 ) -Free Graphs. WG Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2018	J	`jnl`	Erdős-Ko-Rado theorems for a family of trees. Discret. Appl. Math. Carl Feghali, Matthew Johnson, Daniel Thomas
2018	J	`jnl`	Finding a Small Number of Colourful Components. CoRR Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette
2018	J	`jnl`	Graph Isomorphism for (H CoRR Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
2018	J	`jnl`	Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2018	J	`jnl`	Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2018	B	`conf`	On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal. MFCS Konrad K. Dabrowski, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Viktor Zamaraev
2017	J	`jnl`	A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2017	B	`conf`	Clique-Width for Graph Classes Closed under Complementation. MFCS Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Viktor Zamaraev
2017	J	`jnl`	Clique-Width for Graph Classes Closed under Complementation. CoRR Alexandre Blanché, Konrad K. Dabrowski, Matthew Johnson, Vadim V. Lozin, Daniël Paulusma, Victor Zamaraev
2017	J	`jnl`	Connected Vertex Cover for (sP CoRR Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2017	J	`jnl`	Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Independent Feedback Vertex Set for P_5-free Graphs. ISAAC Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2017	J	`jnl`	Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Recognizing Graphs Close to Bipartite Graphs. MFCS Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	C	`conf`	Surjective H-Colouring: New Hardness Results. CiE Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2017	J	`jnl`	Surjective H-Colouring: New Hardness Results. CoRR Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart
2016	J	`jnl`	A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory Carl Feghali, Matthew Johnson, Daniël Paulusma
2016	J	`jnl`	A Serial Multilevel Hypergraph Partitioning Algorithm. CoRR Foad Lotfifar, Matthew Johnson
2016	J	`jnl`	Colouring on Hereditary Graph Classes Closed under Complementation. CoRR Alexandre Blanché, Konrad Kazimierz Dabrowski, Matthew Johnson, Daniël Paulusma
2016	J	`jnl`	Finding Shortest Paths Between Graph Colourings. Algorithmica Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2016	J	`jnl`	Smart Grid-aware scheduling in data centres. Comput. Commun. Markus Mäsker, Lars Nagel, André Brinkmann, Foad Lotfifar, Matthew Johnson
2016	J	`jnl`	The price of connectivity for cycle transversals. Eur. J. Comb. Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2015	—	`conf`	A Multi-level Hypergraph Partitioning Algorithm Using Rough Set Clustering. Euro-Par Foad Lotfifar, Matthew Johnson
2015	J	`jnl`	A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Algorithms for diversity and clustering in social networks through dot product graphs. Soc. Networks Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2015	C	`conf`	Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. CoRR Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Kempe Equivalence of Colourings of Cubic Graphs. CoRR Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Knocking out Discret. Appl. Math. Matthew Johnson, Daniël Paulusma, Anthony Stewart
2015	J	`jnl`	Narrowing the Complexity Gap for Colouring ( Comput. J. Shenwei Huang, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
2015	—	`conf`	Smart grid-aware scheduling in data centres. SustainIT Markus Mäsker, Lars Nagel, André Brinkmann, Foad Lotfifar, Matthew Johnson
2015	—	`conf`	The Price of Connectivity for Cycle Transversals. MFCS (2) Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma
2015	J	`jnl`	What Graphs are 2-Dot Product Graphs? CoRR Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2015	J	`jnl`	What Graphs are 2-Dot Product Graphs? Electron. Notes Discret. Math. Matthew Johnson, Erik Jan van Leeuwen, Daniël Paulusma
2014	—	`conf`	A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) Carl Feghali, Matthew Johnson, Daniël Paulusma
2014	J	`jnl`	A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
2014	J	`jnl`	Colouring Reconfiguration Is Fixed-Parameter Tractable. CoRR Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	B	`conf`	Finding Shortest Paths Between Graph Colourings. IPEC Matthew Johnson, Dieter Kratsch, Stefan Kratsch, Viresh Patel, Daniël Paulusma
2014	—	`conf`	Knocking Out P k -free Graphs. MFCS (2) Matthew Johnson, Daniël Paulusma, Anthony Stewart
2014	J	`jnl`	Narrowing the Complexity Gap for Colouring ($C_s$, $P_t$)-Free Graphs. CoRR Shenwei Huang, Matthew Johnson, Daniël Paulusma
2014	C	`conf`	Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs. AAIM Shenwei Huang, Matthew Johnson, Daniël Paulusma
2014	J	`jnl`	Obtaining Online Ecological Colourings by Generalizing First-Fit. Theory Comput. Syst. Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
2014	J	`jnl`	Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
2013	B	`conf`	Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. ISAAC Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen
2012	J	`jnl`	Editorial. J. Discrete Algorithms Iain A. Stewart, Daniël Paulusma, Matthew Johnson
2011	J	`jnl`	Finding paths between 3-colorings. J. Graph Theory Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2011	J	`jnl`	On the diameter of reconfiguration graphs for vertex colourings. Electron. Notes Discret. Math. Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma
2010	J	`jnl`	Editorial. J. Discrete Algorithms Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2010	Misc	`conf`	Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck
2010	J	`jnl`	Path factors and parallel knock-out schemes of almost claw-free graphs. Discret. Math. Matthew Johnson, Daniël Paulusma, Chantal Wood
2009	J	`jnl`	Editorial. J. Discrete Algorithms Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2009	J	`jnl`	Mixing 3-colourings in bipartite graphs. Eur. J. Comb. Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2009	J	`jnl`	Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. Hajo Broersma, Matthew Johnson, Daniël Paulusma
2008	J	`jnl`	Connectedness of the graph of vertex-colourings. Discret. Math. Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2008	C	`conf`	Finding Paths Between 3-Colourings. IWOCA Matthew Johnson, Luis Cereceda, Jan van den Heuvel
2008	C	`conf`	Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA Matthew Johnson, Daniël Paulusma, Chantal Wood
2008	J	`jnl`	Preface. J. Discrete Algorithms Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2008	J	`jnl`	The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
2008	J	`jnl`	Transversals of subtree hypergraphs and the source location problem in digraphs. Networks Jan van den Heuvel, Matthew Johnson
2007	J	`jnl`	Amalgamations of factorizations of complete graphs. J. Comb. Theory B Matthew Johnson
2007	J	`jnl`	Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electron. Notes Discret. Math. Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2007	B	`conf`	Mixing 3-Colourings in Bipartite Graphs. WG Luis Cereceda, Jan van den Heuvel, Matthew Johnson
2007	B	`conf`	Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO Hajo Broersma, Matthew Johnson, Daniël Paulusma
2006	—	`ed.`	Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK ACiD Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2006	J	`jnl`	Cycle decompositions of the complete graph. Ars Comb. Anthony J. W. Hilton, Matthew Johnson
2006	B	`conf`	The Computational Complexity of the Parallel Knock-Out Problem. LATIN Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
2005	—	`ed.`	Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK ACiD Hajo Broersma, Matthew Johnson, Stefan Szeider
2004	J	`jnl`	Amalgamations of factorizations of complete equipartite graphs. Discret. Math. Anthony J. W. Hilton, Matthew Johnson
2004	J	`jnl`	Characterization of graphs with hall number 2. J. Graph Theory Changiz Eslahchi, Matthew Johnson
2004	—	`conf`	The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN Jan van den Heuvel, Matthew Johnson
2003	J	`jnl`	Amalgamations of connected k-factorizations. J. Comb. Theory B Anthony J. W. Hilton, Matthew Johnson, Christopher A. Rodger, Evan B. Wantland
2003	J	`jnl`	An algorithm for finding factorizations of complete graphs. J. Graph Theory Anthony J. W. Hilton, Matthew Johnson
2003	J	`jnl`	Defining sets for Latin squares given that they are based on groups. Eur. J. Comb. David Bedford, Matthew Johnson, Matthew A. Ollis
2001	J	`jnl`	Weak critical sets in cyclic Latin squares. Australas. J Comb. Matthew Johnson, David Bedford