default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen T. Hedetniemi
Person information
- affiliation: Clemson University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j113]Teresa W. Haynes, Jason Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Coalition graphs of paths, cycles, and trees. Discuss. Math. Graph Theory 43(4): 931-946 (2023)- 2022
- [i1]Barton F. Cone, Stephen T. Hedetniemi, Lance C. Ingle, Ken Kennedy:
Performance Comparisons of Self-stabilizing Algorithms for Maximal Independent Sets. CoRR abs/2203.11118 (2022) - 2020
- [j112]Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Nicholas Phillips:
The upper domatic number of a graph. AKCE Int. J. Graphs Comb. 17(1): 139-148 (2020) - [j111]Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Introduction to coalitions in graphs. AKCE Int. J. Graphs Comb. 17(2): 653-659 (2020) - [j110]Stephen T. Hedetniemi, Renu C. Laskar, Henry Martyn Mulder:
New resolvability parameters of graphs. AKCE Int. J. Graphs Comb. 17(3): 1028-1038 (2020)
2010 – 2019
- 2018
- [j109]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi:
Client-server and cost effective sets in graphs. AKCE Int. J. Graphs Comb. 15(2): 211-218 (2018) - [j108]Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi, Christian Moore:
Distribution centers in graphs. Discret. Appl. Math. 243: 186-193 (2018) - [j107]Gary Chartrand, Stephen Devereaux, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang:
Rainbow disconnection in graphs. Discuss. Math. Graph Theory 38(4): 1007-1021 (2018) - 2017
- [j106]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis:
Restricted optimal pebbling and domination in graphs. Discret. Appl. Math. 221: 46-53 (2017) - [j105]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis:
On ve-degrees and ev-degrees in graphs. Discret. Math. 340(2): 31-38 (2017) - 2016
- [j104]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Roman {2}-domination. Discret. Appl. Math. 204: 22-28 (2016) - [j103]James D. Chandler, Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi:
Neighborhood-restricted [≤2]-achromatic colorings. Discret. Appl. Math. 207: 39-44 (2016) - [j102]Robert A. Beeler, Teresa W. Haynes, Stephen T. Hedetniemi:
Double Roman domination. Discret. Appl. Math. 211: 23-29 (2016) - [j101]Stephen T. Hedetniemi, David Pokrass Jacobs
, Vilmar Trevisan:
Domination number and Laplacian eigenvalue distribution. Eur. J. Comb. 53: 66-71 (2016) - [j100]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) - 2015
- [j99]Teresa W. Haynes, Stephen T. Hedetniemi, Inna Vasylieva:
Very cost effective bipartitions in graphs. AKCE Int. J. Graphs Comb. 12(Issues): 155-160 (2015) - [j98]Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy:
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets. Theor. Comput. Sci. 593: 132-138 (2015) - 2014
- [j97]Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Independent [1, k]-sets in graphs. Australas. J Comb. 59: 144-156 (2014) - [j96]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi:
Bounds on weak roman and 2-rainbow domination numbers. Discret. Appl. Math. 178: 27-32 (2014) - [j95]Teresa W. Haynes, Stephen T. Hedetniemi, William B. Jamieson, Jessie D. Jamieson:
Downhill domination in graphs. Discuss. Math. Graph Theory 34(3): 603-612 (2014) - 2013
- [j94]Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy:
Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets. Comput. J. 56(11): 1381-1387 (2013) - [j93]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
[1, 2]-sets in graphs. Discret. Appl. Math. 161(18): 2885-2893 (2013) - [j92]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
- [j91]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
- [j90]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) - [j89]Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson:
γ-graphs of graphs. Discuss. Math. Graph Theory 31(3): 517-531 (2011) - 2010
- [j88]Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae:
Capacitated Domination. Ars Comb. 96 (2010)
2000 – 2009
- 2009
- [j87]Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi:
Powerful alliances in graphs. Discret. Math. 309(8): 2140-2147 (2009) - [j86]John Dabney, Brian C. Dean, Stephen T. Hedetniemi:
A linear-time algorithm for broadcast domination in a tree. Networks 53(2): 160-169 (2009) - [j85]Wayne Goddard, Stephen T. Hedetniemi:
A note on trees, tables, and algorithms. Networks 53(2): 184-190 (2009) - 2008
- [j84]Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall:
Braodcast Chromatic Numbers of Graphs. Ars Comb. 86 (2008) - [j83]Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki:
On domination and reinforcement numbers in trees. Discret. Math. 308(7): 1165-1175 (2008) - [j82]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu:
Self-Stabilizing Graph Protocols. Parallel Process. Lett. 18(1): 189-199 (2008) - [j81]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. 399(1-2): 118-127 (2008) - [c12]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. ICDCN 2008: 182-190 - 2007
- [j80]Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi:
Security in graphs. Discret. Appl. Math. 155(13): 1708-1714 (2007) - 2006
- [j79]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) - [c11]Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi:
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA 2006: 797-803 - [c10]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356 - 2005
- [j78]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) - [j77]Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae:
An algorithm for partial Grundy number on trees. Discret. Math. 304(1-3): 108-116 (2005) - [j76]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. Int. J. Distributed Sens. Networks 1(3&4): 329-344 (2005) - [j75]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. 16(1): 19-36 (2005) - 2004
- [j74]K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and irredundance in tournaments. Australas. J Comb. 29: 157-172 (2004) - [j73]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) - [j72]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) - [j71]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) - [j70]Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi:
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Inf. Process. Lett. 91(2): 77-83 (2004) - [j69]Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen:
A Self-stabilizing Algorithm for Maximal 2-packing. Nord. J. Comput. 11(1): 1-11 (2004) - [j68]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs:
Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. 14(1): 75-82 (2004) - [j67]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae:
Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. 14(3-4): 387-398 (2004) - [c9]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004 - 2003
- [j66]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning:
Global Defensive Alliances in Graphs. Electron. J. Comb. 10 (2003) - [j65]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater:
H-forming sets in graphs. Discret. Math. 262(1-3): 159-169 (2003) - [j64]Michael A. Henning, Stephen T. Hedetniemi:
Defending the Roman Empire--A new strategy. Discret. Math. 266(1-3): 239-251 (2003) - [j63]Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins:
On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discret. Math. 272(1): 53-64 (2003) - [j62]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5): 251-255 (2003) - [c8]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC 2003: 66-73 - [c7]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. ICDCS Workshops 2003: 461-465 - [c6]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. IPDPS 2003: 162 - [c5]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. IPDPS 2003: 240 - [c4]Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani:
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. IWDC 2003: 26-32 - [c3]Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae:
Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems 2003: 49-60 - 2002
- [j61]Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
On k-dependent domination. Discret. Math. 249(1-3): 83-94 (2002) - [j60]Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Total irredundance in graphs. Discret. Math. 256(1-2): 115-127 (2002) - [j59]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) - [c2]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. IPDPS 2002 - 2001
- [j58]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Stable and unstable graphs with total irredundance number zero. Ars Comb. 61 (2001) - [j57]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) - [j56]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5): 221-223 (2001) - 2000
- [j55]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) - [j54]Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman:
The even adjacency split problem for graphs. Discret. Appl. Math. 102(3): 175-188 (2000) - [j53]Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao:
Extremal graphs for inequalities involving domination parameters. Discret. Math. 216(1-3): 1-10 (2000) - [j52]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall:
Acyclic domination. Discret. Math. 222(1-3): 151-165 (2000) - [j51]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)
1990 – 1999
- 1999
- [j50]Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in graphs. Discret. Math. 199(1-3): 35-47 (1999) - [j49]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) - [j48]Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus:
Restrained domination in graphs. Discret. Math. 203(1-3): 61-69 (1999) - 1998
- [b1]Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater:
Fundamentals of domination in graphs. Pure and applied mathematics 208, Dekker 1998, ISBN 978-0-8247-0033-1, pp. I-XI, 1-446 - [j47]Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
Independence and Irredundance in k-Regular Graphs. Ars Comb. 49 (1998) - [j46]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
- [j45]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) - [j44]Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae:
On weakly connected domination in graphs. Discret. Math. 167-168: 261-269 (1997) - [j43]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) - 1996
- [j42]Robert Geist, Madhu Chetuparambil, Stephen T. Hedetniemi, A. Joe Turner:
Computing Research Programs in the US. Commun. ACM 39(12): 96-99 (1996) - [j41]Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning:
The Algorithmic Complexity of Minus Domination in Graphs. Discret. Appl. Math. 68(1-2): 73-84 (1996) - [j40]Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
Maximal Irredundant Functions. Discret. Appl. Math. 68(3): 267-277 (1996) - [j39]Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae:
Minus domination in regular graphs. Discret. Math. 149(1-3): 311-312 (1996) - 1995
- [j38]Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt:
Properties of minimal dominating functions of graphs. Ars Comb. 41 (1995) - [j37]Gerd Fricke, Stephen T. Hedetniemi, Michael A. Henning:
Distance independence domination in graphs. Ars Comb. 41 (1995) - [j36]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) - 1994
- [j35]Roger Labahn, Stephen T. Hedetniemi, Renu C. Laskar:
Periodic gossiping on trees. Discret. Appl. Math. 53(1-3): 235-245 (1994) - [j34]Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
The Private Neighbor Cube. SIAM J. Discret. Math. 7(1): 41-47 (1994) - 1993
- [j33]Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs:
Efficient Sets in Graphs. Discret. Appl. Math. 44(1-3): 99-108 (1993) - 1990
- [j32]Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
On the computational complexity of upper fractional domination. Discret. Appl. Math. 27(3): 195-207 (1990) - [j31]Stephen T. Hedetniemi, Renu C. Laskar:
Introduction. Discret. Math. 86(1-3): 3-9 (1990) - [j30]Stephen T. Hedetniemi, Renu C. Laskar:
Bibliography on domination in graphs and some basic definitions of domination parameters. Discret. Math. 86(1-3): 257-277 (1990)
1980 – 1989
- 1989
- [j29]Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke:
The subchromatic number of a graph. Discret. Math. 74(1-2): 33-49 (1989) - [j28]Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski:
Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 32(5): 247-250 (1989) - 1988
- [j27]Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar:
Gallai theorems for graphs, hypergraphs, and set systems. Discret. Math. 72(1-3): 35-47 (1988) - [j26]Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman:
A survey of gossiping and broadcasting in communication networks. Networks 18(4): 319-349 (1988) - 1987
- [j25]Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar:
On the equality of the grundy and ochromatic numbers of a graph. J. Graph Theory 11(2): 157-159 (1987) - 1986
- [j24]Stephen T. Hedetniemi, Renu C. Laskar, John Pfaff:
A linear algorithm for finding a minimum dominating set in a cactus. Discret. Appl. Math. 13(2-3): 287-292 (1986) - [j23]Ernest J. Cockayne, Stephen T. Hedetniemi:
On the diagonal queens domination problem. J. Comb. Theory A 42(1): 137-139 (1986) - 1984
- [j22]Robert B. Allan, Renu C. Laskar, Stephen T. Hedetniemi:
A note on total domination. Discret. Math. 49(1): 7-13 (1984) - 1981
- [j21]Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski:
Partitioning trees: Matching, domination, and maximum diameter. Int. J. Parallel Program. 10(1): 55-61 (1981) - [j20]Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi:
Information Dissemination in Trees. SIAM J. Comput. 10(4): 692-701 (1981) - 1980
- [j19]Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi:
Total domination in graphs. Networks 10(3): 211-219 (1980) - [j18]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)
1970 – 1979
- 1979
- [j17]Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski:
Minimum broadcast graphs. Discret. Math. 25(2): 189-193 (1979) - [j16]Sandra L. Mitchell, Stephen T. Hedetniemi:
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. Inf. Process. Lett. 9(3): 110-112 (1979) - [j15]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) - [j14]Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater:
Matchings and transversals in hypergraphs, domination and independence-in trees. J. Comb. Theory B 26(1): 78-80 (1979) - 1978
- [j13]Ernest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi:
A linear algorithm for disjoint matchings in trees. Discret. Math. 21(2): 129-136 (1978) - [j12]Ernest J. Cockayne, Stephen T. Hedetniemi:
Disjoint cliques in regular graphs of degree seven and eight. J. Comb. Theory B 24(2): 233-237 (1978) - 1977
- [j11]Stephen T. Hedetniemi, Diane M. Spresser:
A property of trees in terms of unique connected subgraphs. J. Graph Theory 1(4): 335-337 (1977) - [j10]Ernest J. Cockayne, Stephen T. Hedetniemi:
Towards a theory of domination in graphs. Networks 7(3): 247-261 (1977) - 1976
- [j9]Ernest J. Cockayne, Stephen T. Hedetniemi:
Disjoint independent dominating sets in graphs. Discret. Math. 15(3): 213-222 (1976) - [j8]Peter J. Slater, Seymour E. Goodman, Stephen T. Hedetniemi:
On the optional hamiltonian completion problem. Networks 6(1): 35-51 (1976) - [j7]Seymour E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan:
b-Matchings in Trees. SIAM J. Comput. 5(1): 104-108 (1976) - 1975
- [j6]Ernest J. Cockayne, Seymour E. Goodman, Stephen T. Hedetniemi:
A Linear Algorithm for the Domination Number of a Tree. Inf. Process. Lett. 4(2): 41-44 (1975) - [j5]Seymour E. Goodman, Stephen T. Hedetniemi, Peter J. Slater:
Advances on the Hamiltonian Completion Problem. J. ACM 22(3): 352-360 (1975) - 1974
- [j4]Seymour E. Goodman, Stephen T. Hedetniemi:
On Hamiltonian Walks in Graphs. SIAM J. Comput. 3(3): 214-221 (1974) - 1973
- [j3]Seymour E. Goodman, Stephen T. Hedetniemi:
Eulerian Walks in Graphs. SIAM J. Comput. 2(1): 16-27 (1973) - 1972
- [j2]Arthur C. Fleck, Stephen T. Hedetniemi, Robert H. Oehmke:
S-Semigroups of Automata. J. ACM 19(1): 3-10 (1972) - 1970
- [j1]Stephen T. Hedetniemi:
R70-36 Maximin Automata. IEEE Trans. Computers 19(9): 859 (1970)
1960 – 1969
- 1963
- [c1]Bernard M. Levin, Stephen T. Hedetniemi:
Determining fastest routes using fixed schedules. AFIPS Spring Joint Computing Conference 1963: 1-8
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:28 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:
