2007 |
23 | EE | Ananda S. Chowdhury,
Suchendra M. Bhandarkar,
Robert W. Robinson,
Jack C. Yu:
Novel Graph Theoretic Enhancements to Icp-Based Virtual Craniofacial Reconstruction.
ISBI 2007: 1136-1139 |
22 | EE | Gab-Byung Chae,
Edgar M. Palmer,
Robert W. Robinson:
Counting labeled general cubic graphs.
Discrete Mathematics 307(23): 2979-2992 (2007) |
2006 |
21 | EE | Ananda S. Chowdhury,
Suchendra M. Bhandarkar,
Robert W. Robinson,
Jack C. Yu:
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures.
ICIP 2006: 1173-1176 |
2003 |
20 | EE | Brendan D. McKay,
Edgar M. Palmer,
Ronald C. Read,
Robert W. Robinson:
The asymptotic number of claw-free cubic graphs.
Discrete Mathematics 272(1): 107-118 (2003) |
2002 |
19 | EE | Edgar M. Palmer,
Ronald C. Read,
Robert W. Robinson:
Counting Claw-Free Cubic Graphs.
SIAM J. Discrete Math. 16(1): 65-73 (2002) |
2001 |
18 | | Robert W. Robinson,
Nicholas C. Wormald:
Hamilton cycles containing randomly selected edges in random regular graphs.
Random Struct. Algorithms 19(2): 128-147 (2001) |
1998 |
17 | | Brendan D. McKay,
Robert W. Robinson:
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph.
Combinatorics, Probability & Computing 7(4): 437-449 (1998) |
1997 |
16 | | Michael S. O. Molloy,
Hanna D. Robalewska,
Robert W. Robinson,
Nicholas C. Wormald:
1-Factorizations of random regular graphs.
Random Struct. Algorithms 10(3): 305-321 (1997) |
1996 |
15 | | Alan M. Frieze,
Mark Jerrum,
Michael Molloy,
Robert W. Robinson,
Nicholas C. Wormald:
Generating and Counting Hamilton Cycles in Random Regular Graphs.
J. Algorithms 21(1): 176-198 (1996) |
1994 |
14 | EE | Walter D. Potter,
Robert W. Robinson,
John A. Miller,
Krys Kochut,
D. Z. Redys:
Using the Genetic Algorithm to Find Snake-in-the-Box Codes.
IEA/AIE 1994: 421-426 |
13 | EE | Daniel M. Gordon,
Robert W. Robinson,
Frank Harary:
Minimum degree games for graphs.
Discrete Mathematics 128(1-3): 151-163 (1994) |
12 | | Robert W. Robinson,
Nicholas C. Wormald:
Almost All Regular Graphs Are Hamiltonian.
Random Struct. Algorithms 5(2): 363-374 (1994) |
1993 |
11 | EE | Robert W. Robinson,
T. R. S. Walsh:
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs.
J. Comb. Theory, Ser. B 57(2): 289-308 (1993) |
1992 |
10 | | Robert W. Robinson,
Nicholas C. Wormald:
Almost All Cubic Graphs Are Hamiltonian.
Random Struct. Algorithms 3(2): 117-126 (1992) |
1990 |
9 | EE | J. W. Kennedy,
K. A. McKeon,
Edgar M. Palmer,
Robert W. Robinson:
Asymptotic number of symmetries in locally restricted trees.
Discrete Applied Mathematics 26(1): 121-124 (1990) |
1988 |
8 | EE | Edward A. Bender,
E. Rodney Canfield,
Robert W. Robinson:
The asymptotic number of tree-rooted maps on a surface.
J. Comb. Theory, Ser. A 48(2): 156-164 (1988) |
7 | EE | Edward A. Bender,
Robert W. Robinson:
The asymptotic number of acyclic digraphs, II.
J. Comb. Theory, Ser. B 44(3): 363-369 (1988) |
1986 |
6 | | Edward A. Bender,
L. Bruce Richmond,
Robert W. Robinson,
Nicholas C. Wormald:
The asymptotic number of acyclic diagraphs I.
Combinatorica 6(1): 15-22 (1986) |
1984 |
5 | | Frank Harary,
Robert W. Robinson:
Isomorphic factorizations VIII: Bisectable trees.
Combinatorica 4(2): 169-179 (1984) |
1982 |
4 | EE | P. Hanlon,
Robert W. Robinson:
Counting bridgeless graphs.
J. Comb. Theory, Ser. B 33(3): 276-305 (1982) |
1981 |
3 | | David B. Posner,
Robert W. Robinson:
Degrees Joining to 0?
J. Symb. Log. 46(4): 714-722 (1981) |
1974 |
2 | EE | Edgar M. Palmer,
M. A. Rahimi,
Robert W. Robinson:
Efficiency of a Binary Comparison Storage Technique.
J. ACM 21(3): 376-384 (1974) |
1967 |
1 | | Robert W. Robinson:
Simplicity of Recursively Enumerable Sets.
J. Symb. Log. 32(2): 162-172 (1967) |