default search action
Robert W. Robinson
Person information
- affiliation: University of Georgia, Athens, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j36]Ahmad Al-Omari
, James Griffith, Ashley Scruse, Robert W. Robinson
Ensemble Methods for Identifying RNA Operons and Regulons in the Clock Network of Neurospora Crassa. IEEE Access 10: 32510-32524 (2022)
2010 – 2019
- 2011
- [c4]Ananda S. Chowdhury
Detection of hairline mandibular fracture using max-flow min-cut and Kolmogorov-Smirnov distance. ISBI 2011: 1962-1965 - 2010
- [j35]E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay
Asymptotic enumeration of correlation-immune boolean functions. Cryptogr. Commun. 2(1): 111-126 (2010)
2000 – 2009
- 2009
- [j34]Ananda S. Chowdhury
Virtual multi-fracture craniofacial reconstruction using computer vision and graph matching. Comput. Medical Imaging Graph. 33(5): 333-342 (2009) - [j33]Ananda S. Chowdhury
Virtual craniofacial reconstruction using computer vision, graph theory and geometric constraints. Pattern Recognit. Lett. 30(10): 931-938 (2009) - [i1]E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson:
Asymptotic enumeration of correlation-immune boolean functions. IACR Cryptol. ePrint Arch. 2009: 460 (2009) - 2007
- [j32]Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinson:
Counting labeled general cubic graphs. Discret. Math. 307(23): 2979-2992 (2007) - [c3]Ananda S. Chowdhury
Novel Graph Theoretic Enhancements to Icp-Based Virtual Craniofacial Reconstruction. ISBI 2007: 1136-1139 - 2006
- [c2]Ananda S. Chowdhury
Virtual Craniofacial Reconstruction from Computed Tomography Image Sequences Exhibiting Multiple Fractures. ICIP 2006: 1173-1176 - 2003
- [j31]Brendan D. McKay
The asymptotic number of claw-free cubic graphs. Discret. Math. 272(1): 107-118 (2003) - 2002
- [j30]Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
Counting Claw-Free Cubic Graphs. SIAM J. Discret. Math. 16(1): 65-73 (2002) - 2001
- [j29]Robert W. Robinson, Nicholas C. Wormald:
Hamilton cycles containing randomly selected edges in random regular graphs. Random Struct. Algorithms 19(2): 128-147 (2001)
1990 – 1999
- 1998
- [j28]Brendan D. McKay, Robert W. Robinson:
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph. Comb. Probab. Comput. 7(4): 437-449 (1998) - 1997
- [j27]Michael 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
- [j26]Alan M. Frieze
Generating and Counting Hamilton Cycles in Random Regular Graphs. J. Algorithms 21(1): 176-198 (1996) - 1994
- [j25]Daniel M. Gordon, Robert W. Robinson, Frank Harary:
Minimum degree games for graphs. Discret. Math. 128(1-3): 151-163 (1994) - [j24]Robert W. Robinson, Nicholas C. Wormald:
Almost All Regular Graphs Are Hamiltonian. Random Struct. Algorithms 5(2): 363-374 (1994) - [c1]Walter D. Potter, Robert W. Robinson, John A. Miller, Krys J. Kochut, D. Z. Redys:
Using the Genetic Algorithm to Find Snake-in-the-Box Codes. IEA/AIE 1994: 421-426 - 1993
- [j23]Robert W. Robinson, Timothy R. S. Walsh:
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs. J. Comb. Theory B 57(2): 289-308 (1993) - 1992
- [j22]Robert W. Robinson, Nicholas C. Wormald:
Almost All Cubic Graphs Are Hamiltonian. Random Struct. Algorithms 3(2): 117-126 (1992) - 1990
- [j21]J. W. Kennedy, K. A. McKeon, Edgar M. Palmer, Robert W. Robinson:
Asymptotic number of symmetries in locally restricted trees. Discret. Appl. Math. 26(1): 121-124 (1990)
1980 – 1989
- 1988
- [j20]Les R. Foulds, Robert W. Robinson:
Enumerating phylogenetic trees with multiple labels. Discret. Math. 72(1-3): 129-139 (1988) - [j19]Edward A. Bender, Robert W. Robinson:
The asymptotic number of acyclic digraphs, II. J. Comb. Theory B 44(3): 363-369 (1988) - [j18]Edward A. Bender, E. Rodney Canfield, Robert W. Robinson:
The asymptotic number of tree-rooted maps on a surface. J. Comb. Theory A 48(2): 156-164 (1988) - 1986
- [j17]Edward A. Bender, L. Bruce Richmond, Robert W. Robinson, Nicholas C. Wormald:
The asymptotic number of acyclic diagraphs I. Comb. 6(1): 15-22 (1986) - 1985
- [j16]Frank Harary, Robert W. Robinson:
Isomorphic factorizations X: Unsolved problems. J. Graph Theory 9(1): 67-86 (1985) - 1984
- [j15]Frank Harary, Robert W. Robinson:
Isomorphic factorizations VIII: Bisectable trees. Comb. 4(2): 169-179 (1984) - [j14]Frank Harary, Robert W. Robinson:
The rediscovery of Redfield's papers. J. Graph Theory 8(2): 191-193 (1984) - [j13]J. I. Hall, Edgar M. Palmer, Robert W. Robinson:
Redfield's lost paper in a modern context. J. Graph Theory 8(2): 225-240 (1984) - 1983
- [j12]Paul Erdös, Edgar M. Palmer, Robert W. Robinson:
Local connectivity of a random graph. J. Graph Theory 7(4): 411-417 (1983) - [j11]Robert W. Robinson, Nicholas C. Wormald:
Numbers of cubic graphs. J. Graph Theory 7(4): 463-467 (1983) - 1982
- [j10]Ronald C. Read, Robert W. Robinson:
Enumeration of labelled multigraphs by degree parities. Discret. Math. 42(1): 99-105 (1982) - [j9]Philip J. Hanlon, Robert W. Robinson:
Counting bridgeless graphs. J. Comb. Theory B 33(3): 276-305 (1982) - 1981
- [j8]David B. Posner, Robert W. Robinson:
Degrees Joining to 0? J. Symb. Log. 46(4): 714-722 (1981)
1970 – 1979
- 1977
- [j7]Frank Harary, Robert W. Robinson, Nicholas C. Wormald:
The divisibility theorem for isomorphic factorizations of complete graphs. J. Graph Theory 1(2): 187-188 (1977) - [j6]Robert W. Robinson:
Counting strong digraphs. J. Graph Theory 1(2): 189-190 (1977) - [j5]Robert W. Robinson:
Counting cubic graphs. J. Graph Theory 1(3): 285-286 (1977) - [j4]Frank Harary, Edgar M. Palmer, Robert W. Robinson, Allen J. Schwenk:
Enumeration of graphs with signed points and lines. J. Graph Theory 1(4): 295-308 (1977) - 1975
- [j3]Robert W. Robinson, Allen J. Schwenk:
The distribution of degrees in a large random tree. Discret. Math. 12(4): 359-372 (1975) - 1974
- [j2]Edgar M. Palmer, M. A. Rahimi, Robert W. Robinson:
Efficiency of a Binary Comparison Storage Technique. J. ACM 21(3): 376-384 (1974)
1960 – 1969
- 1967
- [j1]Robert W. Robinson:
Simplicity of Recursively Enumerable Sets. J. Symb. Log. 32(2): 162-172 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: