**Dr. Stephen Hedetniemi**, Professor Emeritus of Computer Science, retired in 2011 and has been very busy since his retirement. See below for all his publications and efforts within his discipline:

**Book Details**:

**In November 2016, he co-edited the following book, published by Springer:**

R. Gera, S. Hedetniemi, and C. Larson, Editors, Graph Theory, Favorite Conjectures and Open Problems, Springer, 2016, 291 pp.

**He published the following chapter in the above book:**

S. T. Hedetniemi, My Top 10 Graph Theory Conjectures and Open Problems, in Graph Theory, Favorite Conjectures and Open Problems, R. Gera, S. T. Hedetniemi and C. Larson, Editors, Springer, 2016, 109-134.

**In November 2018**, he co-edited Volume II of this book: R. Gera, T.W. Haynes and S. T. Hedetniemi, Editors, Graph Theory, Favorite Conjectures and Open Problems, Springer, 2018, 281 pp.

**He co-published the following chapter in the above book:**

R. Gera, T. W. Haynes, S. T. Hedetniemi and M. A. Henning, An annotated glossary of graph theory parameters, with conjectures, Graph Theory, Favorite Conjectures and Open Problems, Vol. II, R. Gera, S. T. Hedetniemi and C. Larson, eds., Springer, 2018, 177-281.

**In 2018,** Dr. Hedetniemi co-edited with T. W. Haynes a special volume of the Journal of Combinatorial Mathematics and Combinatorial Computing in Memory of Peter J. Slater.

**In April 2020**, he co-edited the following two books, now in press, to be published by Springer.

1. W. Haynes, S. T. Hedetniemi, and M. A. Henning, Editors, Topics in Domination in Graphs, Springer, in press.

#### 2. W. Haynes, S. T. Hedetniemi, and M. A. Henning, Editors, Structures of Domination in Graphs, Springer, in press.

**He is currently under contract with Springer to co-write the following research text, to be published in 2021:**

W. Haynes, S. T. Hedetniemi, and M. A. Henning, Domination in Graphs, Core Concepts.

**He is currently a co-editor of the following special volume:**

G. Chartrand, P. Zhang, T. W. Haynes and S. T. Hedetniemi, Special Volume in Honor of Frank Harary of Discrete Mathematics Letters, to appear in March 2021.

**Published Writing Details**: The following is a listing of all research journal articles Dr. Hedetniemi has published since retiring:

**2012**

#### [226] W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi, and A. A. McRae, The algorithmic complexity of domination digraphs, J. Combin. Math. Combin. Comput. 80:367-384, 2012.

#### [227] T. W. Haynes, S.M. Hedetniemi, S. T. Hedetniemi, T. L. McCoy, and I. Vasylieva, Cost effective domination in graphs, Congr. Numer. 211:197-209, 2012.

#### [228] J. T. Hedetniemi, K. D. Hedetniemi, S.M. Hedetniemi, and S. T. Hedetniemi, Secondary and internal distances in graphs II, AKCE Int. J. Graphs Comb., 9(1):85-113, 2012.

#### [229] S.M. Hedetniemi, S.T. Hedetniemi, H. Jiang, K. E. Kennedy and A. McRae, A self- stabilizing algorithm for optimally efficient sets in graphs, Inform. Process Lett. 112(16):621-623, 2012.

#### [230] S.T. Hedetniemi, D. P. Jacobs and K. E. Kennedy, Linear-time self-stabilizing algorithms for disjoint independent sets, The Computer Journal 2012: doi: 10.1093/comjnl/bxs128.

**2013**

#### [231] M. Chellali, T. W. Haynes, S. T. Hedetniemi, and A. McRae, [1,2]-sets in graphs, Discrete Appl. Math. 161:2885-2893, 2013.

#### [232] G. Fricke, T. J. Oâ€™Brien, W. C. Schroeder and S. T. Hedetniemi, A new lower bound for the irredundance number of a tree, J. Combin. Math. Combin. Comput. 85:345-352, 2013.

#### [233] J. T. Hedetniemi, S.M. Hedetniemi and S. T. Hedetniemi, Perfection in graphs, a new look at irredundance, J. Combin. Math. Combin. Comput. 85:129-139, 2013.

#### [234] J. T. Hedetniemi, S.M. Hedetniemi, S. T. Hedetniemi, and T. M. Lewis, Analyzing graphs by degrees, AKCE Int. J. Graphs Comb. 10(4):359-375, 2013.

#### [235] S.M. Hedetniemi, S. T. Hedetniemi, K. E. Kennedy and A. A. McRae, Self-stabilizing algorithms for unfriendly partitions into two disjoint dominating sets, Parallel Process. Lett., 23(1), 2013 (11 pages), DOI:10.1142/S0129626413500011.

#### [236] S.M. Hedetniemi, S.T. Hedetniemi, R. C. Laskar and H. M. Mulder, Quorum colorings of graphs, AKCE Internat. J. Graphs Combin. 10(1):97-109, 2013.

#### [237] S. T. Hedetniemi, R. R. Rubalcaba, P. J. Slater, and M. Walsh, Few compare to the great Roman empire, Congr. Numer. 217:129-136, 2013.

#### [238] I. Justus, T. W. Haynes and S. T. Hedetniemi, Vertex types in trees, Congr. Numer. 215:105-113, 2013.

**2014**

#### [239] M. Chellali, O. Favaron, T. W. Haynes, S. T. Hedetniemi, and A. A. McRae, Independent [1,k]-sets in graphs, Australas. J. Comb. 59(1):144-156, 2014.

#### [240] M. Chellali, T. W. Haynes, and S. T. Hedetniemi, Bounds on weak roman and 2-rainbow domination numbers, Discrete Appl. Math., 178:27-32, 2014.

#### [241] P. Delgado, T. W. Haynes and S. T. Hedetniemi, Bipartitions based on degree constraints, Congr. Numer. 219: 193-206, 2014.

#### [242] T. W. Haynes, S.M. Hedetniemi, and S. T. Hedetniemi, Two parameters equivalent to paired-domination, Graph Theory Notes of New York LXVI, 1-4, (2014).

#### [243] T. W. Haynes, S. T. Hedetniemi, J. D. Jamieson, and W. B. Jamieson, Downhill domination in graphs, Discuss. Math. Graph Theory 34:603-612, 2014.

#### [244] T. W. Haynes, S. T. Hedetniemi and H. Scott, Balanced sets in graphs, Util. Math. 93:343-356, 2014.

#### [245] S. T. Hedetniemi, New upper bounds for the pseudoachromatic and upper irredundance numbers of a graph, Util. Math. 94:83-100, 2014.

**2015**

#### [246] D. Ahmadi, G. H. Fricke, C. Schroeder, S. T. Hedetniemi and R. C. Laskar, Broadcast irredundance in graphs, Congr. Numer. 224:17-31, 2015.

#### [247] S. Arumugam, S. T. Hedetniemi, S.M. Hedetniemi, L. Sathikala and S. Sudha, The covering chain of a graph, Util. Math. 98:183-196, 2015.

#### [248] M. Chellali, T. W. Haynes and S. T. Hedetniemi, Roman and total domination, Quaest. Math., 38(6):749-757, 2015.

#### [249] T. W. Haynes, S. T. Hedetniemi and I. Vasylieva, Very cost effective bipartitions of graphs, AKCE Internat. J. Graphs Combin. 12:155-160, 2015.

#### [250] S. T. Hedetniemi, D. P. Jacobs and K. E. Kennedy, A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets, Theoret. Comput. Sci. 593:132-138, 2015.

#### [251] K. R. Hutson, S. T. Hedetniemi and R. Forrester, Constructing ï§-sets of grids, J. Combin. Math. Combin. Comput. 95:3-26, 2015.

**2016**