Stephen T. Hedetniemi

129 papers A 4B 1Misc 3Journal 116Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Dual-server domination in graphs.
Discret. Appl. Math.
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi
2025 J jnl
Bounds on the
Discuss. Math. Graph Theory
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Nacéra Meddah
2024 J jnl
Gallai Theorems Involving Minority and Majority Parameters.
Ars Comb.
Mustapha Chellali, Stephen T. Hedetniemi, Nacéra Meddah
2023 J jnl
Coalition graphs of paths, cycles, and trees.
Discuss. Math. Graph Theory
Teresa W. Haynes, Jason Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan
2022 J jnl
Performance Comparisons of Self-stabilizing Algorithms for Maximal Independent Sets.
CoRR
Barton F. Cone, Stephen T. Hedetniemi, Lance C. Ingle, Ken Kennedy
2020 J jnl
Introduction to coalitions in graphs.
AKCE Int. J. Graphs Comb.
Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan
2020 J jnl
New resolvability parameters of graphs.
AKCE Int. J. Graphs Comb.
Stephen T. Hedetniemi, Renu C. Laskar, Henry Martyn Mulder
2020 J jnl
The upper domatic number of a graph.
AKCE Int. J. Graphs Comb.
Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Nicholas Phillips
2018 J jnl
Client-server and cost effective sets in graphs.
AKCE Int. J. Graphs Comb.
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi
2018 J jnl
Distribution centers in graphs.
Discret. Appl. Math.
Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi, Christian Moore
2018 J jnl
Rainbow disconnection in graphs.
Discuss. Math. Graph Theory
Gary Chartrand, Stephen Devereaux, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang
2017 J jnl
On ve-degrees and ev-degrees in graphs.
Discret. Math.
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis
2017 J jnl
Restricted optimal pebbling and domination in graphs.
Discret. Appl. Math.
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis
2016 J jnl
A Roman Domination Chain.
Graphs Comb.
Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
2016 J jnl
Domination number and Laplacian eigenvalue distribution.
Eur. J. Comb.
Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2016 J jnl
Double Roman domination.
Discret. Appl. Math.
Robert A. Beeler, Teresa W. Haynes, Stephen T. Hedetniemi
2016 J jnl
Neighborhood-restricted [≤2]-achromatic colorings.
Discret. Appl. Math.
James D. Chandler, Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi
2016 J jnl
Roman {2}-domination.
Discret. Appl. Math.
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
2015 J jnl
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets.
Theor. Comput. Sci.
Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy
2015 J jnl
Very cost effective bipartitions in graphs.
AKCE Int. J. Graphs Comb.
Teresa W. Haynes, Stephen T. Hedetniemi, Inna Vasylieva
2014 J jnl
Bounds on weak roman and 2-rainbow domination numbers.
Discret. Appl. Math.
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi
2014 J jnl
Downhill domination in graphs.
Discuss. Math. Graph Theory
Teresa W. Haynes, Stephen T. Hedetniemi, William B. Jamieson, Jessie D. Jamieson
2014 J jnl
Independent [1, k]-sets in graphs.
Australas. J Comb.
Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
2013 J jnl
Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets.
Comput. J.
Stephen T. Hedetniemi, David Pokrass Jacobs, K. E. Kennedy
2013 J jnl
Self-stabilizing Algorithms for Unfriendly Partitions into Two Disjoint Dominating Sets.
Parallel Process. Lett.
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, K. E. Kennedy, Alice A. McRae
2013 J jnl
[1, 2]-sets in graphs.
Discret. Appl. Math.
Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae
2012 J jnl
A self-stabilizing algorithm for optimally efficient sets in graphs.
Inf. Process. Lett.
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Hao Jiang, Ken Kennedy, Alice A. McRae
2011 J jnl
Matchability and k-maximal matchings.
Discret. Appl. Math.
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae
2011 J jnl
γ-graphs of graphs.
Discuss. Math. Graph Theory
Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson
2010 J jnl
Capacitated Domination.
Ars Comb.
Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae
2009 J jnl
A linear-time algorithm for broadcast domination in a tree.
Networks
John Dabney, Brian C. Dean, Stephen T. Hedetniemi
2009 J jnl
A note on trees, tables, and algorithms.
Networks
Wayne Goddard, Stephen T. Hedetniemi
2009 J jnl
Powerful alliances in graphs.
Discret. Math.
Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi
2008 Misc conf
Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space.
ICDCN
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2008 J jnl
Braodcast Chromatic Numbers of Graphs.
Ars Comb.
Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall
2008 J jnl
Distance- k knowledge in self-stabilizing algorithms.
Theor. Comput. Sci.
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2008 J jnl
On domination and reinforcement numbers in trees.
Discret. Math.
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki
2008 J jnl
Self-Stabilizing Graph Protocols.
Parallel Process. Lett.
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
2007 J jnl
Security in graphs.
Discret. Appl. Math.
Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi
2006 Misc conf
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees.
PDPTA
Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi
2006 J jnl
Broadcasts in graphs.
Discret. Appl. Math.
Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
2006 B conf
Distance-
SIROCCO
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2005 J jnl
An algorithm for partial Grundy number on trees.
Discret. Math.
Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae
2005 J jnl
Generalized subgraph-restricted matchings in graphs.
Discret. Math.
Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar
2005 J jnl
Self-Stabilizing Algorithms For Orderings And Colorings.
Int. J. Found. Comput. Sci.
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2005 J jnl
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs.
Int. J. Distributed Sens. Networks
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2004 J jnl
A Self-stabilizing Algorithm for Maximal 2-packing.
Nord. J. Comput.
Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen
2004 J jnl
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees.
Inf. Process. Lett.
Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi
2004 J jnl
Distance-two information in self-stabilizing algorithms.
Parallel Process. Lett.
Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
2004 J jnl
Domination and irredundance in tournaments.
Australas. J Comb.
K. Brooks Reid, Alice A. McRae, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
2004 A conf
Fault Tolerant Algorithms for Orderings and Colorings.
IPDPS
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2004 J jnl
Iterated colorings of graphs.
Discret. Math.
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle
2004 J jnl
Offensive alliances in graphs.
Discuss. Math. Graph Theory
Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs
2004 J jnl
Roman domination in graphs.
Discret. Math.
Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
2004 J jnl
Self-Stabilizing Maximal K-Dependent Sets In Linear Time.
Parallel Process. Lett.
Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
2003 — conf
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time.
ICDCS Workshops
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003 A conf
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap.
IPDPS
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003 — conf
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph.
IWDC
Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani
2003 J jnl
Defending the Roman Empire--A new strategy.
Discret. Math.
Michael A. Henning, Stephen T. Hedetniemi
2003 J jnl
Global Defensive Alliances in Graphs.
Electron. J. Comb.
Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning
2003 J jnl
Linear time self-stabilizing colorings.
Inf. Process. Lett.
Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003 J jnl
On the equality of the partial Grundy and upper ochromatic numbers of graphs.
Discret. Math.
Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins
2003 — conf
Self-Stabilizing Algorithms for {k}-Domination.
Self-Stabilizing Systems
Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
2003 Misc conf
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph.
HiPC
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003 A conf
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks.
IPDPS
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2002 J jnl
Domination in Graphs Applied to Electric Power Networks.
SIAM J. Discret. Math.
Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
2002 A conf
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time.
IPDPS
Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2002 J jnl
On
Discret. Math.
Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
2002 J jnl
Total irredundance in graphs.
Discret. Math.
Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
2001 J jnl
Domination Subdivision Numbers.
Discuss. Math. Graph Theory
Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe
2001 J jnl
Maximal matching stabilizes in time O(m).
Inf. Process. Lett.
Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2001 J jnl
Stable and unstable graphs with total irredundance number zero.
Ars Comb.
Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
2000 J jnl
Acyclic domination.
Discret. Math.
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
2000 J jnl
Domination and independence subdivision numbers of graphs.
Discuss. Math. Graph Theory
Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
2000 J jnl
Extremal graphs for inequalities involving domination parameters.
Discret. Math.
Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao
2000 J jnl
The complexity of approximating MAPs for belief networks with bounded probabilities.
Artif. Intell.
Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi
2000 J jnl
The even adjacency split problem for graphs.
Discret. Appl. Math.
Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman
1999 J jnl
Minus domination in graphs.
Discret. Math.
Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
1999 J jnl
On perfect neighborhood sets in graphs.
Discret. Math.
Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
1999 J jnl
Restrained domination in graphs.
Discret. Math.
Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus
1998 — book
Fundamentals of domination in graphs.
Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater
1998 J jnl
Independence and Irredundance in k-Regular Graphs.
Ars Comb.
Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1998 J jnl
Irredundant and perfect neighbourhood sets in trees.
Discret. Math.
Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
1997 J jnl
On weakly connected domination in graphs.
Discret. Math.
Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae
1997 J jnl
Using maximality and minimality conditions to construct inequality chains.
Discret. Math.
Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
1997 J jnl
k-Path Partitions in Trees.
Discret. Appl. Math.
Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
1996 J jnl
Computing Research Programs in the US.
Commun. ACM
Robert Geist, Madhu Chetuparambil, Stephen T. Hedetniemi, A. Joe Turner
1996 J jnl
Maximal Irredundant Functions.
Discret. Appl. Math.
Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1996 J jnl
Minus domination in regular graphs.
Discret. Math.
Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
1996 J jnl
The Algorithmic Complexity of Minus Domination in Graphs.
Discret. Appl. Math.
Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning
1995 J jnl
Distance independence domination in graphs.
Ars Comb.
Gerd Fricke, Stephen T. Hedetniemi, Michael A. Henning
1995 J jnl
Nearly perfect sets in graphs.
Discret. Math.
Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar
1995 J jnl
Properties of minimal dominating functions of graphs.
Ars Comb.
Ernest J. Cockayne, Gerd Fricke, Stephen T. Hedetniemi, Christina M. Mynhardt
1994 J jnl
Periodic gossiping on trees.
Discret. Appl. Math.
Roger Labahn, Stephen T. Hedetniemi, Renu C. Laskar
1994 J jnl
The Private Neighbor Cube.
SIAM J. Discret. Math.
Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1993 J jnl
Efficient Sets in Graphs.
Discret. Appl. Math.
Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs
1990 J jnl
Bibliography on domination in graphs and some basic definitions of domination parameters.
Discret. Math.
Stephen T. Hedetniemi, Renu C. Laskar
1990 J jnl
Introduction.
Discret. Math.
Stephen T. Hedetniemi, Renu C. Laskar
1990 J jnl
On the computational complexity of upper fractional domination.
Discret. Appl. Math.
Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
1989 J jnl
Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett.
Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
1989 J jnl
The subchromatic number of a graph.
Discret. Math.
Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
1988 J jnl
A survey of gossiping and broadcasting in communication networks.
Networks
Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Arthur L. Liestman
1988 J jnl
Gallai theorems for graphs, hypergraphs, and set systems.
Discret. Math.
Ernest J. Cockayne, Stephen T. Hedetniemi, Renu C. Laskar
1987 J jnl
On the equality of the grundy and ochromatic numbers of a graph.
J. Graph Theory
Paul Erdös, W. R. Hare, Stephen T. Hedetniemi, Renu C. Laskar
1986 J jnl
A linear algorithm for finding a minimum dominating set in a cactus.
Discret. Appl. Math.
Stephen T. Hedetniemi, Renu C. Laskar, John Pfaff
1986 J jnl
On the diagonal queens domination problem.
J. Comb. Theory A
Ernest J. Cockayne, Stephen T. Hedetniemi
1984 J jnl
A note on total domination.
Discret. Math.
Robert B. Allan, Renu C. Laskar, Stephen T. Hedetniemi
1981 J jnl
Information Dissemination in Trees.
SIAM J. Comput.
Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi
1981 J jnl
Partitioning trees: Matching, domination, and maximum diameter.
Int. J. Parallel Program.
Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
1980 J jnl
Rectilinear Steiner Trees in Rectangle Trees.
SIAM J. Algebraic Discret. Methods
Arthur M. Farley, Stephen T. Hedetniemi, Sandra L. Mitchell
1980 J jnl
Total domination in graphs.
Networks
Ernest J. Cockayne, R. M. Dawes, Stephen T. Hedetniemi
1979 J jnl
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs.
Inf. Process. Lett.
Sandra L. Mitchell, Stephen T. Hedetniemi
1979 J jnl
Linear Algorithms on Recursive Representations of Trees.
J. Comput. Syst. Sci.
Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi
1979 J jnl
Matchings and transversals in hypergraphs, domination and independence-in trees.
J. Comb. Theory B
Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
1979 J jnl
Minimum broadcast graphs.
Discret. Math.
Arthur M. Farley, Stephen T. Hedetniemi, Sandra Mitchell Mitchell, Andrzej Proskurowski
1978 J jnl
A linear algorithm for disjoint matchings in trees.
Discret. Math.
Ernest J. Cockayne, Bert L. Hartnell, Stephen T. Hedetniemi
1978 J jnl
Disjoint cliques in regular graphs of degree seven and eight.
J. Comb. Theory B
Ernest J. Cockayne, Stephen T. Hedetniemi
1977 J jnl
A property of trees in terms of unique connected subgraphs.
J. Graph Theory
Stephen T. Hedetniemi, Diane M. Spresser
1977 J jnl
Towards a theory of domination in graphs.
Networks
Ernest J. Cockayne, Stephen T. Hedetniemi
1976 J jnl
Disjoint independent dominating sets in graphs.
Discret. Math.
Ernest J. Cockayne, Stephen T. Hedetniemi
1976 J jnl
On the optional hamiltonian completion problem.
Networks
Peter J. Slater, Seymour E. Goodman, Stephen T. Hedetniemi
1976 J jnl
b-Matchings in Trees.
SIAM J. Comput.
Seymour E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan
1975 J jnl
A Linear Algorithm for the Domination Number of a Tree.
Inf. Process. Lett.
Ernest J. Cockayne, Seymour E. Goodman, Stephen T. Hedetniemi
1975 J jnl
Advances on the Hamiltonian Completion Problem.
J. ACM
Seymour E. Goodman, Stephen T. Hedetniemi, Peter J. Slater
1974 J jnl
On Hamiltonian Walks in Graphs.
SIAM J. Comput.
Seymour E. Goodman, Stephen T. Hedetniemi
1973 J jnl
Eulerian Walks in Graphs.
SIAM J. Comput.
Seymour E. Goodman, Stephen T. Hedetniemi
1972 J jnl
S-Semigroups of Automata.
J. ACM
Arthur C. Fleck, Stephen T. Hedetniemi, Robert H. Oehmke
1970 J jnl
R70-36 Maximin Automata.
IEEE Trans. Computers
Stephen T. Hedetniemi
1963 — conf
Determining fastest routes using fixed schedules.
AFIPS Spring Joint Computing Conference
Bernard M. Levin, Stephen T. Hedetniemi