CURRICULUM VITAE

Robert W. Robinson

 

Address:

 Computer Science Department
415 Graduate Studies Research Center
University of Georgia
Athens, Georgia 30602-7404

Contact:

 e-mail – rwr@cs.uga.edu
web – http://www.cs.uga.edu/~rwr
office – 706-542-3482
fax – 706-542-2966

Education:

 Ph.D. 1966 Cornell University, Ithaca, NY (Mathematics)
A.M. 1963 Dartmouth College, Hanover, NH (Physics)
A.B. 1963 Dartmouth College, Hanover, NH (Mathematics)

Professional Experience:

1984 – present; Professor of Computer Science, University of Georgia, Athens, GA

Head, Department of Computer Science, 1984-1993

1982 – 1984; Professor, Departments of Mathematics and Computer Science, Southern Illinois

University, Carbondale, IL

1974 – 1982; Professor of Mathematics, Newcastle University, NSW, Australia

Dean, Faculty of Mathematics, 1978 and 1979
Head, Department of Mathematics, 1976 and 1977

1972 – 1974; Visiting Assistant Professor, University of Michigan, Ann Arbor, MI

1967 – 1972; Assistant Professor, University of California at Berkeley, CA

1966 – 1967; N.S.F Postdoctoral Fellow, Institute for Advanced Study, Princeton, NJ

Graduate Students Supervised (last five years):

 Ramyaa, MS, August 2004: "Finding Hamilton Cycles in Cubic Digraphs and Restricted Cayley Digraphs"
Feng Sun, MS, May 2003: "A New Linear Algorithm for Checking a Graph for 3-Edge-Connectivity"
Weiwei Zhong, MS, May 2003: "Using Traveling Salesman Problem Algorithms to Determine Multiple Sequence Alignment Orders"
Dongsheng Che, MS, December 2002: "Application of Efficient External Memory Algorithms to Simulated Web Graphs"
Rubao Ji, MS, December 2002: "Dynamic Connectivity Algorithms for Feynman Diagrams"
Jianping Zhu, MS, December 2002: "A Fast Algorithm to Determine Minimality of Strongly Connected Digraphs"
Huantian Cao, MS, May 2002: "AutoGF: An Automated System to Calculate Coefficients of Generating Functions"
Xuting Wang, MS, May 2002: "Multiple Sequence Alignment Using Traveling Salesman Problem Algorithms"
Qun Wang, MS, December 2001: "Reducibility and Flows on Feynman Diagrams"
Jonathan Myers, MS, August 2001: "Computation of Overlap Graph for DNA Fragments"
Zhangyun Chen, MS, August 2001: "A Linear Time Algorithm for Testing a Graph for 3-Edge-Connectivity"
Mei Xue, MS, May 2001: "Finding Hamilton Cycles in Cubic Graphs"
Junfeng Qu, MS, December 2000: "Simulation of Random Maximal Circuits in Complete Graphs"
Sridar Pootheri, MS, May 2000: "Counting Classes of Labeled 2-Connected Graphs"
Sridar Pootheri, PhD (Math), May 2000: "Characterizing and Counting Classes of Unlabeled 2-Connected Graphs"
Kiran Bhogadi, MS, December 1999: "Decomposition and Generation of Minimal Strongly Connected Digraphs"
Xiaohui Cai, MS, December 1998: "Efficient Connectivity Algorithms for Small Dense Graphs"
Susan Mayhorn, MS, August 1998: "Construction of Minimally Strongly Connected Digraphs"

Research Grant (last five years):

National Science Foundation Information Technology Research Program, "ITR/ACS: Stochastic Summation of High-Order Feynman Graph Expansions", (PI: Bernd Schuttler, Co-PIs: David Lowenthal, R. W. Robinson, and Jem Corcoran), September 2000-August 2003, $487,000. (CS portion – approximately $236,195.00)

Professional Activities (last five years):

 Editorial Board, Involve, a Journal of Mathematics, 2007-present.
Organizing Committee, SIAM/ACM workshop on Algorithms for Listing Counting and Enumeration, Baltimore, MD, January 2003.
Editorial Board, J. Combinatorial Mathematics and Combinatorial Computing, 1987-present.

Referee for papers or proposals (last five years):

National Science Foundation; Journal of Integer Sequences; SIAM Journal for Discrete Mathematics; Journal of Graph Theory; Discrete Mathematics; Australasian Journal of Combinatorics; Journal of Algebraic Combinatorics; Proceedings of the Eighth International Conference on Graph Theory, Combinatorics, Algorithms, and Applications.

Memberships and Honors:

Graduate Faculty of The University of Georgia; American Mathematical Society; Association for Computing Machinery; Combinatorial Society of Australasia; Phi Beta Kappa; Institute of Combinatorics and its Applications (Foundation Fellow).

Invited Conference Talks (last five years):

 "Counting Unrooted Maps of all Genera", 20th Clemson Mini-Conference on Discrete Mathematics and Related Fields, Clemson, SC, October 2005.
"Finding Hamilton Cycles in Random Cubic Graphs", Session on Random Graphs and their Applications, Canadian Math. Soc. Summer 2005 Meeting, Waterloo, Ontario, Canada, June 2005.
"Subsequence Counting and Statistics", 17th Cumberland Conference on Combinatorics, Graph Theory and Computing, Murfreesboro, TN, May 2004.
"Generating Feynman Diagrams", 16th Cumberland Conference on Combinatorics, Graph Theory and Computing, Atlanta, GA, May 2003.
"Counting Irreducible Feynman Diagrams Exactly and Asymptotically", Special Session on Combinatorics and Graph Theory, American Math. Soc. Sectional Meeting, Atlanta, GA, March 2002.
"Counting Identity Graphs and Digraphs of Minimum Size", Conference on Horizons in Combinatorics, Nashville, TN, May 2001.

Publications:
  1. (with E.M. Palmer) The matrix group of two permutation groups, Bull. Amer. Math. Soc. 73 (1967), 204-207.
  2. Simplicity of recursively enumerable sets, J. Symbolic Logic 32 (1967), 162-172.
  3. Two theorems on hyperhypersimple sets, Trans. Amer. Math. Soc. 128 (1967), 531-538.
  4. Enumeration of colored graphs, J. Combin. Theory 4 (1968), 181-190.
  5. A dichotomy of the recursively enumerable sets, Z. Math. Logik Grundlag. Math. 14 (1968), 339-356.
  6. (with F. Harary and S. T. Hedetniemi) Uniquely colorable graphs, J. Combin. Theory 6 (1969), 264-270.
  7. Enumeration of Euler graphs, Proof Techniques in Graph Theory (F. Harary, ed.), Academic Press, New York (1969), 147-153.
  8. Enumeration of non-separable graphs, J. Combin. Theory 9 (1970), 327-356.
  9. Enumeration of acyclic digraphs, Proc. Second Chapel Hill Conf. on Combinatorial Mathematics and its Appl., Univ. North Carolina, Chapel Hill (1970), 391-399.
  10. Interpolation and embedding in the recursively enumerable degrees, Ann. of Math. (2) 93 (1971), 285-314.
  11. Jump restricted interpolation in the recursively enumerable degrees, Ann. of Math. (2) 93 (1971), 586-596.
  12. Counting labeled acyclic digraphs, New Directions in the Theory of Graphs (F. Harary, ed.), Academic Press, New York (1973), 239-273.
  13. (with E. M. Palmer) Enumeration under two representations of the wreath product, Acta Math. 131 (1973), 123-143.
  14. (with E. M. Palmer) On the number of phenotype structures in genetic systems, Bull. Math. Biol. 36 (1974), 325-338.
  15. (with E. M. Palmer and M. A. Rahimi) Efficiency of a binary comparison storage technique, J. Assoc. Comput. Mach. 21 (1974), 376-384.
  16. (with F. Harary) Tapeworms, Rev. Belge Stat. Rech. Op. Inform. 14 (1974), 1-4.
  17. (with O. Knop and E. M. Palmer) Arrangements of charges having zero electric field gradient, Acta Cryst. A 31 (1975), 19-31; Addendum and corrigenda, 704.
  18. (with A. J. Schwenk) The distribution of degrees in a large random tree, Discrete Math. 12 (1975), 359-372.
  19. (with F. Harary and A. J. Schwenk) Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc. Ser. A. 20 (1975), 483-503; Corrigenda, 41 (1985), 325.
  20. (with F. Harary) The number of achiral trees, J. Reine Angew. Math. 278/279 (1975), 322-335.
  21. Counting arrangements of bishops, Combinatorial Mathematics IV (L.R.A. Casse and W.D. Wallis, eds.), Springer Lecture Notes in Math. 560 (1976), 198-214.
  22. (with L. J. Cummings) Linear symmetry classes, Canad. J. Math. 28 (1976), 1311-1319.
  23. (with F. Harary and A. T. Balaban) The numbers of chiral and achiral alkanes and monosubstituted alkanes, Tetrahedron 32 (1976), 355-361.
  24. (with F. Harary, E. M. Palmer and R. C. Read) Pólya's contributions to chemical enumeration, Chemical Applications of Graph Theory (A.T. Balaban, ed.), Academic Press, London (1976), 11-24.
  25. A brief history of graphical enumeration, Men and Institutions in American Mathematics, Graduate Studies, Texas Tech University, No. 13 (1976), 131.
  26. Counting unlabeled acyclic digraphs, Combinatorial Mathematics V (C.H.C. Little, ed.), Springer Lecture Notes in Math. 622 (1977), 28-43.
  27. (with P. Butler) On the Computer calculation of the number of nonseparable graphs, Proc. Second Carribbean Conf. in Combinatorics and Computing, Univ. West Indies, Barbados (1977), 191-208.
  28. (with F. Harary) Exposition of the enumeration of point-line signed graphs enjoying various dualities, Proc. Second Caribbean Conf. in Combinatorics and Computing, Univ. West Indies, Barbados (1977), 19-33.
  29. (with F. Harary, E. M. Palmer and A. J. Schwenk) Enumeration of graphs with signed points and lines, J. Graph Theory 1 (1977), 295-308.
  30. (with F. Harary and L. March) On enumerating certain design problems in terms of bicoloured graphs with no isolates, Environment and Planning B 5 (1978), 31-43.
  31. (with F. Harary and N. C. Wormald) Isomorphic factorisations I: Complete graphs, Trans. Amer. Math. Soc. 242 (1978), 243-260.
  32. (with F. Harary and N. C. Wormald) Isomorphic factorisations III: Complete multipartite graphs, Combinatorial Mathematics (D.A. Holton and J. Seberry, eds.), Springer Lecture Notes in Math. 686 (1978), 47-54.
  33. Asymptotic number of self-converse oriented graphs, Combinatorial Mathematics (D.A. Holton and J. Seberry, eds.), Springer Lecture Notes in Math. 686 (1978), 255-266.
  34. (with F. Harary and N. C. Wormald) Isomorphic factorisations V: Directed graphs, Mathematika 25 (1978), 279-285.
  35. (with F. Harary) Labeled bipartite blocks, Canad. J. Math. 31 (1979), 60-68.
  36. (with F. Harary) Generalized ramsey theory IX: Isomorphic factorizations IV: Isomorphic ramsey numbers, Pacific J. Math 80 (1979), 435-441.
  37. Isomorphic factorisations VI: Automorphisms, Combinatorial Mathematics VI (A.F. Horadam and W.D. Wallis, eds.), Springer Lecture Notes in Math. 748 (1979), 127-131.
  38. (with L. R. Foulds) Determining the asymptotic number of phylogenetic trees, Combinatorial Mathematics VII (R.W. Robinson et al., eds.) Springer Lecture Notes in Math. 829 (1980), 110-126.
  39. (co-edited with G. W. Southern and W. D. Wallis) Combinatorial Mathematics VII Lecture Notes in Math. 829, Springer, Berlin (1980), 256pp.
  40. Counting graphs with a duality property, Combinatorics (H.N.V. Temperley, ed.), London Math. Soc. Lecture Note Series 52, Cambridge (1981), 156-186.
  41. (with L. R. Foulds) Enumeration of binary phylogenetic trees, Combinatorial Mathematics VIII (K.L. McAvaney, ed.), Springer Lecture Notes in Math. 884 (1981), 187-202.
  42. (with D. Posner) Degrees joining to 0¢ , J. Symbolic Logic 46 (1981), 714-722.
  43. (with G. Gati and F. Harary) Line colored trees with extendable automorphisms, Acta Math. Sci. 2 (1982), 105-110.
  44. (with D. Madan) Monotone and 1-1 sets, J. Austral. Math. Soc. Ser. A 33 (1982), 62-75.
  45. (with R. C. Read) Enumeration of labelled multigraphs by degree parities, Discrete Math. 42 (1982), 99-105.
  46. (with P. Hanlon) Counting bridgeless graphs, J. Combin. Theory Ser. B 33 (1982), 276-305.
  47. (with P. Erdös and E. M. Palmer) Local connectivity of a random graph, J. Graph Theory 7 (1983), 411-417.
  48. (with N. C. Wormald) Numbers of cubic graphs, J. Graph Theory 7 (1983), 463-467.
  49. (with E. M. Palmer) Enumeration of self-dual configurations, Pacific J. Math. 110 (1984), 203-221.
  50. (with F. Harary) The rediscovery of Redfield's papers, J. Graph Theory 8 (1984), 191-193.
  51. (with J. I. Hall and E. M. Palmer) Redfield's lost paper in a modern context, J. Graph Theory 8 (1984), 225-240.
  52. (with F. Harary) Isomorphic factorizations VIII: Bisectable trees, Combinatorica 4 (1984), 169-179.
  53. (with L. R. Foulds) Enumeration of phylogenetic trees without points of degree two, Ars Combin. 17A (1984), 169-183.
  54. (with N. C. Wormald) Existence of long cycles in random cubic graphs, Enumeration and Design (D. M. Jackson and S. A. Vanstone, eds.), Academic Press, Toronto (1984), 251-270.
  55. (with F. Harary) Connect-it Games, College Math. J. 15 (1984), 411-419.
  56. (with L. R. Foulds) Counting certain classes of evolutionary trees with singleton labels, Congr. Numer. 44 (1984), 65-88.
  57. (with F. Harary) The diameter of a graph and its complement, Amer. Math. Monthly 92 (1985), 211-212.
  58. (with F. Harary) Isomosphic factorizations X: Unsolved problems, J. Graph Theory 9 (1985), 67-86.
  59. Counting strongly connected finite automata, Graph Theory with Applications to Algorithms and Computer Science (Y. Alavi et al., eds.), Wiley, New York (1985), 671-685.
  60. (with E. M. Palmer) Connectivity of a random m-graph, Rev. Roumaine Math. Pures Appl. 30 (1985), 229-232.
  61. (with L. B. Richmond and N. C. Wormald) On hamilton cycles in 3-connected cubic maps, Ann. Discrete Math. 27 (1985), 141-149.
  62. (with E. R. Canfield and D. H. Rouvray) Determination of the Wiener molecular branching index for the general tree, J. Comput. Chem. 6 (1985), 598-609.
  63. (with A. R. Calderbank and P. Hanlon) Partitions into even and odd block size and some unusual characters of the symmetric groups, Proc. London Math. Soc. (3) 53 (1986), 288-320.
  64. (with E. A. Bender, L. B. Richmond, and N. C. Wormald) The asymptotic number of acyclic digraphs. I, Combinatorica 6 (1986), 15-22.
  65. (with E. A. Bender) The asymptotic number of acyclic digraphs. II, J. Combin. Theory Ser. B 44 (1988), 363-369.
  66. (with E. A. Bender and E. R. Canfield) The enumeration of maps on the torus and the projective plane, Canad. Bull. Math. 31 (1988), 257-271.
  67. (with E. A. Bender and E. R. Canfield) The asymptotic number of tree-rooted maps on a surface, J. Combin. Theory Ser. A 48 (1988), 156-164.
  68. (with L. R. Foulds) Enumerating phylogenetic trees with multiple labels, Discrete Math. 72 (1988), 129-139.
  69. (with J. W. Kennedy, K. A. McKeon, and E. M. Palmer) Asymptotic number of symmetries in locally restricted trees, Discrete Appl. Math. 26 (1990), 121-124.
  70. (with S. C. Cater) Exponents of 2 in the numbers of unlabeled graphs and tournaments, Congr. Numer. 82 (1991), 139-155.
  71. (with N. C. Wormald) Almost all cubic graphs are hamiltonian, Random Structures Algorithms 3 (1992), 117-125.
  72. (with E. M. Palmer and R. C. Read) Balancing the n-cube: A census of colorings, J. Algebraic Combin. 1 (1992), 257-273.
  73. (with T. R. Walsh) Cycle index series relations for counting 2- and 3-connected graphs, Actes Atelier Combinatorie france-québecois (1991, Bordeaux; J. Labelle and J. G. Penaud, eds.), LACIM, Montreal (1992), 227-241.
  74. (with E.M. Palmer and F. Harary) Counting free binary trees admitting a given height, J. Combin. Inform. System Sci. 17 (1992), 175-181.
  75. (with T. R. Walsh) Inversion of cycle index sum relations for 2- and 3-connected graphs, J. Combin. Theory Ser. B 57 (1993), 289-308.
  76. (with S. C. Cater) Two-parts of unlabeled tournament numbers, Proc. First Estonian Conf. on Graphs and Applications (M. Kilp and U. Nummert, eds.), Tartu Univ., Tartu (1993), 62-73.
  77. (with D. M. Gordon and F. Harary) Minimum degree games for graphs, Discrete Math. 128 (1994), 151-163.
  78. (with N. C. Wormald) Almost all regular graphs are hamiltonian, Random Structures Algorithms 5 (1994), 363-374.
  79. (with W. D. Potter, J. A. Miller, K. J. Kochut, and D. Z. Redys) Using the genetic algorithm to find snake-in-the-box codes, Proc. Seventh Internat. Conf. Industrial & Engineering Appl. Artificial Intelligence and Expert Systems, Austin, Texas (1994), 421-426.
  80. Counting digraphs with restrictions on the strong components, Combinatorics and Graph Theory '95 vol. 1 (T.-H. Ku, ed.), World Scientific, Singapore (1995), 343-354.
  81. (with A. Frieze, M. R. Jerrum, M. S. O. Molloy, and N. C. Wormald) Generating and counting Hamilton cycles in random regular graphs, J. Algorithms 21 (1996), 176-198.
  82. (with M. S. O. Molloy, H. Robalewska, and N. C. Wormald) 1-factorisations of Random Regular Graphs, Random Structures Algorithms 10 (1997), 305-321.
  83. (with B. D. McKay) Asymptotic enumeration of eulerian circuits in the complete graph, Combin. Probab. Comput. 7 (1998), 437-449.
  84. (with N. C. Wormald) Hamilton cycles containing randomly selected edges in random regular graphs, Random Structures Algorithms 19 (2001), 128-147.
  85. (with F. Harary) Identity digraphs of minimum size, Congr. Numer. 152 (2001), 139-147.
  86. (with S.C. Cater and F. Harary) One-color triangle avoidance games, Congr. Numer. 153 (2001), 211-221.
  87. (with E.M. Palmer and R.C. Read) Counting claw-free cubic graphs, SIAM J. Discrete Math. 16 (2002), 65-73.
  88. (with B.D. McKay, E.M. Palmer, and R.C. Read) The asymptotic number of claw-free cubic graphs, Discrete Math. 272 (2003), 107-118.
  89. (with A. S. Chowdhury, S. M. Bhandarkar, and J. C. Yu) Virtual craniofacial reconstruction from computed tomography image sequences exhibiting multiple fractures, Proc. Thirteenth IEEE Internat. Conf. on Image Processing (ICIP), Atlanta, GA (2006), 1173-1176.
  90. (with A. S. Chowdhury, S. M. Bhandarkar, and J. C. Yu) Novel graph theoretic enhancements to ICP-based virtual craniofacial reconstruction, Proc. Fourth IEEE Symp. on Biomedical Imaging (ISBI), Metro Washington, DC (2007), 1136-1139.
  91. (with G.-B. Chae and E.M. Palmer) Counting labeled general cubic graphs, Discrete Math. 307 (2007), 2979-2992.

upback to Robinson's home page
  • last update 5 November 2007