Stephen T. Hedetniemi

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, K. E. Kennedy, Alice A. McRae: Self-stabilizing Algorithms for Unfriendly Partitions into Two Disjoint Dominating Sets. Parallel Processing Letters 23(1) (2013)

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)

Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae: Matchability and k-maximal matchings. Discrete Applied Mathematics 159(1): 15-22 (2011)

Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson: γ-graphs of graphs. Discussiones Mathematicae Graph Theory 31(3): 517-531 (2011)

Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae: Capacitated Domination. Ars Comb. 96 (2010)

Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi: Powerful alliances in graphs. Discrete Mathematics 309(8): 2140-2147 (2009)

John Dabney, Brian C. Dean, Stephen T. Hedetniemi: A linear-time algorithm for broadcast domination in a tree. Networks 53(2): 160-169 (2009)

Wayne Goddard, Stephen T. Hedetniemi: A note on trees, tables, and algorithms. Networks 53(2): 184-190 (2009)

Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall: Braodcast Chromatic Numbers of Graphs. Ars Comb. 86 (2008)

Jean 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)

Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu: Self-Stabilizing Graph Protocols. Parallel Processing Letters 18(1): 189-199 (2008)

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)

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

Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi: Security in graphs. Discrete Applied Mathematics 155(13): 1708-1714 (2007)

Jean 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)

Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi: An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA 2006: 797-803

Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan: Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356

Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar: Generalized subgraph-restricted matchings in graphs. Discrete Mathematics 293(1-3): 129-138 (2005)

Zhengnan 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)

Wayne 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)

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)

Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: Roman domination in graphs. Discrete Mathematics 278(1-3): 11-22 (2004)

Sandra 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)

Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, R. Duane Skaggs: Offensive alliances in graphs. Discussiones Mathematicae Graph Theory 24(2): 263-175 (2004)

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)

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)

Martin 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)

Martin 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)

Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004

Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning: Global Defensive Alliances in Graphs. Electr. J. Comb. 10 (2003)

Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater: H-forming sets in graphs. Discrete Mathematics 262(1-3): 159-169 (2003)

Michael A. Henning, Stephen T. Hedetniemi: Defending the Roman Empire--A new strategy. Discrete Mathematics 266(1-3): 239-251 (2003)

Paul 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)

Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5): 251-255 (2003)

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

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

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

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

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

Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems 2003: 49-60

Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall: On k-dependent domination. Discrete Mathematics 249(1-3): 83-94 (2002)

Odile 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)

Teresa 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)

Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. IPDPS 2002

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)

Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe: Domination Subdivision Numbers. Discussiones Mathematicae Graph Theory 21(2): 239-253 (2001)

Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5): 221-223 (2001)

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)

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)

Baogen 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)

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall: Acyclic domination. Discrete Mathematics 222(1-3): 151-165 (2000)

Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi: Domination and independence subdivision numbers of graphs. Discussiones Mathematicae Graph Theory 20(2): 271-280 (2000)

Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae: Minus domination in graphs. Discrete Mathematics 199(1-3): 35-47 (1999)

Gerd 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)

Gayla 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)

Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: Independence and Irredundance in k-Regular Graphs. Ars Comb. 49 (1998)

Ernest 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)

Jing-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)

Jean 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)

Ernest 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)

Robert Geist, Madhu Chetuparambil, Stephen T. Hedetniemi, A. Joe Turner: Computing Research Programs in the US. Commun. ACM 39(12): 96-99 (1996)

Jean 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)

Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: Maximal Irredundant Functions. Discrete Applied Mathematics 68(3): 267-277 (1996)

Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae: Minus domination in regular graphs. Discrete Mathematics 149(1-3): 311-312 (1996)

Jean 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)

Roger Labahn, Stephen T. Hedetniemi, Renu Laskar: Periodic gossiping on trees. Discrete Applied Mathematics 53(1-3): 235-245 (1994)

Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs: The Private Neighbor Cube. SIAM J. Discrete Math. 7(1): 41-47 (1994)

Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs: Efficient Sets in Graphs. Discrete Applied Mathematics 44(1-3): 99-108 (1993)

Grant 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)

Stephen T. Hedetniemi, Renu C. Laskar: Introduction. Discrete Mathematics 86(1-3): 3-9 (1990)

Stephen 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)

Michael 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)

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)

Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar: Gallai theorems for graphs, hypergraphs, and set systems. Discrete Mathematics 72(1-3): 35-47 (1988)

Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman: A survey of gossiping and broadcasting in communication networks. Networks 18(4): 319-349 (1988)

Ernest J. Cockayne, Stephen T. Hedetniemi: On the diagonal queens domination problem. J. Comb. Theory, Ser. A 42(1): 137-139 (1986)

Robert B. Allan, Renu Laskar, Stephen T. Hedetniemi: A note on total domination. Discrete Mathematics 49(1): 7-13 (1984)

Arthur Parley, Stephen T. Hedetniemi, Andrzej Proskurowski: Partitioning trees: Matching, domination, and maximum diameter. International Journal of Parallel Programming 10(1): 55-61 (1981)

Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi: Information Dissemination in Trees. SIAM J. Comput. 10(4): 692-701 (1981)

Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi: Total domination in graphs. Networks 10(3): 211-219 (1980)

Sandra L. Mitchell, Stephen T. Hedetniemi: Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. Inf. Process. Lett. 9(3): 110-112 (1979)

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)

Ernest 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)

Ernest 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)

Ernest J. Cockayne, Stephen T. Hedetniemi: Towards a theory of domination in graphs. Networks 7(3): 247-261 (1977)

Peter J. Slater, S. E. Goodman, Stephen T. Hedetniemi: On the optional hamiltonian completion problem. Networks 6(1): 35-51 (1976)

S. E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan: b-Matchings in Trees. SIAM J. Comput. 5(1): 104-108 (1976)

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)

S. E. Goodman, Stephen T. Hedetniemi, Peter J. Slater: Advances on the Hamiltonian Completion Problem. J. ACM 22(3): 352-360 (1975)

S. E. Goodman, Stephen T. Hedetniemi: On Hamiltonian Walks in Graphs. SIAM J. Comput. 3(3): 214-221 (1974)

S. E. Goodman, Stephen T. Hedetniemi: Eulerian Walks in Graphs. SIAM J. Comput. 2(1): 16-27 (1973)

Arthur C. Fleck, Stephen T. Hedetniemi, Robert H. Oehmke: S-Semigroups of Automata. J. ACM 19(1): 3-10 (1972)