Robert W. Robinson

According to our database1, Robert W. Robinson authored at least 40 papers between 1967 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2011
Detection of hairline mandibular fracture using max-flow min-cut and Kolmogorov-Smirnov distance.
Proceedings of the 8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 2011

2010
Asymptotic enumeration of correlation-immune boolean functions.
Cryptography and Communications, 2010

2009
Virtual craniofacial reconstruction using computer vision, graph theory and geometric constraints.
Pattern Recognition Letters, 2009

Asymptotic enumeration of correlation-immune boolean functions.
IACR Cryptology ePrint Archive, 2009

Virtual multi-fracture craniofacial reconstruction using computer vision and graph matching.
Comp. Med. Imag. and Graph., 2009

2007
Counting labeled general cubic graphs.
Discrete Mathematics, 2007

Novel Graph Theoretic Enhancements to Icp-Based Virtual Craniofacial Reconstruction.
Proceedings of the 2007 IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 2007

2006
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures.
Proceedings of the International Conference on Image Processing, 2006

2003
The asymptotic number of claw-free cubic graphs.
Discrete Mathematics, 2003

2002
Counting Claw-Free Cubic Graphs.
SIAM J. Discrete Math., 2002

2001
Hamilton cycles containing randomly selected edges in random regular graphs.
Random Struct. Algorithms, 2001

1998
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph.
Combinatorics, Probability & Computing, 1998

1997
1-Factorizations of random regular graphs.
Random Struct. Algorithms, 1997

1996
Generating and Counting Hamilton Cycles in Random Regular Graphs.
J. Algorithms, 1996

1994
Almost All Regular Graphs Are Hamiltonian.
Random Struct. Algorithms, 1994

Minimum degree games for graphs.
Discrete Mathematics, 1994

Using the Genetic Algorithm to Find Snake-in-the-Box Codes.
Proceedings of the Seventh International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 1994

1993
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs.
J. Comb. Theory, Ser. B, 1993

1992
Almost All Cubic Graphs Are Hamiltonian.
Random Struct. Algorithms, 1992

1990
Asymptotic number of symmetries in locally restricted trees.
Discrete Applied Mathematics, 1990

1988
The asymptotic number of acyclic digraphs, II.
J. Comb. Theory, Ser. B, 1988

The asymptotic number of tree-rooted maps on a surface.
J. Comb. Theory, Ser. A, 1988

Enumerating phylogenetic trees with multiple labels.
Discrete Mathematics, 1988

1986
The asymptotic number of acyclic diagraphs I.
Combinatorica, 1986

1985
Isomorphic factorizations X: Unsolved problems.
Journal of Graph Theory, 1985

1984
The rediscovery of Redfield's papers.
Journal of Graph Theory, 1984

Redfield's lost paper in a modern context.
Journal of Graph Theory, 1984

Isomorphic factorizations VIII: Bisectable trees.
Combinatorica, 1984

1983
Numbers of cubic graphs.
Journal of Graph Theory, 1983

Local connectivity of a random graph.
Journal of Graph Theory, 1983

1982
Counting bridgeless graphs.
J. Comb. Theory, Ser. B, 1982

Enumeration of labelled multigraphs by degree parities.
Discrete Mathematics, 1982

1981
Degrees Joining to 0?
J. Symb. Log., 1981

1977
Counting cubic graphs.
Journal of Graph Theory, 1977

Counting strong digraphs.
Journal of Graph Theory, 1977

The divisibility theorem for isomorphic factorizations of complete graphs.
Journal of Graph Theory, 1977

Enumeration of graphs with signed points and lines.
Journal of Graph Theory, 1977

1975
The distribution of degrees in a large random tree.
Discrete Mathematics, 1975

1974
Efficiency of a Binary Comparison Storage Technique.
J. ACM, 1974

1967
Simplicity of Recursively Enumerable Sets.
J. Symb. Log., 1967


  Loading...