Robert W. Robinson

Tianming Liu

Proceedings of the 8th IEEE International Symposium on Biomedical Imaging: From Nano to Macro, 2011

2010

Asymptotic enumeration of correlation-immune boolean functions.

[BibT_eX]

[DOI]

E. Rodney Canfield

Zhicheng Gao

Catherine S. Greenhill

Brendan D. McKay

Cryptogr. Commun., 2010

2009

Virtual craniofacial reconstruction using computer vision, graph theory and geometric constraints.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2009

Virtual multi-fracture craniofacial reconstruction using computer vision and graph matching.

[BibT_eX]

[DOI]

Comput. Medical Imaging Graph., 2009

2007

Counting labeled general cubic graphs.

[BibT_eX]

[DOI]

Gab-Byung Chae

Discret. Math., 2007

Novel Graph Theoretic Enhancements to Icp-Based Virtual Craniofacial Reconstruction.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Image Processing, 2006

2003

The asymptotic number of claw-free cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2003

2002

Counting Claw-Free Cubic Graphs.

[BibT_eX]

[DOI]

Ronald C. Read

SIAM J. Discret. Math., 2002

2001

Hamilton cycles containing randomly selected edges in random regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

1998

Asymptotic Enumeration of Eulerian Circuits in the Complete Graph.

[BibT_eX]

[DOI]

Brendan D. McKay

Comb. Probab. Comput., 1998

1997

1-Factorizations of random regular graphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

1996

Generating and Counting Hamilton Cycles in Random Regular Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1996

1994

Almost All Regular Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

Minimum degree games for graphs.

[BibT_eX]

[DOI]

Daniel M. Gordon

Discret. Math., 1994

Using the Genetic Algorithm to Find Snake-in-the-Box Codes.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Timothy R. S. Walsh

J. Comb. Theory, Ser. B, 1993

1992

Almost All Cubic Graphs Are Hamiltonian.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1992

1990

Asymptotic number of symmetries in locally restricted trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

1988

The asymptotic number of acyclic digraphs, II.

[BibT_eX]

[DOI]

Edward A. Bender

J. Comb. Theory, Ser. B, 1988

The asymptotic number of tree-rooted maps on a surface.

[BibT_eX]

[DOI]

Edward A. Bender

E. Rodney Canfield

J. Comb. Theory, Ser. A, 1988

Enumerating phylogenetic trees with multiple labels.

[BibT_eX]

[DOI]

Les R. Foulds

Discret. Math., 1988

1986

The asymptotic number of acyclic diagraphs I.

[BibT_eX]

[DOI]

Comb., 1986

1985

Isomorphic factorizations X: Unsolved problems.

[BibT_eX]

[DOI]

J. Graph Theory, 1985

1984

The rediscovery of Redfield's papers.

[BibT_eX]

[DOI]

J. Graph Theory, 1984

Redfield's lost paper in a modern context.

[BibT_eX]

[DOI]

J. I. Hall

J. Graph Theory, 1984

Isomorphic factorizations VIII: Bisectable trees.

[BibT_eX]

[DOI]

Comb., 1984

1983

Numbers of cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1983

Local connectivity of a random graph.

[BibT_eX]

[DOI]

Paul Erdös

J. Graph Theory, 1983

1982

Counting bridgeless graphs.

[BibT_eX]

[DOI]

Philip J. Hanlon

J. Comb. Theory, Ser. B, 1982

Enumeration of labelled multigraphs by degree parities.

[BibT_eX]

[DOI]

Ronald C. Read

Discret. Math., 1982

1981

Degrees Joining to 0?

[BibT_eX]

[DOI]

David B. Posner

J. Symb. Log., 1981

1977

Counting cubic graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

Counting strong digraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

The divisibility theorem for isomorphic factorizations of complete graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

Enumeration of graphs with signed points and lines.

[BibT_eX]

[DOI]

J. Graph Theory, 1977

1975

The distribution of degrees in a large random tree.

[BibT_eX]

[DOI]

Allen J. Schwenk

Discret. Math., 1975

1974

Efficiency of a Binary Comparison Storage Technique.

[BibT_eX]

[DOI]

M. A. Rahimi

J. ACM, 1974

1967

Simplicity of Recursively Enumerable Sets.

[BibT_eX]

[DOI]