Stephen T. Hedetniemi
Affiliations:- Clemson University, USA
According to our database1,
Stephen T. Hedetniemi
authored at least 127 papers
between 1963 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
1965
1970
1975
1980
1985
1990
1995
2000
2005
2010
2015
2020
0
5
10
1
1
3
3
2
5
2
3
3
1
2
1
3
4
1
1
4
8
5
3
3
5
3
2
3
4
3
2
1
3
2
2
1
2
1
2
2
4
2
2
3
2
1
1
1
1
1
2
1
6
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2023
2022
CoRR, 2022
2020
2018
2017
2016
2015
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets.
Theor. Comput. Sci., 2015
2014
2013
Self-stabilizing Algorithms for Unfriendly Partitions into Two Disjoint Dominating Sets.
Parallel Process. Lett., 2013
Comput. J., 2013
2012
Inf. Process. Lett., 2012
2011
2010
Capacitated Domination.
Ars Comb., 2010
2009
2008
Braodcast Chromatic Numbers of Graphs.
Ars Comb., 2008
Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008
2007
2006
Proceedings of the Structural Information and Communication Complexity, 2006
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, 2006
2005
Int. J. Found. Comput. Sci., 2005
Int. J. Distributed Sens. Networks, 2005
2004
Parallel Process. Lett., 2004
Parallel Process. Lett., 2004
A Self-stabilizing Algorithm for Maximal 2-packing.
Nord. J. Comput., 2004
Inf. Process. Lett., 2004
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004
2003
Discret. Math., 2003
Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph.
Proceedings of the Distributed Computing, 2003
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003
Proceedings of the 23rd International Conference on Distributed Computing Systems Workshops (ICDCS 2003 Workshops), 2003
Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003
2002
SIAM J. Discret. Math., 2002
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002
2001
Stable and unstable graphs with total irredundance number zero.
Ars Comb., 2001
2000
Discuss. Math. Graph Theory, 2000
Discret. Math., 2000
Artif. Intell., 2000
1999
1998
Independence and Irredundance in k-Regular Graphs.
Ars Comb., 1998
Fundamentals of domination in graphs.
Pure and applied mathematics 208, Dekker, ISBN: 978-0-8247-0033-1, 1998
1997
Discret. Math., 1997
1996
1995
Distance independence domination in graphs.
Ars Comb., 1995
Properties of minimal dominating functions of graphs.
Ars Comb., 1995
1994
1993
1990
Bibliography on domination in graphs and some basic definitions of domination parameters.
Discret. Math., 1990
Introduction.
Discret. Math., 1990
Discret. Appl. Math., 1990
1989
1988
1987
J. Graph Theory, 1987
1986
Discret. Appl. Math., 1986
1984
1981
Int. J. Parallel Program., 1981
1980
SIAM J. Algebraic Discret. Methods, 1980
1979
J. Comb. Theory B, 1979
Inf. Process. Lett., 1979
1978
J. Comb. Theory B, 1978
1977
1976
1975
1974
1973
1972
1970
1963
Proceedings of the 1963 spring joint computer conference, 1963