Search results for "Matthew Johnson 0002"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Matthew Johnson 0002, Daniël Paulusma, Chantal Wood	Path factors and parallel knock-out schemes of almost claw-free graphs.	Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider	Editorial.	J. Discrete Algorithms	2010	DBLP DOI BibTeX RDF
1	Matthew Johnson 0002, Viresh Patel, Daniël Paulusma, Théophile Trunck	Obtaining Online Ecological Colourings by Generalizing First-Fit.	CSR	2010	DBLP DOI BibTeX RDF
1	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma	Upper bounds and algorithms for parallel knock-out numbers.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
1	Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider	Editorial.	J. Discrete Algorithms	2009	DBLP DOI BibTeX RDF
1	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart	The computational complexity of the parallel knock-out problem.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider	Preface.	J. Discrete Algorithms	2008	DBLP DOI BibTeX RDF
1	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma	Upper Bounds and Algorithms for Parallel Knock-Out Numbers.	SIROCCO	2007	DBLP DOI BibTeX RDF	parallel knock-out schemes, computational complexity, claw-free graphs
1	Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider (eds.)	Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK	ACiD	2006	DBLP BibTeX RDF
1	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart	The Computational Complexity of the Parallel Knock-Out Problem.	LATIN	2006	DBLP DOI BibTeX RDF	Parallel knock-out, computational complexity, graphs
1	Hajo Broersma, Matthew Johnson 0002, Stefan Szeider (eds.)	Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK	ACiD	2005	DBLP BibTeX RDF
1	Anthony J. W. Hilton, Matthew Johnson 0002	Amalgamations of factorizations of complete equipartite graphs.	Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	Changiz Eslahchi, Matthew Johnson 0002	Characterization of graphs with hall number 2.	Journal of Graph Theory	2004	DBLP DOI BibTeX RDF
1	Anthony J. W. Hilton, Matthew Johnson 0002, Christopher A. Rodger, Evan B. Wantland	Amalgamations of connected k-factorizations.	J. Comb. Theory, Ser. B	2003	DBLP DOI BibTeX RDF
1	David Bedford, Matthew Johnson 0002, Matthew A. Ollis	Defining sets for Latin squares given that they are based on groups.	Eur. J. Comb.	2003	DBLP DOI BibTeX RDF

Publications of "Matthew Johnson 0002" ( http://dblp.L3S.de/Authors/Matthew_Johnson_0002 )