The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ortrud Oellermann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
    Bounds on the Total Redundance and Efficiency of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:54, n:, pp:- [Journal]
  2. Michael A. Henning, Ortrud Oellermann
    Metric-Locating-Dominating Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  3. Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert
    on the Steiner Median of a Tree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:3, pp:249-258 [Journal]
  4. Gary Chartrand, Linda Eroh, Mark A. Johnson, Ortrud Oellermann
    Resolvability in graphs and the metric dimension of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:105, n:1-3, pp:99-113 [Journal]
  5. Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
    Augmenting trees so that every three vertices lie on a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:145-159 [Journal]
  6. Peter Dankelmann, Ortrud Oellermann
    Bounds on the average connectivity of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:129, n:2-3, pp:305-318 [Journal]
  7. Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu
    Minimum average distance of strong orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:204-212 [Journal]
  8. Peter Dankelmann, Henda C. Swart, Ortrud Oellermann
    On the Average Steiner Distance of Graphs with Prescribed Properties. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:91-103 [Journal]
  9. Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart
    An Algorithm to Find Two Distance Domination Parameters in a Graph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:85-91 [Journal]
  10. Michael A. Henning, Ortrud Oellermann
    The average connectivity of a digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:143-153 [Journal]
  11. Ewa Kubicka, Grzegorz Kubicki, Ortrud Oellermann
    Steiner Intervals in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:81, n:1-3, pp:181-190 [Journal]
  12. Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert
    The average connectivity of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:31-45 [Journal]
  13. Linda Eroh, Ortrud Oellermann
    Bipartite rainbow Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:277, n:1-3, pp:57-72 [Journal]
  14. Michael A. Henning, Ortrud Oellermann
    The upper domination Ramsey number u(3, 3, 3). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:103-113 [Journal]
  15. Michael A. Henning, Ortrud Oellermann
    On upper domination Ramsey numbers for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:274, n:1-3, pp:125-135 [Journal]
  16. Ortrud Oellermann, Jeremy Spinrad
    A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:3, pp:149-154 [Journal]
  17. David P. Day, Ortrud Oellermann, Henda C. Swart
    A characterization of 3-Steiner distance hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:4, pp:243-253 [Journal]
  18. Ortrud Oellermann
    On Steiner centers and Steiner medians of graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:258-263 [Journal]
  19. Gary Chartrand, Héctor Hevia, Ortrud Oellermann, Farrokh Saba, A. Schwenk
    A Matter of Degree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:4, pp:456-466 [Journal]
  20. David P. Day, Ortrud Oellermann, Henda C. Swart
    Steiner Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:437-442 [Journal]

Search in 0.002secs, Finished in 0.003secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002