dblp.uni-trier.dewww.uni-trier.de

Stephen T. Hedetniemi Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
78EEJohn Dabney, Brian C. Dean, Stephen T. Hedetniemi: A linear-time algorithm for broadcast domination in a tree. Networks 53(2): 160-169 (2009)
77EEWayne Goddard, Stephen T. Hedetniemi: A note on trees, tables, and algorithms. Networks 53(2): 184-190 (2009)
2008
76EEWayne 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
75 Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall: Braodcast Chromatic Numbers of Graphs. Ars Comb. 86: (2008)
74EEJean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki: On domination and reinforcement numbers in trees. Discrete Mathematics 308(7): 1165-1175 (2008)
73EEWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu: Self-Stabilizing Graph Protocols. Parallel Processing Letters 18(1): 189-199 (2008)
72EEWayne 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)
2007
71EERobert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi: Security in graphs. Discrete Applied Mathematics 155(13): 1708-1714 (2007)
2006
70 Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi: An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA 2006: 797-803
69EEWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan: Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356
68EEJean 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
67EEWayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar: Generalized subgraph-restricted matchings in graphs. Discrete Mathematics 293(1-3): 129-138 (2005)
66EEZhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae: An algorithm for partial Grundy number on trees. Discrete Mathematics 304(1-3): 108-116 (2005)
65EEWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. IJDSN 1(3&4): 329-344 (2005)
64EEWayne 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
63EEWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004
62EEErnest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: Roman domination in graphs. Discrete Mathematics 278(1-3): 11-22 (2004)
61EESandra 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)
60EEZhengnan 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)
59 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)
58EEMartin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs: Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Processing Letters 14(1): 75-82 (2004)
57EEMartin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Distance-two information in self-stabilizing algorithms. Parallel Processing Letters 14(3-4): 387-398 (2004)
2003
56EEWayne 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
55EEWayne 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
54EEWayne 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
53EEWayne 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
52EEZhenyu 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
51EEMartin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems 2003: 49-60
50EETeresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater: H-forming sets in graphs. Discrete Mathematics 262(1-3): 159-169 (2003)
49EEMichael A. Henning, Stephen T. Hedetniemi: Defending the Roman Empire--A new strategy. Discrete Mathematics 266(1-3): 239-251 (2003)
48EEPaul Erdös, Stephen T. Hedetniemi, Renu Laskar, Geert C. E. Prins: On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discrete Mathematics 272(1): 53-64 (2003)
47EETeresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning: Global Defensive Alliances in Graphs. Electr. J. Comb. 10: (2003)
46EEStephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5): 251-255 (2003)
2002
45EEStephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. IPDPS 2002
44EEOdile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall: On k-dependent domination. Discrete Mathematics 249(1-3): 83-94 (2002)
43EEOdile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley: Total irredundance in graphs. Discrete Mathematics 256(1-2): 115-127 (2002)
42EETeresa 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)
2001
41 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)
40EEStephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5): 221-223 (2001)
2000
39EEAshraf 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)
38 Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman: The even adjacency split problem for graphs. Discrete Applied Mathematics 102(3): 175-188 (2000)
37EEBaogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao: Extremal graphs for inequalities involving domination parameters. Discrete Mathematics 216(1-3): 1-10 (2000)
36EESandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall: Acyclic domination. Discrete Mathematics 222(1-3): 151-165 (2000)
1999
35EEGerd 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)
34EEJean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae: Minus domination in graphs. Discrete Mathematics 199(1-3): 35-47 (1999)
33EEGayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus: Restrained domination in graphs. Discrete Mathematics 203(1-3): 61-69 (1999)
1998
32 Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: Independence and Irredundance in k-Regular Graphs. Ars Comb. 49: (1998)
31EEErnest 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
30EEJing-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)
29EEJean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae: On weakly connected domination in graphs. Discrete Mathematics 167-168: 261-269 (1997)
28EEErnest 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)
1996
27 Robert Geist, Madhu Chetuparambil, Stephen T. Hedetniemi, A. Joe Turner: Computing Research Programs in the US. Commun. ACM 39(12): 96-99 (1996)
26EEJean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning: The Algorithmic Complexity of Minus Domination in Graphs. Discrete Applied Mathematics 68(1-2): 73-84 (1996)
25EEGerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: Maximal Irredundant Functions. Discrete Applied Mathematics 68(3): 267-277 (1996)
24EEJean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae: Minus domination in regular graphs. Discrete Mathematics 149(1-3): 311-312 (1996)
1995
23EEJean 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)
1994
22 Roger Labahn, Stephen T. Hedetniemi, Renu Laskar: Periodic gossiping on trees. Discrete Applied Mathematics 53(1-3): 235-245 (1994)
21EEMichael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: The Private Neighbor Cube. SIAM J. Discrete Math. 7(1): 41-47 (1994)
1993
20EEPhilip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs: Efficient Sets in Graphs. Discrete Applied Mathematics 44(1-3): 99-108 (1993)
1990
19EEGrant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: On the computational complexity of upper fractional domination. Discrete Applied Mathematics 27(3): 195-207 (1990)
18EEStephen T. Hedetniemi, Renu C. Laskar: Bibliography on domination in graphs and some basic definitions of domination parameters. Discrete Mathematics 86(1-3): 257-277 (1990)
17 Stephen T. Hedetniemi, Renu C. Laskar: Introduction. Discrete Mathematics 86(1-3): 3-9 (1990)
1989
16EEMichael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke: The subchromatic number of a graph. Discrete Mathematics 74(1-2): 33-49 (1989)
15 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
14EEErnest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar: Gallai theorems for graphs, hypergraphs, and set systems. Discrete Mathematics 72(1-3): 35-47 (1988)
1986
13EEErnest J. Cockayne, Stephen T. Hedetniemi: On the diagonal queens domination problem. J. Comb. Theory, Ser. A 42(1): 137-139 (1986)
1984
12EERobert B. Allan, Renu Laskar, Stephen T. Hedetniemi: A note on total domination. Discrete Mathematics 49(1): 7-13 (1984)
1981
11 Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi: Information Dissemination in Trees. SIAM J. Comput. 10(4): 692-701 (1981)
1979
10 Sandra L. Mitchell, Stephen T. Hedetniemi: Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. Inf. Process. Lett. 9(3): 110-112 (1979)
9EEErnest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater: Matchings and transversals in hypergraphs, domination and independence-in trees. J. Comb. Theory, Ser. B 26(1): 78-80 (1979)
8 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
7EEErnest J. Cockayne, Stephen T. Hedetniemi: Disjoint cliques in regular graphs of degree seven and eight. J. Comb. Theory, Ser. B 24(2): 233-237 (1978)
1976
6 S. E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan: b-Matchings in Trees. SIAM J. Comput. 5(1): 104-108 (1976)
1975
5 Ernest J. Cockayne, S. E. Goodman, Stephen T. Hedetniemi: A Linear Algorithm for the Domination Number of a Tree. Inf. Process. Lett. 4(2): 41-44 (1975)
4EES. E. Goodman, Stephen T. Hedetniemi, Peter J. Slater: Advances on the Hamiltonian Completion Problem. J. ACM 22(3): 352-360 (1975)
1974
3 S. E. Goodman, Stephen T. Hedetniemi: On Hamiltonian Walks in Graphs. SIAM J. Comput. 3(3): 214-221 (1974)
1973
2 S. E. Goodman, Stephen T. Hedetniemi: Eulerian Walks in Graphs. SIAM J. Comput. 2(1): 16-27 (1973)
1972
1EEArthur C. Fleck, Stephen T. Hedetniemi, Robert H. Oehmke: S-Semigroups of Automata. J. ACM 19(1): 3-10 (1972)

Coauthor Index

1Ashraf M. Abdelbar [39]
2Michael O. Albertson [16]
3Robert B. Allan [12]
4Philip J. Bernhard [20]
5Jean R. S. Blair [74]
6Robert C. Brigham [71]
7Gerard J. Chang [30]
8Grant A. Cheston [15] [19] [38]
9Madhu Chetuparambil [27]
10Ernest J. Cockayne [5] [7] [8] [9] [11] [13] [14] [28] [31] [37] [62]
11John Dabney [78]
12Brian C. Dean [78]
13Gayla S. Domke [33]
14Paul A. Dreyer Jr. [62]
15Jean E. Dunbar [23] [24] [26] [29] [34] [68]
16Ronald D. Dutton [71]
17Paul Erdös [48]
18David J. Erwin [68]
19Arthur M. Farley [15]
20Odile Favaron [43] [44]
21Michael R. Fellows (Mike Fellows) [21]
22Arthur C. Fleck [1]
23Gerd Fricke [19] [21] [25] [32] [35]
24Martin Gairing [51] [57] [58] [59]
25Robert Geist [27] [59]
26Wayne Goddard [26] [52] [53] [54] [55] [56] [57] [58] [60] [63] [64] [65] [66] [67] [69] [70] [72] [73] [74] [75] [76] [77]
27S. E. Goodman [2] [3] [4] [5] [6]
28Jerrold W. Grossman [29]
29John M. Harris [75]
30Frederick C. Harris Jr. [23]
31Johannes H. Hattingh [28] [29] [33]
32Teresa W. Haynes [35] [37] [41] [42] [43] [47] [50] [68]
33Sandra Mitchell Hedetniemi (Sandra L. Mitchell) [8] [10] [23] [28] [30] [31] [35] [36] [39] [42] [44] [61] [62] [67] [68] [75]
34Michael A. Henning [24] [26] [34] [35] [41] [42] [43] [47] [49] [50]
35Steve Horton [74]
36David Pokrass Jacobs [19] [20] [21] [25] [32] [40] [45] [46] [53] [54] [55] [56] [58] [63] [64] [65] [69] [72] [73] [76]
37Robert E. Jamison [16]
38Patrick Jones [74]
39Ken Kennedy [66]
40Debra J. Knisley [41] [43]
41Petter Kristiansen [51] [57] [59]
42Grzegorz Kubicki [74]
43Roger Labahn [22]
44Renu Laskar (Renu C. Laskar) [12] [14] [17] [18] [22] [23] [33] [48] [66] [67]
45Arthur L. Liestman [38]
46Stephen C. Locke [16]
47Lisa R. Markus [33]
48Alice A. McRae [23] [24] [26] [28] [29] [34] [51] [57] [61] [66]
49Christina M. Mynhardt [31]
50Robert H. Oehmke [1]
51Dee Parks [61]
52Geert C. E. Prins [48]
53Andrzej Proskurowski [15]
54Douglas F. Rall [36] [44] [75]
55Zhou Shangchao [37]
56Zhengnan Shi [60] [66] [70]
57Peter J. Slater [4] [9] [11] [50]
58Pradip K. Srimani [40] [45] [46] [52] [53] [54] [55] [56] [63] [64] [65] [73] [76]
59J. B. Stehman [38]
60Robert Endre Tarjan [6]
61Jan Arne Telle [61]
62Vilmar Trevisan [69] [72]
63A. Joe Turner [27]
64Baogen Xu [37]
65Zhenyu Xu [52] [73]
66Jing-Ho Yan [30]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)