Matthew Johnson

University of Durham, Department of Computer Science

other persons with the same name:

• Matthew Johnson

	2010
15		Matthew Johnson, Viresh Patel, Daniël Paulusma, Théophile Trunck: Obtaining Online Ecological Colourings by Generalizing First-Fit. CSR 2010: 240-251
14		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)
13		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 8(2): 101 (2010)
	2009
12		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)
11		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
10		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)
9		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)
	2007
8		Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340
	2006
7		Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK King's College, London 2006
6		Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261
	2005
5		Hajo Broersma, Matthew Johnson, Stefan Szeider: Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK King's College, London 2005
	2004
4		Anthony J. W. Hilton, Matthew Johnson: Amalgamations of factorizations of complete equipartite graphs. Discrete Mathematics 284(1-3): 157-175 (2004)
3		Changiz Eslahchi, Matthew Johnson: Characterization of graphs with hall number 2. Journal of Graph Theory 45(2): 81-100 (2004)
	2003
2		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)
1		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)

Coauthor Index

1	David Bedford	[2]
2	Hajo Broersma (H. J. Broersma)	[5] [6] [7] [8] [9] [10] [11] [12] [13]
3	Stefan S. Dantchev	[7] [10] [12] [13]
4	Changiz Eslahchi	[3]
5	Anthony J. W. Hilton	[1] [4]
6	Matthew A. Ollis	[2]
7	Viresh Patel	[15]
8	Daniël Paulusma	[6] [8] [9] [11] [14] [15]
9	Christopher A. Rodger (C. A. Rodger)	[1]
10	Iain A. Stewart	[6] [9]
11	Stefan Szeider	[5] [7] [10] [12] [13]
12	Théophile Trunck	[15]
13	Evan B. Wantland	[1]
14	Chantal Wood	[14]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page