Search the dblp DataBase

Publications of Author

1. Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi
   Approximating MAPs for Belief Networks is NP-Hard and Other Theorems. [Citation Graph (0, 0)][DBLP]
   Artif. Intell., 1998, v:102, n:1, pp:21-38 [Journal]
   
2. Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi
   The complexity of approximating MAPs for belief networks with bounded probabilities. [Citation Graph (0, 0)][DBLP]
   Artif. Intell., 2000, v:124, n:2, pp:283-288 [Journal]
   
3. Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
   Broadcasts in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:1, pp:59-75 [Journal]
   
4. Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
   k-Path Partitions in Trees. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:227-233 [Journal]
   
5. Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
   Roman domination in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:278, n:1-3, pp:11-22 [Journal]
   
6. Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
   On k-dependent domination. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2002, v:249, n:1-3, pp:83-94 [Journal]
   
7. Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar
   Generalized subgraph-restricted matchings in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:293, n:1-3, pp:129-138 [Journal]
   
8. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle
   Iterated colorings of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:278, n:1-3, pp:81-108 [Journal]
   
9. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
   Acyclic domination. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:222, n:1-3, pp:151-165 [Journal]
   
10. Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo
    Interior graphs of maximal outerplane graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:2, pp:156-167 [Journal]
    
11. Terry Beyer, Sandra Mitchell Hedetniemi
    Constant Time Generation of Rooted Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:706-712 [Journal]
    
12. Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
    Domination in Graphs Applied to Electric Power Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:519-529 [Journal]
    
13. Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
    On perfect neighborhood sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:221-225 [Journal]
    
14. Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
    Irredundant and perfect neighbourhood sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:253-260 [Journal]
    
15. Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
    Using maximality and minimality conditions to construct inequality chains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:43-61 [Journal]
    
16. Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar
    Nearly perfect sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:229-246 [Journal]
    
17. 
    Braodcast Chromatic Numbers of Graphs. [Citation Graph (, )][DBLP]