The SCEAS System
| |||||||

## Search the dblp DataBase
Sandra Mitchell Hedetniemi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
**On**[Citation Graph (0, 0)][DBLP]*k*-dependent domination. Discrete Mathematics, 2002, v:249, n:1-3, pp:83-94 [Journal] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] - 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] **Braodcast Chromatic Numbers of Graphs.**[Citation Graph (, )][DBLP]
Search in 0.318secs, Finished in 0.319secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |