| 2008 |
|---|
| 26 | EE | Peter Danziger,
Eric Mendelsohn,
Lucia Moura,
Brett Stevens:
Covering Arrays Avoiding Forbidden Edges.
COCOA 2008: 296-308 |
| 2007 |
|---|
| 25 | EE | Robert E. Jamison,
Eric Mendelsohn:
On the chromatic spectrum of acyclic decompositions of graphs.
Journal of Graph Theory 56(2): 83-104 (2007) |
| 2006 |
|---|
| 24 | EE | Peter Danziger,
Peter Dukes,
Terry Griggs,
Eric Mendelsohn:
On the Intersection Problem for Steiner Triple Systems of Different Orders.
Graphs and Combinatorics 22(3): 311-329 (2006) |
| 2004 |
|---|
| 23 | EE | Gaetano Quattrocchi,
Eric Mendelsohn:
Minimum embedding of balanced P4-designs into 5-cycle systems.
Discrete Mathematics 279(1-3): 407-421 (2004) |
| 22 | EE | Peter Danziger,
Eric Mendelsohn,
Gaetano Quattrocchi:
On the chromatic index of path decompositions.
Discrete Mathematics 284(1-3): 107-121 (2004) |
| 21 | EE | Brett Stevens,
Eric Mendelsohn:
Packing arrays.
Theor. Comput. Sci. 321(1): 125-148 (2004) |
| 2003 |
|---|
| 20 | EE | Peter Danziger,
Eric Mendelsohn:
Bicolour graphs of Steiner triple systems.
Discrete Mathematics 261(1-3): 157-176 (2003) |
| 2002 |
|---|
| 19 | EE | Brett Stevens,
Eric Mendelsohn:
Packing Arrays.
LATIN 2002: 293-305 |
| 18 | | Brett Stevens,
Alan C. H. Ling,
Eric Mendelsohn:
A direct construction of transversal covers using group divisible designs.
Ars Comb. 63: (2002) |
| 17 | | Brett Stevens,
Eric Mendelsohn:
Packing Arrays and Packing Designs.
Des. Codes Cryptography 27(1-2): 165-176 (2002) |
| 2000 |
|---|
| 16 | EE | Ming-Chu Li,
Derek G. Corneil,
Eric Mendelsohn:
Pancyclicity and NP-completeness in Planar Graphs.
Discrete Applied Mathematics 98(3): 219-225 (2000) |
| 15 | EE | André Kündgen,
Eric Mendelsohn,
Vitaly I. Voloshin:
Colouring Planar Mixed Hypergraphs.
Electr. J. Comb. 7: (2000) |
| 14 | EE | Eric Mendelsohn,
Gaetano Quattrocchi:
Resolving Triple Systems into Regular Configurations.
Electr. J. Comb. 7: (2000) |
| 1999 |
|---|
| 13 | | Eric Mendelsohn,
Nabil Shalaby:
On Skolem Labelling of Windmills.
Ars Comb. 53: (1999) |
| 12 | EE | Ebadollah S. Mahmoodian,
Eric Mendelsohn:
On defining numbers of vertex colouring of regular graphs.
Discrete Mathematics 197-198: 543-554 (1999) |
| 1998 |
|---|
| 11 | EE | Brett Stevens,
Eric Mendelsohn:
Efficient software testing protocols.
CASCON 1998: 22 |
| 10 | | L. Haddad,
Pavol Hell,
Eric Mendelsohn:
On the complexity of coloring areflexive h-ary relations with given permutation group.
Ars Comb. 48: (1998) |
| 9 | | Brett Stevens,
Lucia Moura,
Eric Mendelsohn:
Lower Bounds for Transversal Covers.
Des. Codes Cryptography 15(3): 279-299 (1998) |
| 1996 |
|---|
| 8 | EE | P. B. Gibbons,
Eric Mendelsohn:
The construction of antipodal triple systems by simulated annealing.
Discrete Mathematics 155(1-3): 59-76 (1996) |
| 1994 |
|---|
| 7 | EE | Eric Mendelsohn,
P. Rodney:
The existence of court balanced tournament designs.
Discrete Mathematics 133(1-3): 207-216 (1994) |
| 1992 |
|---|
| 6 | | Charles J. Colbourn,
Eric Mendelsohn,
Cheryl E. Praeger,
Vladimir D. Tonchev:
Concerning Multiplier Automorphisms of Cyclic Steiner Triple Systems.
Des. Codes Cryptography 2(3): 237-251 (1992) |
| 1991 |
|---|
| 5 | EE | Eric Mendelsohn,
Nabil Shalaby:
Skolem labelled graphs.
Discrete Mathematics 97(1-3): 301-317 (1991) |
| 1988 |
|---|
| 4 | EE | Eric Mendelsohn,
Rolf S. Rees:
Mandatory representation designs.
J. Comb. Theory, Ser. A 49(2): 349-362 (1988) |
| 1980 |
|---|
| 3 | | Frank E. Bennett,
Eric Mendelsohn:
Extended (2, 4)-Designs.
J. Comb. Theory, Ser. A 29(1): 74-86 (1980) |
| 2 | | Frank E. Bennett,
Eric Mendelsohn,
N. S. Mendelsohn:
Resolvable Perfect Cyclic Designs.
J. Comb. Theory, Ser. A 29(2): 142-150 (1980) |
| 1978 |
|---|
| 1 | | Eric Mendelsohn:
On the Groups of Automorphisms of Steiner Triple and Quadruple Systems.
J. Comb. Theory, Ser. A 25(2): 97-104 (1978) |
