| 2007 |
|---|
| 9 | EE | Alan M. Frieze,
Ryan Martin,
Julien Moncel,
Miklós Ruszinkó,
Cliff Smyth:
Codes identifying sets of vertices in random networks.
Discrete Mathematics 307(9-10): 1094-1107 (2007) |
| 8 | EE | Tom Bohman,
Alan M. Frieze,
Ryan Martin,
Miklós Ruszinkó,
Cliff Smyth:
Randomly generated intersecting hypergraphs II.
Random Struct. Algorithms 30(1-2): 17-34 (2007) |
| 2006 |
|---|
| 7 | EE | Maria Axenovich,
Ryan Martin:
A note on short cycles in a hypercube.
Discrete Mathematics 306(18): 2212-2218 (2006) |
| 6 | EE | Maria Axenovich,
Ryan Martin:
Sub-Ramsey Numbers for Arithmetic Progressions.
Graphs and Combinatorics 22(3): 297-309 (2006) |
| 2004 |
|---|
| 5 | EE | Alan M. Frieze,
Michael Krivelevich,
Ryan Martin:
The emergence of a giant component in random subgraphs of pseudo-random graphs.
Random Struct. Algorithms 24(1): 42-50 (2004) |
| 4 | EE | Tom Bohman,
Alan M. Frieze,
Michael Krivelevich,
Ryan Martin:
Adding random edges to dense graphs.
Random Struct. Algorithms 24(2): 105-117 (2004) |
| 2003 |
|---|
| 3 | EE | Tom Bohman,
Ryan Martin:
A note on G-intersecting families.
Discrete Mathematics 260(1-3): 183-188 (2003) |
| 2 | EE | Tom Bohman,
Colin Cooper,
Alan M. Frieze,
Ryan Martin,
Miklós Ruszinkó:
On Randomly Generated Intersecting Hypergraphs.
Electr. J. Comb. 10: (2003) |
| 1 | EE | Tom Bohman,
Alan M. Frieze,
Ryan Martin:
How many random edges make a dense graph hamiltonian?
Random Struct. Algorithms 22(1): 33-42 (2003) |
