Edit Profile (opens in new tab) Johnson, Matthew Co-Author Distance Author ID: johnson.matthew Published as: Johnson, Matthew Homepage: http://community.dur.ac.uk/matthew.johnson2/ External Links: MGP · ORCID · dblp Documents Indexed: 83 Publications since 2000, including 5 Additional arXiv Preprints 9 Contributions as Editor Co-Authors: 52 Co-Authors with 86 Joint Publications 1,509 Co-Co-Authors all top 5 Co-Authors 1 single-authored 61 Paulusma, Daniël 19 Dabrowski, Konrad Kazimierz 14 Feghali, Carl 10 Bonamy, Marthe 10 Paesani, Giacomo 9 Broersma, Hajo J. 8 Van Leeuwen, Erik Jan 7 Brettell, Nick 7 van den Heuvel, Jan 6 Cereceda, Luis 6 Patel, Viresh 6 Szeider, Stefan 5 Dantchev, Stefan Stoyanov 5 Hilton, Anthony J. W. 5 Martin, Barnaby D. 4 Stewart, Anthony 4 Zamaraev, Victor A. 3 Bedford, David 3 Blanché, Alexandre 3 Bodlaender, Hans L. 3 Golovach, Petr A. 3 Hartinger, Tatiana Romina 3 Milanič, Martin 3 Pandey, Sukanya 3 Smith, Siani 3 Stewart, Iain A. 2 Bousquet, Nicolas 2 Dross, François 2 Gadouleau, Maximilien 2 Georgiou, Nicholas 2 Kratsch, Dieter 2 Kratsch, Stefan 2 Lignos, Ioannis 2 Lozin, Vadim Vladislavovich 2 Mertzios, George B. 2 Oostveen, Jelle J. 2 Trunck, Théophile 2 Wood, Chantal 1 Benyo, Brett 1 Bonsma, Paul S. 1 Bradshaw, Jeffrey M. 1 Breedy, Maggie 1 Broesma, Hajo 1 Bulteau, Laurent 1 Burstein, Mark 1 Carvalho, Marco Antonio Moreira de 1 Chiarelli, Nina 1 Diller, David J. 1 Eslahchi, Changiz 1 Fertin, Guillaume 1 Heyworth, Anne 1 Huang, Shenwei 1 Jeffers, Renia 1 Kulkarni, Shri 1 Lotfifar, Foad 1 Lott, James 1 Ollis, M. A. 1 Pierron, Théo 1 Rodger, Christopher Andrew 1 Rzążewski, Paweł 1 Song, Jian 1 Suri, Niranjan 1 Uszok, Andrzej 1 Vialette, Stéphane 1 Wantland, Evan B. all top 5 Serials 8 Journal of Graph Theory 5 Theoretical Computer Science 5 European Journal of Combinatorics 5 Algorithmica 4 Journal of Discrete Algorithms 3 Discrete Mathematics 3 Journal of Combinatorial Theory. Series B 3 Texts in Algorithmics 2 Discrete Applied Mathematics 1 Information Processing Letters 1 Ars Combinatoria 1 Bulletin of the London Mathematical Society 1 Journal of Computer and System Sciences 1 Journal of the London Mathematical Society. Second Series 1 Networks 1 Numerical Functional Analysis and Optimization 1 SIAM Journal on Discrete Mathematics 1 International Journal of Computational Geometry & Applications 1 The Australasian Journal of Combinatorics 1 Journal of Combinatorial Designs 1 Theory of Computing Systems 1 Journal of Combinatorial Optimization 1 Communications in Nonlinear Science and Numerical Simulation 1 London Mathematical Society Lecture Note Series 1 Computability all top 5 Fields 68 Combinatorics (05-XX) 45 Computer science (68-XX) 9 General and overarching topics; collections (00-XX) 3 Operations research, mathematical programming (90-XX) 2 Calculus of variations and optimal control; optimization (49-XX) 2 Global analysis, analysis on manifolds (58-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 General algebraic systems (08-XX) 1 Category theory; homological algebra (18-XX) 1 Ordinary differential equations (34-XX) 1 Integral equations (45-XX) 1 Probability theory and stochastic processes (60-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 65 Publications have been cited 626 times in 339 Documents Cited by ▼ Year ▼ A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039 Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian 77 2017 Finding paths between 3-colorings. Zbl 1216.05154 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 69 2011 Connectedness of the graph of vertex-colourings. Zbl 1133.05053 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 64 2008 Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089 Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël 40 2014 Mixing 3-colourings in bipartite graphs. Zbl 1198.05040 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 40 2009 Clique-width for hereditary graph classes. Zbl 1476.05175 Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 22 2019 A reconfigurations analogue of Brooks’ theorem and its consequences. Zbl 1350.05034 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 20 2016 Finding shortest paths between graph colourings. Zbl 1350.68148 Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël 17 2016 On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Zbl 1404.05049 Bonamy, Marthe; Bousquet, Nicolas; Feghali, Carl; Johnson, Matthew 16 2019 Some results on the Oberwolfach problem. Zbl 1012.05135 Hilton, A. J. W.; Johnson, Matthew 15 2001 Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2018 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2019 Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Zbl 1380.68219 Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël 12 2018 Amalgamations of connected \(k\)-factorizations. Zbl 1033.05084 Hilton, A. J. W.; Johnson, Matthew; Rodger, C. A.; Wantland, E. B. 11 2003 Kempe equivalence of colourings of cubic graphs. Zbl 1348.05074 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 10 2017 Erdös-Ko-Rado theorems for a family of trees. Zbl 1377.05031 Feghali, Carl; Johnson, Matthew; Thomas, Daniel 9 2018 The price of connectivity for cycle transversals. Zbl 1343.05157 Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël 9 2016 Recognizing graphs close to bipartite graphs. Zbl 1441.68167 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 9 2017 Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68245 Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 9 2020 Transversals of subtree hypergraphs and the source location problem in digraphs. Zbl 1180.05116 van den Heuvel, Jan; Johnson, Matthew 9 2008 Characterization of graphs with Hall number 2. Zbl 1033.05040 Eslahchi, Changiz; Johnson, Matthew 8 2004 Amalgamations of factorizations of complete graphs. Zbl 1153.05055 Johnson, Matthew 8 2007 On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 1459.05332 Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł 8 2020 Finding shortest paths between graph colourings. Zbl 1341.68062 Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël 7 2014 Path factors and parallel knock-out schemes of almost claw-free graphs. Zbl 1219.05140 Johnson, Matthew; Paulusma, Daniël; Wood, Chantal 7 2010 Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs. Zbl 1445.68110 Huang, Shenwei; Johnson, Matthew; Paulusma, Daniël 6 2014 Hereditary graph classes: when the complexities of coloring and clique cover coincide. Zbl 1417.05060 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 5 2019 Finding paths between 3-colourings. Zbl 1235.05135 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 5 2009 On the diameter of reconfiguration graphs for vertex colourings. Zbl 1274.05144 Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël 5 2011 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1474.68216 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 5 2016 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 5 2017 A reconfigurations analogue of Brooks’ theorem. Zbl 1426.05042 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 4 2014 Clique-width for graph classes closed under complementation. Zbl 1441.05167 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 4 2020 Optimal control results for Sobolev-type fractional stochastic Volterra-Fredholm integrodifferential systems of order \(\vartheta \in (1, 2)\) via sectorial operators. Zbl 1521.49005 Johnson, M.; Vijayakumar, V. 4 2023 Finding paths between graph colourings: Computational complexity and possible distances. Zbl 1341.05063 Bonsma, Paul; Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 4 2007 An algorithm for finding factorizations of complete graphs. Zbl 1015.05075 Hilton, A. J. W.; Johnson, Matthew 4 2003 Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055 Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony 3 2019 Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68195 Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo 3 2021 Computing weighted subset transversals in \(H\)-free graphs. Zbl 07498680 Brettell, Nick; Johnson, Matthew; Paulusma, Daniël 3 2021 Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68196 Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 3 2019 Cycle decompositions of the complete graph. Zbl 1174.05412 Hilton, A. J. W.; Johnson, Matthew 3 2006 The computational complexity of the parallel knock-out problem. Zbl 1136.68028 Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A. 3 2008 Mixing 3-colourings in bipartite graphs. Zbl 1141.68521 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 3 2007 Computing subset transversals in \(H\)-free graphs. Zbl 07458786 Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 3 2022 On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Zbl 1516.05185 Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor 3 2018 Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. Zbl 1522.05362 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 3 2021 A multi-level hypergraph partitioning algorithm using rough set clustering. Zbl 1377.05186 Lotfifar, Foad; Johnson, Matthew 2 2015 Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68244 Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 2 2018 Upper bounds and algorithms for parallel knock-out numbers. Zbl 1164.68026 Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël 2 2009 Clique-width for graph classes closed under complementation. Zbl 1441.05193 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 2 2017 Computing subset transversals in \(H\)-free graphs. Zbl 07636205 Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 2 2020 Steiner trees for hereditary graph classes: a treewidth perspective. Zbl 1477.68203 Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan 2 2021 Algorithms and complexity in Durham 2005. Proceedings of the first ACiD workshop, Durham, UK, July 8–10, 2005. Zbl 1230.68035 2 2005 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1443.05064 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 2 2019 The price of connectivity for cycle transversals. Zbl 1455.05076 Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël 1 2015 Kempe equivalence of colourings of cubic graphs. Zbl 1346.05065 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 1 2015 What graphs are 2-dot product graphs? Zbl 1346.05246 Johnson, Matthew; van Leeuwen, Erik Jan; Paulusma, Daniël 1 2015 Weak uniquely completable sets for finite groups. Zbl 1020.05013 Bedford, David; Johnson, Matthew 1 2000 Weak critical sets in cyclic Latin squares. Zbl 0977.05023 Johnson, Matthew; Bedford, David 1 2001 Knocking out \(P _{k }\)-free graphs. Zbl 1426.68125 Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony 1 2014 Algorithms to measure diversity and clustering in social networks through dot product graphs. Zbl 1329.05281 Johnson, Matthew; Paulusma, Daniël; van Leeuwen, Erik Jan 1 2013 Enclosings of decompositions of complete multigraphs in 2-factorizations. Zbl 1396.05091 Feghali, Carl; Johnson, Matthew 1 2018 The computational complexity of the parallel knock-out problem. Zbl 1145.68433 Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A. 1 2006 On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 07160840 Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 1 2019 Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs. Zbl 07526471 Brettell, Nick; Johnson, Matthew; Paulusma, Daniël 1 2022 Optimal control results for Sobolev-type fractional stochastic Volterra-Fredholm integrodifferential systems of order \(\vartheta \in (1, 2)\) via sectorial operators. Zbl 1521.49005 Johnson, M.; Vijayakumar, V. 4 2023 Computing subset transversals in \(H\)-free graphs. Zbl 07458786 Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 3 2022 Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs. Zbl 07526471 Brettell, Nick; Johnson, Matthew; Paulusma, Daniël 1 2022 Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68195 Bonamy, Marthe; Bousquet, Nicolas; Dabrowski, Konrad Kazimierz; Johnson, Matthew; Paulusma, Daniël; Pierron, Théo 3 2021 Computing weighted subset transversals in \(H\)-free graphs. Zbl 07498680 Brettell, Nick; Johnson, Matthew; Paulusma, Daniël 3 2021 Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. Zbl 1522.05362 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 3 2021 Steiner trees for hereditary graph classes: a treewidth perspective. Zbl 1477.68203 Bodlaender, Hans L.; Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; van Leeuwen, Erik Jan 2 2021 Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68245 Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 9 2020 On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 1459.05332 Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Rzążewski, Paweł 8 2020 Clique-width for graph classes closed under complementation. Zbl 1441.05167 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 4 2020 Computing subset transversals in \(H\)-free graphs. Zbl 07636205 Brettell, Nick; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 2 2020 Clique-width for hereditary graph classes. Zbl 1476.05175 Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 22 2019 On a conjecture of Mohar concerning Kempe equivalence of regular graphs. Zbl 1404.05049 Bonamy, Marthe; Bousquet, Nicolas; Feghali, Carl; Johnson, Matthew 16 2019 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1422.68105 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2019 Hereditary graph classes: when the complexities of coloring and clique cover coincide. Zbl 1417.05060 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 5 2019 Surjective \(H\)-colouring: new hardness results. Zbl 1425.05055 Golovach, Petr A.; Johnson, Matthew; Martin, Barnaby; Paulusma, Daniël; Stewart, Anthony 3 2019 Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy. Zbl 1512.68196 Bonamy, Marthe; Dabrowski, Konrad K.; Johnson, Matthew; Paulusma, Daniël 3 2019 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1443.05064 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 2 2019 On cycle transversals and their connected variants in the absence of a small linear forest. Zbl 07160840 Feghali, Carl; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 1 2019 Independent feedback vertex sets for graphs of bounded diameter. Zbl 1422.68104 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 14 2018 Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Zbl 1380.68219 Chiarelli, Nina; Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël 12 2018 Erdös-Ko-Rado theorems for a family of trees. Zbl 1377.05031 Feghali, Carl; Johnson, Matthew; Thomas, Daniel 9 2018 On the price of independence for vertex cover, feedback vertex set and odd cycle transversal. Zbl 1516.05185 Dabrowski, Konrad K.; Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël; Zamaraev, Viktor 3 2018 Connected vertex cover for \((sP_1+P_5)\)-free graphs. Zbl 1436.68244 Johnson, Matthew; Paesani, Giacomo; Paulusma, Daniël 2 2018 Enclosings of decompositions of complete multigraphs in 2-factorizations. Zbl 1396.05091 Feghali, Carl; Johnson, Matthew 1 2018 A survey on the computational complexity of coloring graphs with forbidden subgraphs. Zbl 1359.05039 Golovach, Petr A.; Johnson, Matthew; Paulusma, Daniël; Song, Jian 77 2017 Kempe equivalence of colourings of cubic graphs. Zbl 1348.05074 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 10 2017 Recognizing graphs close to bipartite graphs. Zbl 1441.68167 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 9 2017 Independent feedback vertex set for \(P_5\)-free graphs. Zbl 1457.68122 Bonamy, Marthe; Dabrowski, Konrad K.; Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 5 2017 Clique-width for graph classes closed under complementation. Zbl 1441.05193 Blanché, Alexandre; Dabrowski, Konrad K.; Johnson, Matthew; Lozin, Vadim V.; Paulusma, Daniël; Zamaraev, Viktor 2 2017 A reconfigurations analogue of Brooks’ theorem and its consequences. Zbl 1350.05034 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 20 2016 Finding shortest paths between graph colourings. Zbl 1350.68148 Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël 17 2016 The price of connectivity for cycle transversals. Zbl 1343.05157 Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël 9 2016 Filling the complexity gaps for colouring planar and bounded degree graphs. Zbl 1474.68216 Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël 5 2016 A multi-level hypergraph partitioning algorithm using rough set clustering. Zbl 1377.05186 Lotfifar, Foad; Johnson, Matthew 2 2015 The price of connectivity for cycle transversals. Zbl 1455.05076 Hartinger, Tatiana R.; Johnson, Matthew; Milanič, Martin; Paulusma, Daniël 1 2015 Kempe equivalence of colourings of cubic graphs. Zbl 1346.05065 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 1 2015 What graphs are 2-dot product graphs? Zbl 1346.05246 Johnson, Matthew; van Leeuwen, Erik Jan; Paulusma, Daniël 1 2015 Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. Zbl 1284.05089 Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël 40 2014 Finding shortest paths between graph colourings. Zbl 1341.68062 Johnson, Matthew; Kratsch, Dieter; Kratsch, Stefan; Patel, Viresh; Paulusma, Daniël 7 2014 Narrowing the complexity gap for colouring \((C_{s},P_{t})\)-free graphs. Zbl 1445.68110 Huang, Shenwei; Johnson, Matthew; Paulusma, Daniël 6 2014 A reconfigurations analogue of Brooks’ theorem. Zbl 1426.05042 Feghali, Carl; Johnson, Matthew; Paulusma, Daniël 4 2014 Knocking out \(P _{k }\)-free graphs. Zbl 1426.68125 Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony 1 2014 Algorithms to measure diversity and clustering in social networks through dot product graphs. Zbl 1329.05281 Johnson, Matthew; Paulusma, Daniël; van Leeuwen, Erik Jan 1 2013 Finding paths between 3-colorings. Zbl 1216.05154 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 69 2011 On the diameter of reconfiguration graphs for vertex colourings. Zbl 1274.05144 Bonamy, Marthe; Johnson, Matthew; Lignos, Ioannis; Patel, Viresh; Paulusma, Daniël 5 2011 Path factors and parallel knock-out schemes of almost claw-free graphs. Zbl 1219.05140 Johnson, Matthew; Paulusma, Daniël; Wood, Chantal 7 2010 Mixing 3-colourings in bipartite graphs. Zbl 1198.05040 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 40 2009 Finding paths between 3-colourings. Zbl 1235.05135 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 5 2009 Upper bounds and algorithms for parallel knock-out numbers. Zbl 1164.68026 Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël 2 2009 Connectedness of the graph of vertex-colourings. Zbl 1133.05053 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 64 2008 Transversals of subtree hypergraphs and the source location problem in digraphs. Zbl 1180.05116 van den Heuvel, Jan; Johnson, Matthew 9 2008 The computational complexity of the parallel knock-out problem. Zbl 1136.68028 Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A. 3 2008 Amalgamations of factorizations of complete graphs. Zbl 1153.05055 Johnson, Matthew 8 2007 Finding paths between graph colourings: Computational complexity and possible distances. Zbl 1341.05063 Bonsma, Paul; Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 4 2007 Mixing 3-colourings in bipartite graphs. Zbl 1141.68521 Cereceda, Luis; van den Heuvel, Jan; Johnson, Matthew 3 2007 Cycle decompositions of the complete graph. Zbl 1174.05412 Hilton, A. J. W.; Johnson, Matthew 3 2006 The computational complexity of the parallel knock-out problem. Zbl 1145.68433 Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A. 1 2006 Algorithms and complexity in Durham 2005. Proceedings of the first ACiD workshop, Durham, UK, July 8–10, 2005. Zbl 1230.68035 2 2005 Characterization of graphs with Hall number 2. Zbl 1033.05040 Eslahchi, Changiz; Johnson, Matthew 8 2004 Amalgamations of connected \(k\)-factorizations. Zbl 1033.05084 Hilton, A. J. W.; Johnson, Matthew; Rodger, C. A.; Wantland, E. B. 11 2003 An algorithm for finding factorizations of complete graphs. Zbl 1015.05075 Hilton, A. J. W.; Johnson, Matthew 4 2003 Some results on the Oberwolfach problem. Zbl 1012.05135 Hilton, A. J. W.; Johnson, Matthew 15 2001 Weak critical sets in cyclic Latin squares. Zbl 0977.05023 Johnson, Matthew; Bedford, David 1 2001 Weak uniquely completable sets for finite groups. Zbl 1020.05013 Bedford, David; Johnson, Matthew 1 2000 all cited Publications top 5 cited Publications all top 5 Cited by 440 Authors 65 Paulusma, Daniël 35 Johnson, Matthew 23 Feghali, Carl 17 Ito, Takehiro 16 Dabrowski, Konrad Kazimierz 15 Bousquet, Nicolas 15 Mouawad, Amer E. 14 Bonamy, Marthe 13 Martin, Barnaby D. 12 Smith, Siani 11 Chudnovsky, Maria 11 Suzuki, Akira 10 Bahmanian, M. Amin 10 Paesani, Giacomo 10 Rzążewski, Paweł 10 Zhou, Xiao 9 Brettell, Nick 9 Milanič, Martin 8 Malyshev, Dmitriĭ Sergeevich 8 Munaro, Andrea 8 Nishimura, Naomi 8 Van Leeuwen, Erik Jan 8 Zhong, Mingxian 7 Bartier, Valentin 7 Bryant, Darryn E. 7 Haas, Ruth 7 Kamiński, Marcin Marek 7 Spirkl, Sophie Theresa 6 Bonsma, Paul S. 6 Cranston, Daniel W. 6 Klimošová, Tereza 6 Novotná, Jana 6 Zhou, Sizhong 5 Brewster, Richard C. 5 Cereceda, Luis 5 Demaine, Erik D. 5 Golovach, Petr A. 5 Heinrich, Marc 5 Hilton, Anthony J. W. 5 Huang, Shenwei 5 Lee, Jae-Baek 5 Lima, Paloma T. 5 Masařík, Tomáš 5 Raman, Venkatesh 5 Schaudt, Oliver 5 Siebertz, Sebastian 5 Siggers, Mark H. 4 Bonomo-Braberman, Flavia 4 Brause, Christoph 4 Dallard, Clément 4 Danziger, Peter 4 Goedgebeur, Jan 4 Lokshtanov, Daniel 4 Lozin, Vadim Vladislavovich 4 Noel, Jonathan Andrew 4 Panolan, Fahad 4 Ries, Bernard 4 Seyffarth, Karen 4 Stein, Maya Jakobine 4 Uehara, Ryuhei 4 van den Heuvel, Jan 4 Wrochna, Marcin 4 Zamaraev, Victor A. 3 Asplund, John 3 Borg, Peter 3 Buratti, Marco 3 Hoàng, Chính T. 3 Horsfield, Jake 3 Horsley, Daniel 3 Johnson, Peter D. jun. 3 Kobayashi, Yusuke 3 Medvedev, Paul 3 Moore, Benjamin R. 3 Mynhardt, Christina Magdalena 3 Ono, Hirotaka 3 Osawa, Hiroki 3 Otachi, Yota 3 Patel, Viresh 3 Pierron, Théo 3 Rodger, Christopher Andrew 3 Russell, Heather M. 3 Tamura, Yuma 3 Traetta, Tommaso 2 Bhakta, Prateek 2 Bian, Qiuxiang 2 Blanché, Alexandre 2 Bodlaender, Hans L. 2 Bok, Jan 2 Brignall, Robert 2 Broersma, Hajo J. 2 Burgess, Andrea C. 2 Chiarelli, Nina 2 Cropper, Mathew Maurice 2 Deschamps, Quentin 2 Dochtermann, Anton 2 Dross, François 2 Dvořák, Zdeněk 2 Estrugo, Emiliano J. J. 2 Fomin, Fedor V. 2 Gaspers, Serge ...and 340 more Authors all top 5 Cited in 50 Serials 32 Theoretical Computer Science 31 Discrete Mathematics 21 Discrete Applied Mathematics 21 Algorithmica 19 SIAM Journal on Discrete Mathematics 17 European Journal of Combinatorics 16 Journal of Graph Theory 12 Graphs and Combinatorics 11 Journal of Combinatorial Theory. Series B 11 The Electronic Journal of Combinatorics 9 Journal of Computer and System Sciences 9 Journal of Combinatorial Designs 7 The Australasian Journal of Combinatorics 6 Information Processing Letters 5 Journal of Combinatorial Optimization 3 Journal of Combinatorial Theory. Series A 3 Operations Research Letters 3 Optimization Letters 3 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 2 Combinatorica 2 Annals of Operations Research 2 Combinatorics, Probability and Computing 2 Algorithms 1 Acta Informatica 1 Bulletin of the Australian Mathematical Society 1 Indian Journal of Pure & Applied Mathematics 1 International Journal of Mathematics and Mathematical Sciences 1 Advances in Applied Mathematics 1 Information and Computation 1 Computers & Operations Research 1 International Journal of Computational Geometry & Applications 1 European Journal of Operational Research 1 Journal of Algebraic Combinatorics 1 Top 1 Complexity 1 Discussiones Mathematicae. Graph Theory 1 Séminaire Lotharingien de Combinatoire 1 Theory of Computing Systems 1 Discrete Dynamics in Nature and Society 1 Journal of the European Mathematical Society (JEMS) 1 Acta Mathematica Sinica. English Series 1 Journal of Discrete Algorithms 1 AKCE International Journal of Graphs and Combinatorics 1 Parallel Processing Letters 1 Contributions to Discrete Mathematics 1 Journal of Physics A: Mathematical and Theoretical 1 Involve 1 Ars Mathematica Contemporanea 1 AIMS Mathematics 1 PUMP Journal of Undergraduate Research all top 5 Cited in 13 Fields 276 Combinatorics (05-XX) 159 Computer science (68-XX) 23 Operations research, mathematical programming (90-XX) 3 Manifolds and cell complexes (57-XX) 3 Probability theory and stochastic processes (60-XX) 1 Mathematical logic and foundations (03-XX) 1 Dynamical systems and ergodic theory (37-XX) 1 Convex and discrete geometry (52-XX) 1 Algebraic topology (55-XX) 1 Quantum theory (81-XX) 1 Statistical mechanics, structure of matter (82-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year