| 2007 |
|---|
| 8 | EE | 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 | EE | 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 | EE | Anthony J. W. Hilton,
Matthew Johnson:
Amalgamations of factorizations of complete equipartite graphs.
Discrete Mathematics 284(1-3): 157-175 (2004) |
| 3 | EE | Changiz Eslahchi,
Matthew Johnson:
Characterization of graphs with hall number 2.
Journal of Graph Theory 45(2): 81-100 (2004) |
| 2003 |
|---|
| 2 | EE | 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 | EE | 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) |
