| 2008 |
|---|
| 36 | EE | Linda Eroh,
Ortrud R. Oellermann:
Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs.
Discrete Mathematics 308(18): 4212-4220 (2008) |
| 2007 |
|---|
| 35 | EE | Ortrud R. Oellermann,
Joel Peters-Fransen:
The strong metric dimension of graphs and digraphs.
Discrete Applied Mathematics 155(3): 356-364 (2007) |
| 34 | EE | Ortrud R. Oellermann,
María Luz Puertas:
Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs.
Discrete Mathematics 307(1): 88-96 (2007) |
| 2006 |
|---|
| 33 | | Ortrud R. Oellermann,
Charlene D. Pawluck,
Anna Stokke:
The Metric Dimension of Cayley Digraphs of Abelian Groups.
Ars Comb. 81: (2006) |
| 32 | EE | Melodie Fehr,
Shonda Gosselin,
Ortrud R. Oellermann:
The metric dimension of Cayley digraphs.
Discrete Mathematics 306(1): 31-41 (2006) |
| 2005 |
|---|
| 31 | | Peter Dankelmann,
Ortrud R. Oellermann:
Degree Sequences of Optimally Edge-Connected Multigraphs.
Ars Comb. 77: (2005) |
| 30 | EE | José Cáceres,
Alberto Márquez,
Ortrud R. Oellermann,
María Luz Puertas:
Rebuilding convex sets in graphs.
Discrete Mathematics 297(1-3): 26-37 (2005) |
| 2004 |
|---|
| 29 | | Michael A. Henning,
Ortrud Oellermann:
Metric-Locating-Dominating Sets in Graphs.
Ars Comb. 73: (2004) |
| 28 | EE | Michael A. Henning,
Ortrud Oellermann:
The average connectivity of a digraph.
Discrete Applied Mathematics 140(1-3): 143-153 (2004) |
| 27 | EE | Peter Dankelmann,
Ortrud Oellermann,
Jian-Liang Wu:
Minimum average distance of strong orientations of graphs.
Discrete Applied Mathematics 143(1-3): 204-212 (2004) |
| 26 | EE | Michael A. Henning,
Ortrud Oellermann:
On upper domination Ramsey numbers for graphs.
Discrete Mathematics 274(1-3): 125-135 (2004) |
| 25 | EE | Linda Eroh,
Ortrud Oellermann:
Bipartite rainbow Ramsey numbers.
Discrete Mathematics 277(1-3): 57-72 (2004) |
| 2003 |
|---|
| 24 | EE | Peter Dankelmann,
Ortrud Oellermann:
Bounds on the average connectivity of a graph.
Discrete Applied Mathematics 129(2-3): 305-318 (2003) |
| 2002 |
|---|
| 23 | | Peter Dankelmann,
Wayne Goddard,
Ortrud Oellermann,
Henda C. Swart:
Augmenting trees so that every three vertices lie on a cycle.
Discrete Applied Mathematics 116(1-2): 145-159 (2002) |
| 22 | EE | Michael A. Henning,
Ortrud Oellermann:
The upper domination Ramsey number u(3, 3, 3).
Discrete Mathematics 242(1-3): 103-113 (2002) |
| 21 | EE | Lowell W. Beineke,
Ortrud Oellermann,
Raymond E. Pippert:
The average connectivity of a graph.
Discrete Mathematics 252(1-3): 31-45 (2002) |
| 2000 |
|---|
| 20 | | Gary Chartrand,
Linda Eroh,
Mark A. Johnson,
Ortrud Oellermann:
Resolvability in graphs and the metric dimension of a graph.
Discrete Applied Mathematics 105(1-3): 99-113 (2000) |
| 19 | EE | Wayne Goddard,
Michael A. Henning,
Ortrud R. Oellermann:
Bipartite Ramsey numbers and Zarankiewicz numbers.
Discrete Mathematics 219(1-3): 85-95 (2000) |
| 1999 |
|---|
| 18 | | Wayne Goddard,
Ortrud Oellermann,
Peter J. Slater,
Henda C. Swart:
Bounds on the Total Redundance and Efficiency of a Graph.
Ars Comb. 54: (1999) |
| 17 | EE | David P. Day,
Ortrud R. Oellermann,
Henda C. Swart:
Bounds on the size of graphs of given order and up/down-connectivity.
Discrete Mathematics 197-198: 217-223 (1999) |
| 16 | EE | Ortrud Oellermann:
On Steiner centers and Steiner medians of graphs.
Networks 34(4): 258-263 (1999) |
| 1998 |
|---|
| 15 | EE | Ewa Kubicka,
Grzegorz Kubicki,
Ortrud Oellermann:
Steiner Intervals in Graphs.
Discrete Applied Mathematics 81(1-3): 181-190 (1998) |
| 1997 |
|---|
| 14 | EE | Peter Dankelmann,
Henda C. Swart,
Ortrud Oellermann:
On the Average Steiner Distance of Graphs with Prescribed Properties.
Discrete Applied Mathematics 79(1-3): 91-103 (1997) |
| 13 | EE | David P. Day,
Ortrud Oellermann,
Henda C. Swart:
A characterization of 3-Steiner distance hereditary graphs.
Networks 30(4): 243-253 (1997) |
| 1996 |
|---|
| 12 | EE | Gerd Fricke,
Michael A. Henning,
Ortrud Oellermann,
Henda C. Swart:
An Algorithm to Find Two Distance Domination Parameters in a Graph.
Discrete Applied Mathematics 68(1-2): 85-91 (1996) |
| 11 | EE | Lowell W. Beineke,
Ortrud Oellermann,
Raymond E. Pippert:
on the Steiner Median of a Tree.
Discrete Applied Mathematics 68(3): 249-258 (1996) |
| 10 | EE | Michael A. Henning,
Ortrud R. Oellermann,
Henda C. Swart:
The diversity of domination.
Discrete Mathematics 161(1-3): 161-173 (1996) |
| 9 | EE | Michael A. Henning,
Ortrud R. Oellermann,
Henda C. Swart:
Local edge domination critical graphs.
Discrete Mathematics 161(1-3): 175-184 (1996) |
| 1995 |
|---|
| 8 | EE | Ortrud Oellermann,
Jeremy Spinrad:
A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary.
Inf. Process. Lett. 55(3): 149-154 (1995) |
| 1994 |
|---|
| 7 | EE | David P. Day,
Ortrud R. Oellermann,
Henda C. Swart:
On the l-connectivity of a diagraph.
Discrete Mathematics 127(1-3): 95-104 (1994) |
| 6 | EE | Wayne Goddard,
Ortrud R. Oellermann,
Henda C. Swart:
Steiner distance stable graphs.
Discrete Mathematics 132(1-3): 65-73 (1994) |
| 5 | EE | David P. Day,
Ortrud Oellermann,
Henda C. Swart:
Steiner Distance-Hereditary Graphs.
SIAM J. Discrete Math. 7(3): 437-442 (1994) |
| 1991 |
|---|
| 4 | EE | Wayne Goddard,
Grzegorz Kubicki,
Ortrud R. Oellermann,
Songlin Tian:
On multipartite tournaments.
J. Comb. Theory, Ser. B 52(2): 284-300 (1991) |
| 1989 |
|---|
| 3 | | Gary Chartrand,
Héctor Hevia,
Ortrud Oellermann,
Farrokh Saba,
A. Schwenk:
A Matter of Degree.
SIAM J. Discrete Math. 2(4): 456-466 (1989) |
| 1988 |
|---|
| 2 | EE | Ortrud R. Oellermann:
The connected cutset connectivity of a graph.
Discrete Mathematics 69(3): 301-308 (1988) |
| 1986 |
|---|
| 1 | EE | Yousef Alavi,
Gary Chartrand,
Ortrud R. Oellermann,
Linda M. Lesniak:
Bipartite regulation numbers.
Discrete Mathematics 62(2): 113-118 (1986) |
