Stephen T. Hedetniemi

Publication Activity (10 Years)

Years Active: 1963-2023
Publications (10 Years): 15

Top Venues

Discret. Appl. Math.

AKCE Int. J. Graphs Comb.

Discuss. Math. Graph Theory

CoRR

Publications

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) (2023)
Barton F. Cone, Stephen T. Hedetniemi, Lance C. Ingle, Ken Kennedy
Performance Comparisons of Self-stabilizing Algorithms for Maximal Independent Sets. CoRR (2022)
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) (2020)
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) (2020)
Stephen T. Hedetniemi, Renu C. Laskar, Henry Martyn Mulder
New resolvability parameters of graphs. AKCE Int. J. Graphs Comb. 17 (3) (2020)
Gary Chartrand, Stephen Devereaux, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang
Rainbow disconnection in graphs. Discuss. Math. Graph Theory 38 (4) (2018)
Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi, Christian Moore
Distribution centers in graphs. Discret. Appl. Math. 243 (2018)
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi
Client-server and cost effective sets in graphs. AKCE Int. J. Graphs Comb. 15 (2) (2018)
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis
Restricted optimal pebbling and domination in graphs. Discret. Appl. Math. 221 (2017)
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis
On ve-degrees and ev-degrees in graphs. Discret. Math. 340 (2) (2017)
Robert A. Beeler, Teresa W. Haynes, Stephen T. Hedetniemi
Double Roman domination. Discret. Appl. Math. 211 (2016)
Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Domination number and Laplacian eigenvalue distribution. Eur. J. Comb. 53 (2016)
Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
A Roman Domination Chain. Graphs Comb. 32 (1) (2016)
James D. Chandler, Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi
Neighborhood-restricted [≤2]-achromatic colorings. Discret. Appl. Math. 207 (2016)
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
Roman {2}-domination. Discret. Appl. Math. 204 (2016)
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 (2015)
Teresa W. Haynes, Stephen T. Hedetniemi, Inna Vasylieva
Very cost effective bipartitions in graphs. AKCE Int. J. Graphs Comb. 12 (Issues) (2015)
Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
Independent [1, k]-sets in graphs. Australas. J Comb. 59 (2014)
Teresa W. Haynes, Stephen T. Hedetniemi, William B. Jamieson, Jessie D. Jamieson
Downhill domination in graphs. Discuss. Math. Graph Theory 34 (3) (2014)
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi
Bounds on weak roman and 2-rainbow domination numbers. Discret. Appl. Math. 178 (2014)
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)
Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy
Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets. Comput. J. 56 (11) (2013)
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
[1, 2]-sets in graphs. Discret. Appl. Math. 161 (18) (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) (2012)
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae
Matchability and k-maximal matchings. Discret. Appl. Math. 159 (1) (2011)
Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson
γ-graphs of graphs. Discuss. Math. Graph Theory 31 (3) (2011)
Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae
Capacitated Domination. Ars Comb. 96 (2010)
John Dabney, Brian C. Dean, Stephen T. Hedetniemi
A linear-time algorithm for broadcast domination in a tree. Networks 53 (2) (2009)
Wayne Goddard, Stephen T. Hedetniemi
A note on trees, tables, and algorithms. Networks 53 (2) (2009)
Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi
Powerful alliances in graphs. Discret. Math. 309 (8) (2009)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. 399 (1-2) (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)
Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall
Braodcast Chromatic Numbers of Graphs. Ars Comb. 86 (2008)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
Self-Stabilizing Graph Protocols. Parallel Process. Lett. 18 (1) (2008)
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) (2008)
Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi
Security in graphs. Discret. Appl. Math. 155 (13) (2007)
Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA (2006)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Information in Self-stabilizing Algorithms. SIROCCO (2006)
Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
Broadcasts in graphs. Discret. Appl. Math. 154 (1) (2006)
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) (2005)
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) (2005)
Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar
Generalized subgraph-restricted matchings in graphs. Discret. Math. 293 (1-3) (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) (2005)
Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
Roman domination in graphs. Discret. Math. 278 (1-3) (2004)
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) (2004)
Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. 14 (1) (2004)
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) (2004)
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle
Iterated colorings of graphs. Discret. Math. 278 (1-3) (2004)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Fault Tolerant Algorithms for Orderings and Colorings. IPDPS (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) (2004)
Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen
A Self-stabilizing Algorithm for Maximal 2-packing. Nord. J. Comput. 11 (1) (2004)
K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
Domination and irredundance in tournaments. Australas. J Comb. 29 (2004)
Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning
Global Defensive Alliances in Graphs. Electron. J. Comb. 10 (2003)
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)
Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
Self-Stabilizing Algorithms for {k}-Domination. Self-Stabilizing Systems (2003)
Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. IWDC (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)
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) (2003)
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)
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)
Michael A. Henning, Stephen T. Hedetniemi
Defending the Roman Empire--A new strategy. Discret. Math. 266 (1-3) (2003)
Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Linear time self-stabilizing colorings. Inf. Process. Lett. 87 (5) (2003)
Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater
-forming sets in graphs. Discret. Math. 262 (1-3) (2003)
Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
Total irredundance in graphs. Discret. Math. 256 (1-2) (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, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
Domination in Graphs Applied to Electric Power Networks. SIAM J. Discret. Math. 15 (4) (2002)
Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
-dependent domination. Discret. Math. 249 (1-3) (2002)
Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80 (5) (2001)
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. Discuss. Math. Graph Theory 21 (2) (2001)
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) (2000)
Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
Domination and independence subdivision numbers of graphs. Discuss. Math. Graph Theory 20 (2) (2000)
Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi
The complexity of approximating MAPs for belief networks with bounded probabilities. Artif. Intell. 124 (2) (2000)
Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman
The even adjacency split problem for graphs. Discret. Appl. Math. 102 (3) (2000)
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
Acyclic domination. Discret. Math. 222 (1-3) (2000)
Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus
Restrained domination in graphs. Discret. Math. 203 (1-3) (1999)
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) (1999)
Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
Minus domination in graphs. Discret. Math. 199 (1-3) (1999)
Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
Irredundant and perfect neighbourhood sets in trees. Discret. Math. 188 (1-3) (1998)
Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
Independence and Irredundance in k-Regular Graphs. Ars Comb. 49 (1998)
Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae
On weakly connected domination in graphs. Discret. Math. (1997)
Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
k-Path Partitions in Trees. Discret. Appl. Math. 78 (1-3) (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. Discret. Math. 176 (1-3) (1997)
Robert Geist, Madhu Chetuparambil, Stephen T. Hedetniemi, A. Joe Turner
Computing Research Programs in the US. Commun. ACM 39 (12) (1996)
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) (1996)
Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
Maximal Irredundant Functions. Discret. Appl. Math. 68 (3) (1996)
Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
Minus domination in regular graphs. Discret. Math. 149 (1-3) (1996)
Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt
Properties of minimal dominating functions of graphs. Ars Comb. 41 (1995)
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) (1995)
Gerd Fricke, Stephen T. Hedetniemi, Michael A. Henning
Distance independence domination in graphs. Ars Comb. 41 (1995)
Roger Labahn, Stephen T. Hedetniemi, Renu C. Laskar
Periodic gossiping on trees. Discret. Appl. Math. 53 (1-3) (1994)
Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
The Private Neighbor Cube. SIAM J. Discret. Math. 7 (1) (1994)
Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs
Efficient Sets in Graphs. Discret. Appl. Math. 44 (1-3) (1993)
Stephen T. Hedetniemi, Renu C. Laskar
Introduction. Discret. Math. 86 (1-3) (1990)
Stephen T. Hedetniemi, Renu C. Laskar
Bibliography on domination in graphs and some basic definitions of domination parameters. Discret. Math. 86 (1-3) (1990)
Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
On the computational complexity of upper fractional domination. Discret. Appl. Math. 27 (3) (1990)
Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
The subchromatic number of a graph. Discret. Math. 74 (1-2) (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) (1989)
Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar
Gallai theorems for graphs, hypergraphs, and set systems. Discret. Math. 72 (1-3) (1988)
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman
A survey of gossiping and broadcasting in communication networks. Networks 18 (4) (1988)

Stephen T. Hedetniemi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stephen T. Hedetniemi