2008 |
23 | | Wayne Goddard,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
John M. Harris,
Douglas F. Rall:
Braodcast Chromatic Numbers of Graphs.
Ars Comb. 86: (2008) |
2006 |
22 | EE | Jean E. Dunbar,
David J. Erwin,
Teresa W. Haynes,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi:
Broadcasts in graphs.
Discrete Applied Mathematics 154(1): 59-75 (2006) |
2005 |
21 | EE | Wayne Goddard,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Renu Laskar:
Generalized subgraph-restricted matchings in graphs.
Discrete Mathematics 293(1-3): 129-138 (2005) |
2004 |
20 | EE | Ernest J. Cockayne,
Paul A. Dreyer Jr.,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi:
Roman domination in graphs.
Discrete Mathematics 278(1-3): 11-22 (2004) |
19 | EE | Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Alice A. McRae,
Dee Parks,
Jan Arne Telle:
Iterated colorings of graphs.
Discrete Mathematics 278(1-3): 81-108 (2004) |
2002 |
18 | EE | Odile Favaron,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Douglas F. Rall:
On k-dependent domination.
Discrete Mathematics 249(1-3): 83-94 (2002) |
17 | EE | Teresa W. Haynes,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Michael A. Henning:
Domination in Graphs Applied to Electric Power Networks.
SIAM J. Discrete Math. 15(4): 519-529 (2002) |
2000 |
16 | EE | Ashraf M. Abdelbar,
Stephen T. Hedetniemi,
Sandra Mitchell Hedetniemi:
The complexity of approximating MAPs for belief networks with bounded probabilities.
Artif. Intell. 124(2): 283-288 (2000) |
15 | EE | Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Douglas F. Rall:
Acyclic domination.
Discrete Mathematics 222(1-3): 151-165 (2000) |
1999 |
14 | EE | Gerd Fricke,
Teresa W. Haynes,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Michael A. Henning:
On perfect neighborhood sets in graphs.
Discrete Mathematics 199(1-3): 221-225 (1999) |
1998 |
13 | EE | Ashraf M. Abdelbar,
Sandra Mitchell Hedetniemi:
Approximating MAPs for Belief Networks is NP-Hard and Other Theorems.
Artif. Intell. 102(1): 21-38 (1998) |
12 | EE | Ernest J. Cockayne,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Christina M. Mynhardt:
Irredundant and perfect neighbourhood sets in trees.
Discrete Mathematics 188(1-3): 253-260 (1998) |
1997 |
11 | EE | Jing-Ho Yan,
Gerard J. Chang,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi:
k-Path Partitions in Trees.
Discrete Applied Mathematics 78(1-3): 227-233 (1997) |
10 | EE | Ernest J. Cockayne,
Johannes H. Hattingh,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Alice A. McRae:
Using maximality and minimality conditions to construct inequality chains.
Discrete Mathematics 176(1-3): 43-61 (1997) |
1995 |
9 | EE | Jean E. Dunbar,
Frederick C. Harris Jr.,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Alice A. McRae,
Renu C. Laskar:
Nearly perfect sets in graphs.
Discrete Mathematics 138(1-3): 229-246 (1995) |
1993 |
8 | | Marshall W. Bern,
Herbert Edelsbrunner,
David Eppstein,
Sandra L. Mitchell,
Tiow Seng Tan:
Edge Insertion for Optimal Triangulations.
Discrete & Computational Geometry 10: 47-65 (1993) |
1992 |
7 | | Marshall W. Bern,
Herbert Edelsbrunner,
David Eppstein,
Sandra L. Mitchell,
Tiow Seng Tan:
Edge Insertion for Optional Triangulations.
LATIN 1992: 46-60 |
1985 |
6 | EE | Sandra Mitchell Hedetniemi,
Andrzej Proskurowski,
Maciej M. Syslo:
Interior graphs of maximal outerplane graphs.
J. Comb. Theory, Ser. B 38(2): 156-167 (1985) |
1980 |
5 | | Terry Beyer,
Sandra Mitchell Hedetniemi:
Constant Time Generation of Rooted Trees.
SIAM J. Comput. 9(4): 706-712 (1980) |
1979 |
4 | | Sandra L. Mitchell,
Stephen T. Hedetniemi:
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs.
Inf. Process. Lett. 9(3): 110-112 (1979) |
3 | | Sandra L. Mitchell:
Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs.
Inf. Process. Lett. 9(5): 229-232 (1979) |
2 | EE | Sandra L. Mitchell,
Terry Beyer,
W. Jones:
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs.
J. ACM 26(4): 603-610 (1979) |
1 | | Sandra L. Mitchell,
Ernest J. Cockayne,
Stephen T. Hedetniemi:
Linear Algorithms on Recursive Representations of Trees.
J. Comput. Syst. Sci. 18(1): 76-85 (1979) |