Matthew Johnson

University of Durham, Department of Computer Science

other persons with the same name:

• Matt Johnson - Institute for Human and Machine Cognition, Pensacola, FL, USA

	2012
j20		Iain A. Stewart, Daniël Paulusma, Matthew Johnson: Editorial. J. Discrete Algorithms 12: 1 (2012)
	2011
j19		Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma: On the diameter of reconfiguration graphs for vertex colourings. Electronic Notes in Discrete Mathematics 38: 161-166 (2011)
j18		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Finding paths between 3-colorings. Journal of Graph Theory 67(1): 69-82 (2011)
	2010
j17		Matthew Johnson, Daniël Paulusma, Chantal Wood: Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics 310(9): 1413-1423 (2010)
j16		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 8(2): 101 (2010)
c7		Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck: Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR 2010: 240-251
	2009
j15		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Mixing 3-colourings in bipartite graphs. Eur. J. Comb. 30(7): 1593-1606 (2009)
j14		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)
j13		Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009)
	2008
j12		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Connectedness of the graph of vertex-colourings. Discrete Mathematics 308(5-6): 913-919 (2008)
j11		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)
j10		Jan van den Heuvel, Matthew Johnson: Transversals of subtree hypergraphs and the source location problem in digraphs. Networks 51(2): 113-119 (2008)
j9		Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008)
c6		Matthew Johnson, Daniël Paulusma, Chantal Wood: Path factors and parallel knock-out schemes of almost claw-free graphs. IWOCA 2008: 27-41
c5		Matthew Johnson, Luis Cereceda, Jan van den Heuvel: Finding Paths Between 3-Colourings. IWOCA 2008: 182-196
	2007
j8		Paul S. Bonsma, Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Finding Paths between Graph Colourings: Computational Complexity and Possible Distances. Electronic Notes in Discrete Mathematics 29: 463-469 (2007)
j7		Matthew Johnson: Amalgamations of factorizations of complete graphs. J. Comb. Theory, Ser. B 97(4): 597-611 (2007)
c4		Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340
c3		Luis Cereceda, Jan van den Heuvel, Matthew Johnson: Mixing 3-Colourings in Bipartite Graphs. WG 2007: 166-177
	2006
j6		Anthony J. W. Hilton, Matthew Johnson: Cycle decompositions of the complete graph. Ars Comb. 81 (2006)
c2		Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261
e2		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider (Eds.): Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, isbn 1-904987-38-9
	2005
e1		Hajo Broersma, Matthew Johnson, Stefan Szeider (Eds.): Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Texts in Algorithmics 4, King's College, London 2005, isbn 1-904987-10-9
	2004
j5		Anthony J. W. Hilton, Matthew Johnson: Amalgamations of factorizations of complete equipartite graphs. Discrete Mathematics 284(1-3): 157-175 (2004)
j4		Changiz Eslahchi, Matthew Johnson: Characterization of graphs with hall number 2. Journal of Graph Theory 45(2): 81-100 (2004)
c1		Jan van den Heuvel, Matthew Johnson: The External Network Problem with Edge- or Arc-Connectivity Requirements. CAAN 2004: 114-126
	2003
j3		David Bedford, Matthew Johnson, Matthew A. Ollis: Defining sets for Latin squares given that they are based on groups. Eur. J. Comb. 24(1): 129-135 (2003)
j2		Anthony J. W. Hilton, Matthew Johnson, Christopher A. Rodger, Evan B. Wantland: Amalgamations of connected k-factorizations. J. Comb. Theory, Ser. B 88(2): 267-279 (2003)
j1		Anthony J. W. Hilton, Matthew Johnson: An algorithm for finding factorizations of complete graphs. Journal of Graph Theory 43(2): 132-136 (2003)

Coauthor Index

Colors in the list of coauthors

Last update Fri May 24 15:15:37 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page