default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandra Mitchell Hedetniemi
Person information
- affiliation: Clemson University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j33]Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae:
A Roman Domination Chain. Graphs Comb. 32(1): 79-92 (2016)- 2013
- [j32]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, K. E. Kennedy, Alice A. McRae:
Self-stabilizing Algorithms for Unfriendly Partitions into Two Disjoint Dominating Sets. Parallel Process. Lett. 23(1) (2013) - 2012
- [j31]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Hao Jiang, Ken Kennedy, Alice A. McRae:
A self-stabilizing algorithm for optimally efficient sets in graphs. Inf. Process. Lett. 112(16): 621-623 (2012) - 2011
- [j30]Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae:
Matchability and k-maximal matchings. Discret. Appl. Math. 159(1): 15-22 (2011) - [j29]Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson:
γ-graphs of graphs. Discuss. Math. Graph Theory 31(3): 517-531 (2011) - 2008
- [j28]Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall:
Braodcast Chromatic Numbers of Graphs. Ars Comb. 86 (2008) - 2006
- [j27]Jean E. Dunbar, David J. Erwin
, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Broadcasts in graphs. Discret. Appl. Math. 154(1): 59-75 (2006) - 2005
- [j26]Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar:
Generalized subgraph-restricted matchings in graphs. Discret. Math. 293(1-3): 129-138 (2005) - 2004
- [j25]K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and irredundance in tournaments. Australas. J Comb. 29: 157-172 (2004) - [j24]Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Roman domination in graphs. Discret. Math. 278(1-3): 11-22 (2004) - [j23]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle:
Iterated colorings of graphs. Discret. Math. 278(1-3): 81-108 (2004) - [j22]Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs:
Offensive alliances in graphs. Discuss. Math. Graph Theory 24(2): 263-175 (2004) - 2002
- [j21]Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
On k-dependent domination. Discret. Math. 249(1-3): 83-94 (2002) - [j20]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
Domination in Graphs Applied to Electric Power Networks. SIAM J. Discret. Math. 15(4): 519-529 (2002) - 2001
- [j19]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe:
Domination Subdivision Numbers. Discuss. Math. Graph Theory 21(2): 239-253 (2001) - 2000
- [j18]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) - [j17]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
Acyclic domination. Discret. Math. 222(1-3): 151-165 (2000) - [j16]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and independence subdivision numbers of graphs. Discuss. Math. Graph Theory 20(2): 271-280 (2000) - 1999
- [j15]Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
On perfect neighborhood sets in graphs. Discret. Math. 199(1-3): 221-225 (1999) - 1998
- [j14]Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi:
Approximating MAPs for Belief Networks is NP-Hard and Other Theorems. Artif. Intell. 102(1): 21-38 (1998) - [j13]Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt:
Irredundant and perfect neighbourhood sets in trees. Discret. Math. 188(1-3): 253-260 (1998) - 1997
- [j12]Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
k-Path Partitions in Trees. Discret. Appl. Math. 78(1-3): 227-233 (1997) - [j11]Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae:
Using maximality and minimality conditions to construct inequality chains. Discret. Math. 176(1-3): 43-61 (1997) - 1995
- [j10]Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar:
Nearly perfect sets in graphs. Discret. Math. 138(1-3): 229-246 (1995) - 1988
- [j9]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman:
A survey of gossiping and broadcasting in communication networks. Networks 18(4): 319-349 (1988) - 1985
- [j8]Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo:
Interior graphs of maximal outerplane graphs. J. Comb. Theory B 38(2): 156-167 (1985) - 1980
- [j7]Terry Beyer, Sandra Mitchell Hedetniemi:
Constant Time Generation of Rooted Trees. SIAM J. Comput. 9(4): 706-712 (1980) - [j6]Arthur M. Farley, Stephen T. Hedetniemi, Sandra L. Mitchell:
Rectilinear Steiner Trees in Rectangle Trees. SIAM J. Algebraic Discret. Methods 1(1): 70-81 (1980) - 1979
- [j5]Sandra L. Mitchell, Stephen T. Hedetniemi:
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. Inf. Process. Lett. 9(3): 110-112 (1979) - [j4]Sandra L. Mitchell:
Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs. Inf. Process. Lett. 9(5): 229-232 (1979) - [j3]Terry Beyer, W. Jones, Sandra L. Mitchell:
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs. J. ACM 26(4): 603-610 (1979) - [j2]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) - 1978
- [j1]Sandra L. Mitchell:
Another characterization of the centroid of a tree. Discret. Math. 24(3): 277-280 (1978)
Conference and Workshop Papers
- 1997
- [c1]Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi:
A parallel hybrid genetic algorithm simulated annealing approach to finding most probable explanations on Bayesian belief networks. ICNN 1997: 450-455
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
