The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert E. Jamison: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Pokrass Jacobs, Robert E. Jamison, Alice A. McRae
    On the complexity of sign-nonsingularity and equal unions of sets. [Citation Graph (0, 0)][DBLP]
    ACM Southeast Regional Conference, 2000, pp:232-234 [Conf]
  2. Robert E. Jamison, Beth Novick
    On a Contraction-Expansion Closure in Graphs. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2000, pp:113-119 [Conf]
  3. Robert E. Jamison, John L. Pfaltz
    Closure Systems and their Structure. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 2000, pp:121-132 [Conf]
  4. Robert E. Jamison
    Transforming Toric Digraphs. [Citation Graph (0, 0)][DBLP]
    AGTIVE, 2003, pp:328-333 [Conf]
  5. Robert E. Jamison, John L. Pfaltz
    Closure spaces that are not uniquely generated. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:147, n:1, pp:69-79 [Journal]
  6. Douglas R. Shier, E. J. Valvo, Robert E. Jamison
    Generating the States of a Binary Stochastic System. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:489-500 [Journal]
  7. Robert E. Jamison
    Direction Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:249-254 [Journal]
  8. David Pokrass Jacobs, Robert E. Jamison
    A note on equal unions in families of sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:241, n:1-3, pp:387-393 [Journal]
  9. Robert E. Jamison
    The Helly bound for singular sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:117-133 [Journal]
  10. Robert E. Jamison, Peter D. Johnson Jr.
    The structure of (t, r)-regular graphs of large order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:2-3, pp:297-300 [Journal]
  11. Robert E. Jamison, Henry Martyn Mulder
    Tolerance intersection graphs on binary trees with constant tolerance 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:215, n:, pp:115-131 [Journal]
  12. Robert E. Jamison, Henry Martyn Mulder
    Constant tolerance intersection graphs of subtrees of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:1, pp:27-46 [Journal]
  13. Robert E. Jamison, Fred R. McMorris, Henry Martyn Mulder
    Graphs with only caterpillars as spanning trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:1, pp:81-95 [Journal]
  14. Maria Axenovich, Robert E. Jamison
    Canonical Pattern Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:145-160 [Journal]
  15. Robert E. Jamison, Douglas B. West
    On Pattern Ramsey Numbers of Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:3, pp:333-339 [Journal]
  16. Robert E. Jamison, Gretchen L. Matthews, John Villalpando
    Acyclic colorings of products of trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:1, pp:7-12 [Journal]
  17. John L. Pfaltz, Robert E. Jamison
    Closure systems and their structure. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:139, n:3-4, pp:275-286 [Journal]
  18. David Pokrass Jacobs, Robert E. Jamison
    Complexity of Recognizing Equal Unions in Families of Sets. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:495-504 [Journal]
  19. Martin Charles Golumbic, Robert E. Jamison
    The edge intersection graphs of paths in a tree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:1, pp:8-22 [Journal]
  20. Robert E. Jamison
    Covering Finite Fields with Cosets of Subspaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:3, pp:253-266 [Journal]
  21. Robert E. Jamison
    On the average number of nodes in a subtree of a tree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1983, v:35, n:3, pp:207-223 [Journal]
  22. Robert E. Jamison
    Monotonicity of the mean order of subtrees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:70-78 [Journal]
  23. David Pokrass Jacobs, Robert E. Jamison
    Polynomial recognition of equal unions in hypergraphs with few vertices of large degree. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:201-208 [Journal]
  24. Martin Charles Golumbic, Robert E. Jamison
    Rank-tolerance graph classes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:4, pp:317-340 [Journal]
  25. Robert E. Jamison, Richard J. Nowakowski
    A Helly theorem for convexity in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:35-39 [Journal]
  26. Martin Charles Golumbic, Robert E. Jamison
    Edge and vertex intersection of paths in a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:151-159 [Journal]
  27. Robert E. Jamison
    Few slopes without collinearity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:199-206 [Journal]
  28. Martin Farber, Robert E. Jamison
    On local convexity in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:231-247 [Journal]
  29. Robert E. Jamison
    Alternating Whitney sums and matchings in trees, part 1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:2, pp:177-189 [Journal]
  30. Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
    The subchromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:33-49 [Journal]
  31. Robert E. Jamison
    On the edge achromatic numbers of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:99-115 [Journal]
  32. Robert E. Jamison
    Alternating Whitney sums and matchings in trees, part II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:79, n:2, pp:177-189 [Journal]

  33. Turán theorems and convexity invariants for directed graphs. [Citation Graph (, )][DBLP]


Search in 0.034secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002