| 2008 |
|---|
| 10 | EE | József Balogh,
Clifford D. Smyth:
On the variance of Shannon products of graphs.
Discrete Applied Mathematics 156(1): 110-118 (2008) |
| 2007 |
|---|
| 9 | EE | Tom Bohman,
Alan M. Frieze,
Tomasz Luczak,
Oleg Pikhurko,
Clifford D. Smyth,
Joel Spencer,
Oleg Verbitsky:
First-Order Definability of Trees and Sparse Random Graphs.
Combinatorics, Probability & Computing 16(3): 375-400 (2007) |
| 8 | EE | Alan M. Frieze,
Ryan Martin,
Julien Moncel,
Miklós Ruszinkó,
Clifford D. Smyth:
Codes identifying sets of vertices in random networks.
Discrete Mathematics 307(9-10): 1094-1107 (2007) |
| 7 | EE | Tom Bohman,
Alan M. Frieze,
Ryan Martin,
Miklós Ruszinkó,
Clifford D. Smyth:
Randomly generated intersecting hypergraphs II.
Random Struct. Algorithms 30(1-2): 17-34 (2007) |
| 2005 |
|---|
| 6 | EE | Irit Dinur,
Oded Regev,
Clifford D. Smyth:
The Hardness of 3-Uniform Hypergraph Coloring.
Combinatorica 25(5): 519-535 (2005) |
| 2004 |
|---|
| 5 | EE | József Balogh,
Oded Regev,
Clifford D. Smyth,
William L. Steiger,
Mario Szegedy:
Long Monotone Paths in Line Arrangements.
Discrete & Computational Geometry 32(2): 167-176 (2004) |
| 2003 |
|---|
| 4 | EE | József Balogh,
Oded Regev,
Clifford D. Smyth,
William L. Steiger,
Mario Szegedy:
Long monotone paths in line arrangements.
Symposium on Computational Geometry 2003: 124-128 |
| 2002 |
|---|
| 3 | EE | Irit Dinur,
Oded Regev,
Clifford D. Smyth:
The Hardness of 3 - Uniform Hypergraph Coloring.
FOCS 2002: 33- |
| 2 | EE | Clifford D. Smyth:
Reimer's inequality and tardos' conjecture.
STOC 2002: 218-221 |
| 2000 |
|---|
| 1 | EE | Jeff Kahn,
Michael E. Saks,
Clifford D. Smyth:
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture.
IEEE Conference on Computational Complexity 2000: 98-103 |
