Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stephen T. Hedetniemi
@article{DBLP:journals/dmgt/HaynesHHMM23,
author = {Teresa W. Haynes and
Jason Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae and
Raghuveer Mohan},
title = {Coalition graphs of paths, cycles, and trees},
journal = {Discuss. Math. Graph Theory},
volume = {43},
number = {4},
pages = {931--946},
year = {2023},
url = {https://doi.org/10.7151/dmgt.2416},
doi = {10.7151/DMGT.2416},
timestamp = {Thu, 27 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HaynesHHMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-11118,
author = {Barton F. Cone and
Stephen T. Hedetniemi and
Lance C. Ingle and
Ken Kennedy},
title = {Performance Comparisons of Self-stabilizing Algorithms for Maximal
Independent Sets},
journal = {CoRR},
volume = {abs/2203.11118},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.11118},
doi = {10.48550/ARXIV.2203.11118},
eprinttype = {arXiv},
eprint = {2203.11118},
timestamp = {Tue, 29 Mar 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-11118.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/HaynesHHMP20,
author = {Teresa W. Haynes and
Jason T. Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae and
Nicholas Phillips},
title = {The upper domatic number of a graph},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {17},
number = {1},
pages = {139--148},
year = {2020},
url = {https://doi.org/10.1016/j.akcej.2018.09.003},
doi = {10.1016/J.AKCEJ.2018.09.003},
timestamp = {Fri, 11 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/akcej/HaynesHHMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/HaynesHHMM20,
author = {Teresa W. Haynes and
Jason T. Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae and
Raghuveer Mohan},
title = {Introduction to coalitions in graphs},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {17},
number = {2},
pages = {653--659},
year = {2020},
url = {https://doi.org/10.1080/09728600.2020.1832874},
doi = {10.1080/09728600.2020.1832874},
timestamp = {Wed, 06 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/akcej/HaynesHHMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/HedetniemiLM20,
author = {Stephen T. Hedetniemi and
Renu C. Laskar and
Henry Martyn Mulder},
title = {New resolvability parameters of graphs},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {17},
number = {3},
pages = {1028--1038},
year = {2020},
url = {https://doi.org/10.1016/j.akcej.2019.12.021},
doi = {10.1016/J.AKCEJ.2019.12.021},
timestamp = {Fri, 11 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/akcej/HedetniemiLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/ChellaliHH18,
author = {Mustapha Chellali and
Teresa W. Haynes and
Stephen T. Hedetniemi},
title = {Client-server and cost effective sets in graphs},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {15},
number = {2},
pages = {211--218},
year = {2018},
url = {https://doi.org/10.1016/j.akcej.2017.09.001},
doi = {10.1016/J.AKCEJ.2017.09.001},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/akcej/ChellaliHH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DesormeauxHHM18,
author = {Wyatt J. Desormeaux and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Christian Moore},
title = {Distribution centers in graphs},
journal = {Discret. Appl. Math.},
volume = {243},
pages = {186--193},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.02.009},
doi = {10.1016/J.DAM.2018.02.009},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DesormeauxHHM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ChartrandDHHZ18,
author = {Gary Chartrand and
Stephen Devereaux and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Ping Zhang},
title = {Rainbow disconnection in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {38},
number = {4},
pages = {1007--1021},
year = {2018},
url = {https://doi.org/10.7151/dmgt.2061},
doi = {10.7151/DMGT.2061},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ChartrandDHHZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChellaliHHL17,
author = {Mustapha Chellali and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Thomas M. Lewis},
title = {Restricted optimal pebbling and domination in graphs},
journal = {Discret. Appl. Math.},
volume = {221},
pages = {46--53},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.12.029},
doi = {10.1016/J.DAM.2016.12.029},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChellaliHHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChellaliHHL17,
author = {Mustapha Chellali and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Thomas M. Lewis},
title = {On ve-degrees and ev-degrees in graphs},
journal = {Discret. Math.},
volume = {340},
number = {2},
pages = {31--38},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.07.008},
doi = {10.1016/J.DISC.2016.07.008},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChellaliHHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChellaliHHM16,
author = {Mustapha Chellali and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {Roman \{2\}-domination},
journal = {Discret. Appl. Math.},
volume = {204},
pages = {22--28},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.11.013},
doi = {10.1016/J.DAM.2015.11.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChellaliHHM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChandlerDHH16,
author = {James D. Chandler and
Wyatt J. Desormeaux and
Teresa W. Haynes and
Stephen T. Hedetniemi},
title = {Neighborhood-restricted [{\(\leq\)}2]-achromatic colorings},
journal = {Discret. Appl. Math.},
volume = {207},
pages = {39--44},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.02.023},
doi = {10.1016/J.DAM.2016.02.023},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChandlerDHH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BeelerHH16,
author = {Robert A. Beeler and
Teresa W. Haynes and
Stephen T. Hedetniemi},
title = {Double Roman domination},
journal = {Discret. Appl. Math.},
volume = {211},
pages = {23--29},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.03.017},
doi = {10.1016/J.DAM.2016.03.017},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BeelerHH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/HedetniemiJT16,
author = {Stephen T. Hedetniemi and
David Pokrass Jacobs and
Vilmar Trevisan},
title = {Domination number and Laplacian eigenvalue distribution},
journal = {Eur. J. Comb.},
volume = {53},
pages = {66--71},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.11.005},
doi = {10.1016/J.EJC.2015.11.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/HedetniemiJT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChellaliHHHM16,
author = {Mustapha Chellali and
Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {A Roman Domination Chain},
journal = {Graphs Comb.},
volume = {32},
number = {1},
pages = {79--92},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1566-x},
doi = {10.1007/S00373-015-1566-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ChellaliHHHM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/HaynesHV15,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
Inna Vasylieva},
title = {Very cost effective bipartitions in graphs},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {12},
number = {Issues},
pages = {155--160},
year = {2015},
url = {https://doi.org/10.1016/j.akcej.2015.11.009},
doi = {10.1016/J.AKCEJ.2015.11.009},
timestamp = {Fri, 22 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/akcej/HaynesHV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HedetniemiJK15,
author = {Stephen T. Hedetniemi and
David Pokrass Jacobs and
K. E. Kennedy},
title = {A theorem of Ore and self-stabilizing algorithms for disjoint minimal
dominating sets},
journal = {Theor. Comput. Sci.},
volume = {593},
pages = {132--138},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.06.004},
doi = {10.1016/J.TCS.2015.06.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HedetniemiJK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/ChellaliFHHM14,
author = {Mustapha Chellali and
Odile Favaron and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {Independent [1, k]-sets in graphs},
journal = {Australas. {J} Comb.},
volume = {59},
pages = {144--156},
year = {2014},
url = {http://ajc.maths.uq.edu.au/pdf/59/ajc\_v59\_p144.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/ChellaliFHHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChellaliHH14,
author = {Mustapha Chellali and
Teresa W. Haynes and
Stephen T. Hedetniemi},
title = {Bounds on weak roman and 2-rainbow domination numbers},
journal = {Discret. Appl. Math.},
volume = {178},
pages = {27--32},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.06.016},
doi = {10.1016/J.DAM.2014.06.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChellaliHH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HaynesHJJ14,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
William B. Jamieson and
Jessie D. Jamieson},
title = {Downhill domination in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {34},
number = {3},
pages = {603--612},
year = {2014},
url = {https://doi.org/10.7151/dmgt.1760},
doi = {10.7151/DMGT.1760},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HaynesHJJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/HedetniemiJK13,
author = {Stephen T. Hedetniemi and
David Pokrass Jacobs and
K. E. Kennedy},
title = {Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets},
journal = {Comput. J.},
volume = {56},
number = {11},
pages = {1381--1387},
year = {2013},
url = {https://doi.org/10.1093/comjnl/bxs128},
doi = {10.1093/COMJNL/BXS128},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/HedetniemiJK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChellaliHHM13,
author = {Mustapha Chellali and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {[1, 2]-sets in graphs},
journal = {Discret. Appl. Math.},
volume = {161},
number = {18},
pages = {2885--2893},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.06.012},
doi = {10.1016/J.DAM.2013.06.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChellaliHHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/HedetniemiHKM13,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
K. E. Kennedy and
Alice A. McRae},
title = {Self-stabilizing Algorithms for Unfriendly Partitions into Two Disjoint
Dominating Sets},
journal = {Parallel Process. Lett.},
volume = {23},
number = {1},
year = {2013},
url = {https://doi.org/10.1142/S0129626413500011},
doi = {10.1142/S0129626413500011},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/HedetniemiHKM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HedetniemiHJKM12,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Hao Jiang and
Ken Kennedy and
Alice A. McRae},
title = {A self-stabilizing algorithm for optimally efficient sets in graphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {16},
pages = {621--623},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.02.014},
doi = {10.1016/J.IPL.2012.02.014},
timestamp = {Tue, 25 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HedetniemiHJKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DeanHHLM11,
author = {Brian C. Dean and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Jason Lewis and
Alice A. McRae},
title = {Matchability and k-maximal matchings},
journal = {Discret. Appl. Math.},
volume = {159},
number = {1},
pages = {15--22},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.09.006},
doi = {10.1016/J.DAM.2010.09.006},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DeanHHLM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/FrickeHHH11,
author = {Gerd Fricke and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Kevin R. Hutson},
title = {{\(\gamma\)}-graphs of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {3},
pages = {517--531},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1562},
doi = {10.7151/DMGT.1562},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/FrickeHHH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/GoddardHHM10,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
James L. Huff and
Alice A. McRae},
title = {Capacitated Domination},
journal = {Ars Comb.},
volume = {96},
year = {2010},
timestamp = {Thu, 07 Mar 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/GoddardHHM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrighamDHH09,
author = {Robert C. Brigham and
Ronald D. Dutton and
Teresa W. Haynes and
Stephen T. Hedetniemi},
title = {Powerful alliances in graphs},
journal = {Discret. Math.},
volume = {309},
number = {8},
pages = {2140--2147},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2006.10.026},
doi = {10.1016/J.DISC.2006.10.026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrighamDHH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/DabneyDH09,
author = {John Dabney and
Brian C. Dean and
Stephen T. Hedetniemi},
title = {A linear-time algorithm for broadcast domination in a tree},
journal = {Networks},
volume = {53},
number = {2},
pages = {160--169},
year = {2009},
url = {https://doi.org/10.1002/net.20275},
doi = {10.1002/NET.20275},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/DabneyDH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GoddardH09,
author = {Wayne Goddard and
Stephen T. Hedetniemi},
title = {A note on trees, tables, and algorithms},
journal = {Networks},
volume = {53},
number = {2},
pages = {184--190},
year = {2009},
url = {https://doi.org/10.1002/net.20282},
doi = {10.1002/NET.20282},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GoddardH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/GoddardHHHR08,
author = {Wayne Goddard and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
John M. Harris and
Douglas F. Rall},
title = {Braodcast Chromatic Numbers of Graphs},
journal = {Ars Comb.},
volume = {86},
year = {2008},
timestamp = {Wed, 26 Nov 2008 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/GoddardHHHR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BlairGHHJK08,
author = {Jean R. S. Blair and
Wayne Goddard and
Stephen T. Hedetniemi and
Steven B. Horton and
Patrick Jones and
Grzegorz Kubicki},
title = {On domination and reinforcement numbers in trees},
journal = {Discret. Math.},
volume = {308},
number = {7},
pages = {1165--1175},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.03.067},
doi = {10.1016/J.DISC.2007.03.067},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BlairGHHJK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/GoddardHJSX08,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani and
Zhenyu Xu},
title = {Self-Stabilizing Graph Protocols},
journal = {Parallel Process. Lett.},
volume = {18},
number = {1},
pages = {189--199},
year = {2008},
url = {https://doi.org/10.1142/S0129626408003314},
doi = {10.1142/S0129626408003314},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/GoddardHJSX08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GoddardHJT08,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Vilmar Trevisan},
title = {Distance- k knowledge in self-stabilizing algorithms},
journal = {Theor. Comput. Sci.},
volume = {399},
number = {1-2},
pages = {118--127},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.02.009},
doi = {10.1016/J.TCS.2008.02.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GoddardHJT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/GoddardHJS08,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
editor = {Shrisha Rao and
Mainak Chatterjee and
Prasad Jayanti and
C. Siva Ram Murthy and
Sanjoy Kumar Saha},
title = {Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization
in Constant Space},
booktitle = {Distributed Computing and Networking, 9th International Conference,
{ICDCN} 2008, Kolkata, India, January 5-8, 2008},
series = {Lecture Notes in Computer Science},
volume = {4904},
pages = {182--190},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-77444-0\_16},
doi = {10.1007/978-3-540-77444-0\_16},
timestamp = {Mon, 22 May 2023 09:50:35 +0200},
biburl = {https://dblp.org/rec/conf/icdcn/GoddardHJS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrighamDH07,
author = {Robert C. Brigham and
Ronald D. Dutton and
Stephen T. Hedetniemi},
title = {Security in graphs},
journal = {Discret. Appl. Math.},
volume = {155},
number = {13},
pages = {1708--1714},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.03.009},
doi = {10.1016/J.DAM.2007.03.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BrighamDH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DunbarEHHH06,
author = {Jean E. Dunbar and
David J. Erwin and
Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi},
title = {Broadcasts in graphs},
journal = {Discret. Appl. Math.},
volume = {154},
number = {1},
pages = {59--75},
year = {2006},
url = {https://doi.org/10.1016/j.dam.2005.07.009},
doi = {10.1016/J.DAM.2005.07.009},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DunbarEHHH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pdpta/GoddardHS06,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
Zhengnan Shi},
editor = {Hamid R. Arabnia},
title = {An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in
Trees},
booktitle = {Proceedings of the International Conference on Parallel and Distributed
Processing Techniques and Applications {\&} Conference on Real-Time
Computing Systems and Applications, {PDPTA} 2006, Las Vegas, Nevada,
USA, June 26-29, 2006, Volume 2},
pages = {797--803},
publisher = {{CSREA} Press},
year = {2006},
timestamp = {Tue, 28 Nov 2006 14:38:48 +0100},
biburl = {https://dblp.org/rec/conf/pdpta/GoddardHS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/GoddardHJT06,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Vilmar Trevisan},
editor = {Paola Flocchini and
Leszek Gasieniec},
title = {Distance-\emph{k} Information in Self-stabilizing Algorithms},
booktitle = {Structural Information and Communication Complexity, 13th International
Colloquium, {SIROCCO} 2006, Chester, UK, July 2-5, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4056},
pages = {349--356},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780823\_27},
doi = {10.1007/11780823\_27},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/GoddardHJT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GoddardHHL05,
author = {Wayne Goddard and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Renu C. Laskar},
title = {Generalized subgraph-restricted matchings in graphs},
journal = {Discret. Math.},
volume = {293},
number = {1-3},
pages = {129--138},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.08.027},
doi = {10.1016/J.DISC.2004.08.027},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GoddardHHL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ShiGHKLM05,
author = {Zhengnan Shi and
Wayne Goddard and
Stephen T. Hedetniemi and
Ken Kennedy and
Renu C. Laskar and
Alice A. McRae},
title = {An algorithm for partial Grundy number on trees},
journal = {Discret. Math.},
volume = {304},
number = {1-3},
pages = {108--116},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.09.008},
doi = {10.1016/J.DISC.2005.09.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ShiGHKLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijdsn/GoddardHJS05,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {Self-Stabilizing Global Optimization Algorithms for Large Network
Graphs},
journal = {Int. J. Distributed Sens. Networks},
volume = {1},
number = {3{\&}4},
pages = {329--344},
year = {2005},
url = {https://doi.org/10.1080/15501320500330745},
doi = {10.1080/15501320500330745},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijdsn/GoddardHJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/GoddardHJS05,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {Self-Stabilizing Algorithms For Orderings And Colorings},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {1},
pages = {19--36},
year = {2005},
url = {https://doi.org/10.1142/S012905410500284X},
doi = {10.1142/S012905410500284X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/GoddardHJS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/ReidMHH04,
author = {K. Brooks Reid and
Alice A. McRae and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi},
title = {Domination and irredundance in tournaments},
journal = {Australas. {J} Comb.},
volume = {29},
pages = {157--172},
year = {2004},
url = {http://ajc.maths.uq.edu.au/pdf/29/ajc\_v29\_p157.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/ReidMHH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneDHH04,
author = {Ernest J. Cockayne and
Paul A. Dreyer Jr. and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi},
title = {Roman domination in graphs},
journal = {Discret. Math.},
volume = {278},
number = {1-3},
pages = {11--22},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.06.004},
doi = {10.1016/J.DISC.2003.06.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CockayneDHH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HedetniemiHMPT04,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae and
Dee Parks and
Jan Arne Telle},
title = {Iterated colorings of graphs},
journal = {Discret. Math.},
volume = {278},
number = {1-3},
pages = {81--108},
year = {2004},
url = {https://doi.org/10.1016/S0012-365X(03)00247-4},
doi = {10.1016/S0012-365X(03)00247-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HedetniemiHMPT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/FavaronFGHHKS04,
author = {Odile Favaron and
Gerd Fricke and
Wayne Goddard and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Petter Kristiansen and
Renu C. Laskar and
R. Duane Skaggs},
title = {Offensive alliances in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {24},
number = {2},
pages = {263--175},
year = {2004},
url = {https://doi.org/10.7151/dmgt.1230},
doi = {10.7151/DMGT.1230},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/FavaronFGHHKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ShiGH04,
author = {Zhengnan Shi and
Wayne Goddard and
Stephen T. Hedetniemi},
title = {An anonymous self-stabilizing algorithm for 1-maximal independent
set in trees},
journal = {Inf. Process. Lett.},
volume = {91},
number = {2},
pages = {77--83},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2004.03.010},
doi = {10.1016/J.IPL.2004.03.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ShiGH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/GairingGHK04,
author = {Martin Gairing and
Robert Geist and
Stephen T. Hedetniemi and
Petter Kristiansen},
title = {A Self-stabilizing Algorithm for Maximal 2-packing},
journal = {Nord. J. Comput.},
volume = {11},
number = {1},
pages = {1--11},
year = {2004},
timestamp = {Wed, 03 May 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/GairingGHK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/GairingGHJ04,
author = {Martin Gairing and
Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs},
title = {Self-Stabilizing Maximal K-Dependent Sets In Linear Time},
journal = {Parallel Process. Lett.},
volume = {14},
number = {1},
pages = {75--82},
year = {2004},
url = {https://doi.org/10.1142/S0129626404001726},
doi = {10.1142/S0129626404001726},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/GairingGHJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ppl/GairingGHKM04,
author = {Martin Gairing and
Wayne Goddard and
Stephen T. Hedetniemi and
Petter Kristiansen and
Alice A. McRae},
title = {Distance-two information in self-stabilizing algorithms},
journal = {Parallel Process. Lett.},
volume = {14},
number = {3-4},
pages = {387--398},
year = {2004},
url = {https://doi.org/10.1142/S0129626404001970},
doi = {10.1142/S0129626404001970},
timestamp = {Tue, 24 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ppl/GairingGHKM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/GoddardHJS04,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {Fault Tolerant Algorithms for Orderings and Colorings},
booktitle = {18th International Parallel and Distributed Processing Symposium {(IPDPS}
2004), {CD-ROM} / Abstracts Proceedings, 26-30 April 2004, Santa Fe,
New Mexico, {USA}},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/IPDPS.2004.1303177},
doi = {10.1109/IPDPS.2004.1303177},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/GoddardHJS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HaynesHH03,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
Michael A. Henning},
title = {Global Defensive Alliances in Graphs},
journal = {Electron. J. Comb.},
volume = {10},
year = {2003},
url = {https://doi.org/10.37236/1740},
doi = {10.37236/1740},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/HaynesHH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HaynesHHS03,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
Michael A. Henning and
Peter J. Slater},
title = {\emph{H}-forming sets in graphs},
journal = {Discret. Math.},
volume = {262},
number = {1-3},
pages = {159--169},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00496-X},
doi = {10.1016/S0012-365X(02)00496-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HaynesHHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HenningH03,
author = {Michael A. Henning and
Stephen T. Hedetniemi},
title = {Defending the Roman Empire--A new strategy},
journal = {Discret. Math.},
volume = {266},
number = {1-3},
pages = {239--251},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00811-7},
doi = {10.1016/S0012-365X(02)00811-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HenningH03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosHLP03,
author = {Paul Erd{\"{o}}s and
Stephen T. Hedetniemi and
Renu C. Laskar and
Geert C. E. Prins},
title = {On the equality of the partial Grundy and upper ochromatic numbers
of graphs},
journal = {Discret. Math.},
volume = {272},
number = {1},
pages = {53--64},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00184-5},
doi = {10.1016/S0012-365X(03)00184-5},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ErdosHLP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HedetniemiJS03,
author = {Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {Linear time self-stabilizing colorings},
journal = {Inf. Process. Lett.},
volume = {87},
number = {5},
pages = {251--255},
year = {2003},
url = {https://doi.org/10.1016/S0020-0190(03)00299-0},
doi = {10.1016/S0020-0190(03)00299-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HedetniemiJS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hipc/GoddardHJS03,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
editor = {Timothy Mark Pinkston and
Viktor K. Prasanna},
title = {Self-Stabilizing Distributed Algorithm for Strong Matching in a System
Graph},
booktitle = {High Performance Computing - HiPC 2003, 10th International Conference,
Hyderabad, India, December 17-20, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2913},
pages = {66--73},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24596-4\_8},
doi = {10.1007/978-3-540-24596-4\_8},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/hipc/GoddardHJS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcsw/GoddardHJS03,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {A Robust Distributed Generalized Matching Protocol that Stabilizes
in Linear Time},
booktitle = {23rd International Conference on Distributed Computing Systems Workshops
{(ICDCS} 2003 Workshops), 19-22 May 2003, Providence, RI, {USA}},
pages = {461--465},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/ICDCSW.2003.1203595},
doi = {10.1109/ICDCSW.2003.1203595},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdcsw/GoddardHJS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/GoddardHJS03,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {Self-Stabilizing Protocols for Maximal Matching and Maximal Independent
Sets for Ad Hoc Networks},
booktitle = {17th International Parallel and Distributed Processing Symposium {(IPDPS}
2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings},
pages = {162},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/IPDPS.2003.1213302},
doi = {10.1109/IPDPS.2003.1213302},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/GoddardHJS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/GoddardHJS03a,
author = {Wayne Goddard and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {A Self-Stabilizing Distributed Algorithm for Minimal Total Domination
in an Arbitrary System Grap},
booktitle = {17th International Parallel and Distributed Processing Symposium {(IPDPS}
2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings},
pages = {240},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/IPDPS.2003.1213437},
doi = {10.1109/IPDPS.2003.1213437},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/GoddardHJS03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwdc/XuHGS03,
author = {Zhenyu Xu and
Stephen T. Hedetniemi and
Wayne Goddard and
Pradip K. Srimani},
editor = {Samir R. Das and
Sajal K. Das},
title = {A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary
Network Graph},
booktitle = {Distributed Computing - {IWDC} 2003, 5th International Workshop, Kolkata,
India, December 27-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2918},
pages = {26--32},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24604-6\_3},
doi = {10.1007/978-3-540-24604-6\_3},
timestamp = {Tue, 10 Sep 2019 13:47:28 +0200},
biburl = {https://dblp.org/rec/conf/iwdc/XuHGS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/GairingHKM03,
author = {Martin Gairing and
Stephen T. Hedetniemi and
Petter Kristiansen and
Alice A. McRae},
editor = {Shing{-}Tsaan Huang and
Ted Herman},
title = {Self-Stabilizing Algorithms for \{k\}-Domination},
booktitle = {Self-Stabilizing Systems, 6th International Symposium, {SSS} 2003,
San Francisco, CA, USA, June 24-25, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2704},
pages = {49--60},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45032-7\_4},
doi = {10.1007/3-540-45032-7\_4},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/sss/GairingHKM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FavaronHHR02,
author = {Odile Favaron and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Douglas F. Rall},
title = {On \emph{k}-dependent domination},
journal = {Discret. Math.},
volume = {249},
number = {1-3},
pages = {83--94},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00236-9},
doi = {10.1016/S0012-365X(01)00236-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FavaronHHR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FavaronHHHK02,
author = {Odile Favaron and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Michael A. Henning and
Debra J. Knisley},
title = {Total irredundance in graphs},
journal = {Discret. Math.},
volume = {256},
number = {1-2},
pages = {115--127},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(00)00459-3},
doi = {10.1016/S0012-365X(00)00459-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FavaronHHHK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HaynesHHH02,
author = {Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Michael A. Henning},
title = {Domination in Graphs Applied to Electric Power Networks},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {4},
pages = {519--529},
year = {2002},
url = {https://doi.org/10.1137/S0895480100375831},
doi = {10.1137/S0895480100375831},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HaynesHHH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/HedetniemiJS02,
author = {Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear
Time},
booktitle = {16th International Parallel and Distributed Processing Symposium {(IPDPS}
2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts
Proceedings},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/IPDPS.2002.1016537},
doi = {10.1109/IPDPS.2002.1016537},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/HedetniemiJS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HaynesHHK01,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
Michael A. Henning and
Debra J. Knisley},
title = {Stable and unstable graphs with total irredundance number zero},
journal = {Ars Comb.},
volume = {61},
year = {2001},
timestamp = {Fri, 12 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/HaynesHHK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HaynesHHJKM01,
author = {Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
David Pokrass Jacobs and
James A. Knisely and
Lucas C. van der Merwe},
title = {Domination Subdivision Numbers},
journal = {Discuss. Math. Graph Theory},
volume = {21},
number = {2},
pages = {239--253},
year = {2001},
url = {https://doi.org/10.7151/dmgt.1147},
doi = {10.7151/DMGT.1147},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HaynesHHJKM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HedetniemiJS01,
author = {Stephen T. Hedetniemi and
David Pokrass Jacobs and
Pradip K. Srimani},
title = {Maximal matching stabilizes in time O(m)},
journal = {Inf. Process. Lett.},
volume = {80},
number = {5},
pages = {221--223},
year = {2001},
url = {https://doi.org/10.1016/S0020-0190(01)00171-5},
doi = {10.1016/S0020-0190(01)00171-5},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HedetniemiJS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/AbdelbarHH00,
author = {Ashraf M. Abdelbar and
Stephen T. Hedetniemi and
Sandra Mitchell Hedetniemi},
title = {The complexity of approximating MAPs for belief networks with bounded
probabilities},
journal = {Artif. Intell.},
volume = {124},
number = {2},
pages = {283--288},
year = {2000},
url = {https://doi.org/10.1016/S0004-3702(00)00076-X},
doi = {10.1016/S0004-3702(00)00076-X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/AbdelbarHH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChestonHLS00,
author = {Grant A. Cheston and
Stephen T. Hedetniemi and
Arthur L. Liestman and
J. B. Stehman},
title = {The even adjacency split problem for graphs},
journal = {Discret. Appl. Math.},
volume = {102},
number = {3},
pages = {175--188},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00183-3},
doi = {10.1016/S0166-218X(99)00183-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChestonHLS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/XuCHHS00,
author = {Baogen Xu and
Ernest J. Cockayne and
Teresa W. Haynes and
Stephen T. Hedetniemi and
Zhou Shangchao},
title = {Extremal graphs for inequalities involving domination parameters},
journal = {Discret. Math.},
volume = {216},
number = {1-3},
pages = {1--10},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00251-4},
doi = {10.1016/S0012-365X(99)00251-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/XuCHHS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HedetniemiHR00,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Douglas F. Rall},
title = {Acyclic domination},
journal = {Discret. Math.},
volume = {222},
number = {1-3},
pages = {151--165},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(00)00012-1},
doi = {10.1016/S0012-365X(00)00012-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HedetniemiHR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/HaynesHH00,
author = {Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi},
title = {Domination and independence subdivision numbers of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {20},
number = {2},
pages = {271--280},
year = {2000},
url = {https://doi.org/10.7151/dmgt.1126},
doi = {10.7151/DMGT.1126},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/HaynesHH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DunbarHHM99,
author = {Jean E. Dunbar and
Stephen T. Hedetniemi and
Michael A. Henning and
Alice A. McRae},
title = {Minus domination in graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {35--47},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00284-2},
doi = {10.1016/S0012-365X(98)00284-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DunbarHHM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FrickeHHHH99,
author = {Gerd Fricke and
Teresa W. Haynes and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Michael A. Henning},
title = {On perfect neighborhood sets in graphs},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {221--225},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00306-9},
doi = {10.1016/S0012-365X(98)00306-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FrickeHHHH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DomkeHHLM99,
author = {Gayla S. Domke and
Johannes H. Hattingh and
Stephen T. Hedetniemi and
Renu C. Laskar and
Lisa R. Markus},
title = {Restrained domination in graphs},
journal = {Discret. Math.},
volume = {203},
number = {1-3},
pages = {61--69},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)00016-3},
doi = {10.1016/S0012-365X(99)00016-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DomkeHHLM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0093827,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
Peter J. Slater},
title = {Fundamentals of domination in graphs},
series = {Pure and applied mathematics},
volume = {208},
publisher = {Dekker},
year = {1998},
isbn = {978-0-8247-0033-1},
timestamp = {Mon, 22 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0093827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/FrickeHJ98,
author = {Gerd Fricke and
Stephen T. Hedetniemi and
David Pokrass Jacobs},
title = {Independence and Irredundance in k-Regular Graphs},
journal = {Ars Comb.},
volume = {49},
year = {1998},
timestamp = {Fri, 09 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/FrickeHJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneHHM98,
author = {Ernest J. Cockayne and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Christina M. Mynhardt},
title = {Irredundant and perfect neighbourhood sets in trees},
journal = {Discret. Math.},
volume = {188},
number = {1-3},
pages = {253--260},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(98)00029-6},
doi = {10.1016/S0012-365X(98)00029-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/CockayneHHM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/YanCHH97,
author = {Jing{-}Ho Yan and
Gerard J. Chang and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi},
title = {k-Path Partitions in Trees},
journal = {Discret. Appl. Math.},
volume = {78},
number = {1-3},
pages = {227--233},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)00012-7},
doi = {10.1016/S0166-218X(97)00012-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/YanCHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DunbarGHHM97,
author = {Jean E. Dunbar and
Jerrold W. Grossman and
Johannes H. Hattingh and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {On weakly connected domination in graphs},
journal = {Discret. Math.},
volume = {167-168},
pages = {261--269},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00233-6},
doi = {10.1016/S0012-365X(96)00233-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DunbarGHHM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneHHHM97,
author = {Ernest J. Cockayne and
Johannes H. Hattingh and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae},
title = {Using maximality and minimality conditions to construct inequality
chains},
journal = {Discret. Math.},
volume = {176},
number = {1-3},
pages = {43--61},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00356-1},
doi = {10.1016/S0012-365X(96)00356-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CockayneHHHM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/GeistCHT96,
author = {Robert Geist and
Madhu Chetuparambil and
Stephen T. Hedetniemi and
A. Joe Turner},
title = {Computing Research Programs in the {US}},
journal = {Commun. {ACM}},
volume = {39},
number = {12},
pages = {96--99},
year = {1996},
url = {https://doi.org/10.1145/240483.240505},
doi = {10.1145/240483.240505},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/GeistCHT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DunbarGHMH96,
author = {Jean E. Dunbar and
Wayne Goddard and
Stephen T. Hedetniemi and
Alice A. McRae and
Michael A. Henning},
title = {The Algorithmic Complexity of Minus Domination in Graphs},
journal = {Discret. Appl. Math.},
volume = {68},
number = {1-2},
pages = {73--84},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00056-W},
doi = {10.1016/0166-218X(95)00056-W},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DunbarGHMH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FrickeHJ96,
author = {Gerd Fricke and
Stephen T. Hedetniemi and
David Pokrass Jacobs},
title = {Maximal Irredundant Functions},
journal = {Discret. Appl. Math.},
volume = {68},
number = {3},
pages = {267--277},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00071-X},
doi = {10.1016/0166-218X(95)00071-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FrickeHJ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DunbarHHM96,
author = {Jean E. Dunbar and
Stephen T. Hedetniemi and
Michael A. Henning and
Alice A. McRae},
title = {Minus domination in regular graphs},
journal = {Discret. Math.},
volume = {149},
number = {1-3},
pages = {311--312},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(94)00329-H},
doi = {10.1016/0012-365X(94)00329-H},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DunbarHHM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/CockayneFHM95,
author = {Ernest J. Cockayne and
Gerd Fricke and
Stephen T. Hedetniemi and
Christina M. Mynhardt},
title = {Properties of minimal dominating functions of graphs},
journal = {Ars Comb.},
volume = {41},
year = {1995},
timestamp = {Fri, 31 Oct 2014 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/CockayneFHM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/FrickeHH95,
author = {Gerd Fricke and
Stephen T. Hedetniemi and
Michael A. Henning},
title = {Distance independence domination in graphs},
journal = {Ars Comb.},
volume = {41},
year = {1995},
timestamp = {Fri, 31 Oct 2014 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/FrickeHH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DunbarHHHML95,
author = {Jean E. Dunbar and
Frederick C. Harris Jr. and
Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Alice A. McRae and
Renu C. Laskar},
title = {Nearly perfect sets in graphs},
journal = {Discret. Math.},
volume = {138},
number = {1-3},
pages = {229--246},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(94)00205-W},
doi = {10.1016/0012-365X(94)00205-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DunbarHHHML95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/LabahnHL94,
author = {Roger Labahn and
Stephen T. Hedetniemi and
Renu C. Laskar},
title = {Periodic gossiping on trees},
journal = {Discret. Appl. Math.},
volume = {53},
number = {1-3},
pages = {235--245},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90187-2},
doi = {10.1016/0166-218X(94)90187-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LabahnHL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FellowsFHJ94,
author = {Michael R. Fellows and
Gerd Fricke and
Stephen T. Hedetniemi and
David Pokrass Jacobs},
title = {The Private Neighbor Cube},
journal = {{SIAM} J. Discret. Math.},
volume = {7},
number = {1},
pages = {41--47},
year = {1994},
url = {https://doi.org/10.1137/S0895480191199026},
doi = {10.1137/S0895480191199026},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/FellowsFHJ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BernhardHJ93,
author = {Philip J. Bernhard and
Stephen T. Hedetniemi and
David Pokrass Jacobs},
title = {Efficient Sets in Graphs},
journal = {Discret. Appl. Math.},
volume = {44},
number = {1-3},
pages = {99--108},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90225-D},
doi = {10.1016/0166-218X(93)90225-D},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BernhardHJ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChestonFHJ90,
author = {Grant A. Cheston and
Gerd Fricke and
Stephen T. Hedetniemi and
David Pokrass Jacobs},
title = {On the computational complexity of upper fractional domination},
journal = {Discret. Appl. Math.},
volume = {27},
number = {3},
pages = {195--207},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90065-K},
doi = {10.1016/0166-218X(90)90065-K},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChestonFHJ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HedetniemiL90,
author = {Stephen T. Hedetniemi and
Renu C. Laskar},
title = {Introduction},
journal = {Discret. Math.},
volume = {86},
number = {1-3},
pages = {3--9},
year = {1990},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HedetniemiL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HedetniemiL90a,
author = {Stephen T. Hedetniemi and
Renu C. Laskar},
title = {Bibliography on domination in graphs and some basic definitions of
domination parameters},
journal = {Discret. Math.},
volume = {86},
number = {1-3},
pages = {257--277},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90365-O},
doi = {10.1016/0012-365X(90)90365-O},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HedetniemiL90a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AlbertsonJHL89,
author = {Michael O. Albertson and
Robert E. Jamison and
Stephen T. Hedetniemi and
Stephen C. Locke},
title = {The subchromatic number of a graph},
journal = {Discret. Math.},
volume = {74},
number = {1-2},
pages = {33--49},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90196-9},
doi = {10.1016/0012-365X(89)90196-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AlbertsonJHL89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChestonFHP89,
author = {Grant A. Cheston and
Arthur M. Farley and
Stephen T. Hedetniemi and
Andrzej Proskurowski},
title = {Centering a Spanning Tree of a Biconnected Graph},
journal = {Inf. Process. Lett.},
volume = {32},
number = {5},
pages = {247--250},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90051-3},
doi = {10.1016/0020-0190(89)90051-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChestonFHP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneHL88,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi and
Renu C. Laskar},
title = {Gallai theorems for graphs, hypergraphs, and set systems},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {35--47},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90192-6},
doi = {10.1016/0012-365X(88)90192-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CockayneHL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HedetniemiHL88,
author = {Sandra Mitchell Hedetniemi and
Stephen T. Hedetniemi and
Arthur L. Liestman},
title = {A survey of gossiping and broadcasting in communication networks},
journal = {Networks},
volume = {18},
number = {4},
pages = {319--349},
year = {1988},
url = {https://doi.org/10.1002/net.3230180406},
doi = {10.1002/NET.3230180406},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HedetniemiHL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ErdosHHL87,
author = {Paul Erd{\"{o}}s and
W. R. Hare and
Stephen T. Hedetniemi and
Renu C. Laskar},
title = {On the equality of the grundy and ochromatic numbers of a graph},
journal = {J. Graph Theory},
volume = {11},
number = {2},
pages = {157--159},
year = {1987},
url = {https://doi.org/10.1002/jgt.3190110205},
doi = {10.1002/JGT.3190110205},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ErdosHHL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HedetniemiLP86,
author = {Stephen T. Hedetniemi and
Renu C. Laskar and
John Pfaff},
title = {A linear algorithm for finding a minimum dominating set in a cactus},
journal = {Discret. Appl. Math.},
volume = {13},
number = {2-3},
pages = {287--292},
year = {1986},
url = {https://doi.org/10.1016/0166-218X(86)90089-2},
doi = {10.1016/0166-218X(86)90089-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HedetniemiLP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CockayneH86,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi},
title = {On the diagonal queens domination problem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {42},
number = {1},
pages = {137--139},
year = {1986},
url = {https://doi.org/10.1016/0097-3165(86)90012-9},
doi = {10.1016/0097-3165(86)90012-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/CockayneH86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AllanLH84,
author = {Robert B. Allan and
Renu C. Laskar and
Stephen T. Hedetniemi},
title = {A note on total domination},
journal = {Discret. Math.},
volume = {49},
number = {1},
pages = {7--13},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90145-6},
doi = {10.1016/0012-365X(84)90145-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AllanLH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijpp/ParleyHP81,
author = {Arthur M. Farley and
Stephen T. Hedetniemi and
Andrzej Proskurowski},
title = {Partitioning trees: Matching, domination, and maximum diameter},
journal = {Int. J. Parallel Program.},
volume = {10},
number = {1},
pages = {55--61},
year = {1981},
url = {https://doi.org/10.1007/BF00978378},
doi = {10.1007/BF00978378},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijpp/ParleyHP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SlaterCH81,
author = {Peter J. Slater and
Ernest J. Cockayne and
Stephen T. Hedetniemi},
title = {Information Dissemination in Trees},
journal = {{SIAM} J. Comput.},
volume = {10},
number = {4},
pages = {692--701},
year = {1981},
url = {https://doi.org/10.1137/0210052},
doi = {10.1137/0210052},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SlaterCH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CockayneDH80,
author = {Ernest J. Cockayne and
R. M. Dawes and
Stephen T. Hedetniemi},
title = {Total domination in graphs},
journal = {Networks},
volume = {10},
number = {3},
pages = {211--219},
year = {1980},
url = {https://doi.org/10.1002/net.3230100304},
doi = {10.1002/NET.3230100304},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CockayneDH80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/FarleyHM80,
author = {Arthur M. Farley and
Stephen T. Hedetniemi and
Sandra L. Mitchell},
title = {Rectilinear Steiner Trees in Rectangle Trees},
journal = {{SIAM} J. Algebraic Discret. Methods},
volume = {1},
number = {1},
pages = {70--81},
year = {1980},
url = {https://doi.org/10.1137/0601010},
doi = {10.1137/0601010},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/FarleyHM80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FarleyHMP79,
author = {Arthur M. Farley and
Stephen T. Hedetniemi and
Sandra Mitchell Mitchell and
Andrzej Proskurowski},
title = {Minimum broadcast graphs},
journal = {Discret. Math.},
volume = {25},
number = {2},
pages = {189--193},
year = {1979},
url = {https://doi.org/10.1016/0012-365X(79)90022-0},
doi = {10.1016/0012-365X(79)90022-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FarleyHMP79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MitchellH79,
author = {Sandra L. Mitchell and
Stephen T. Hedetniemi},
title = {Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs},
journal = {Inf. Process. Lett.},
volume = {9},
number = {3},
pages = {110--112},
year = {1979},
url = {https://doi.org/10.1016/0020-0190(79)90049-8},
doi = {10.1016/0020-0190(79)90049-8},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MitchellH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/MitchellCH79,
author = {Sandra L. Mitchell and
Ernest J. Cockayne and
Stephen T. Hedetniemi},
title = {Linear Algorithms on Recursive Representations of Trees},
journal = {J. Comput. Syst. Sci.},
volume = {18},
number = {1},
pages = {76--85},
year = {1979},
url = {https://doi.org/10.1016/0022-0000(79)90053-9},
doi = {10.1016/0022-0000(79)90053-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/MitchellCH79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CockayneHS79,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi and
Peter J. Slater},
title = {Matchings and transversals in hypergraphs, domination and independence-in
trees},
journal = {J. Comb. Theory, Ser. {B}},
volume = {26},
number = {1},
pages = {78--80},
year = {1979},
url = {https://doi.org/10.1016/0095-8956(79)90044-3},
doi = {10.1016/0095-8956(79)90044-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/CockayneHS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneHH78,
author = {Ernest J. Cockayne and
Bert L. Hartnell and
Stephen T. Hedetniemi},
title = {A linear algorithm for disjoint matchings in trees},
journal = {Discret. Math.},
volume = {21},
number = {2},
pages = {129--136},
year = {1978},
url = {https://doi.org/10.1016/0012-365X(78)90085-7},
doi = {10.1016/0012-365X(78)90085-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CockayneHH78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CockayneH78,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi},
title = {Disjoint cliques in regular graphs of degree seven and eight},
journal = {J. Comb. Theory, Ser. {B}},
volume = {24},
number = {2},
pages = {233--237},
year = {1978},
url = {https://doi.org/10.1016/0095-8956(78)90025-4},
doi = {10.1016/0095-8956(78)90025-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/CockayneH78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HedetniemiS77,
author = {Stephen T. Hedetniemi and
Diane M. Spresser},
title = {A property of trees in terms of unique connected subgraphs},
journal = {J. Graph Theory},
volume = {1},
number = {4},
pages = {335--337},
year = {1977},
url = {https://doi.org/10.1002/jgt.3190010409},
doi = {10.1002/JGT.3190010409},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HedetniemiS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/CockayneH77,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi},
title = {Towards a theory of domination in graphs},
journal = {Networks},
volume = {7},
number = {3},
pages = {247--261},
year = {1977},
url = {https://doi.org/10.1002/net.3230070305},
doi = {10.1002/NET.3230070305},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/CockayneH77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneH76,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi},
title = {Disjoint independent dominating sets in graphs},
journal = {Discret. Math.},
volume = {15},
number = {3},
pages = {213--222},
year = {1976},
url = {https://doi.org/10.1016/0012-365X(76)90026-1},
doi = {10.1016/0012-365X(76)90026-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CockayneH76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SlaterGH76,
author = {Peter J. Slater and
Seymour E. Goodman and
Stephen T. Hedetniemi},
title = {On the optional hamiltonian completion problem},
journal = {Networks},
volume = {6},
number = {1},
pages = {35--51},
year = {1976},
url = {https://doi.org/10.1002/net.3230060104},
doi = {10.1002/NET.3230060104},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/SlaterGH76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoodmanHT76,
author = {Seymour E. Goodman and
Stephen T. Hedetniemi and
Robert Endre Tarjan},
title = {b-Matchings in Trees},
journal = {{SIAM} J. Comput.},
volume = {5},
number = {1},
pages = {104--108},
year = {1976},
url = {https://doi.org/10.1137/0205009},
doi = {10.1137/0205009},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoodmanHT76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/CockayneGH75,
author = {Ernest J. Cockayne and
Seymour E. Goodman and
Stephen T. Hedetniemi},
title = {A Linear Algorithm for the Domination Number of a Tree},
journal = {Inf. Process. Lett.},
volume = {4},
number = {2},
pages = {41--44},
year = {1975},
url = {https://doi.org/10.1016/0020-0190(75)90011-3},
doi = {10.1016/0020-0190(75)90011-3},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/CockayneGH75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoodmanHS75,
author = {Seymour E. Goodman and
Stephen T. Hedetniemi and
Peter J. Slater},
title = {Advances on the Hamiltonian Completion Problem},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {352--360},
year = {1975},
url = {https://doi.org/10.1145/321892.321897},
doi = {10.1145/321892.321897},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoodmanHS75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoodmanH74,
author = {Seymour E. Goodman and
Stephen T. Hedetniemi},
title = {On Hamiltonian Walks in Graphs},
journal = {{SIAM} J. Comput.},
volume = {3},
number = {3},
pages = {214--221},
year = {1974},
url = {https://doi.org/10.1137/0203017},
doi = {10.1137/0203017},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoodmanH74.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoodmanH73,
author = {Seymour E. Goodman and
Stephen T. Hedetniemi},
title = {Eulerian Walks in Graphs},
journal = {{SIAM} J. Comput.},
volume = {2},
number = {1},
pages = {16--27},
year = {1973},
url = {https://doi.org/10.1137/0202003},
doi = {10.1137/0202003},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoodmanH73.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FleckHO72,
author = {Arthur C. Fleck and
Stephen T. Hedetniemi and
Robert H. Oehmke},
title = {S-Semigroups of Automata},
journal = {J. {ACM}},
volume = {19},
number = {1},
pages = {3--10},
year = {1972},
url = {https://doi.org/10.1145/321679.321681},
doi = {10.1145/321679.321681},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FleckHO72.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/Hedetniemi70,
author = {Stephen T. Hedetniemi},
title = {{R70-36} Maximin Automata},
journal = {{IEEE} Trans. Computers},
volume = {19},
number = {9},
pages = {859},
year = {1970},
url = {https://doi.org/10.1109/T-C.1970.223064},
doi = {10.1109/T-C.1970.223064},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/Hedetniemi70.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/afips/LevinH63,
author = {Bernard M. Levin and
Stephen T. Hedetniemi},
editor = {E. Calvin Johnson},
title = {Determining fastest routes using fixed schedules},
booktitle = {Proceedings of the 1963 spring joint computer conference, {AFIPS}
1963 (Spring), Detroit, Michigan, USA, May 21-23, 1963},
pages = {1--8},
publisher = {{ACM}},
year = {1963},
url = {https://doi.org/10.1145/1461551.1461553},
doi = {10.1145/1461551.1461553},
timestamp = {Wed, 21 Apr 2021 15:34:42 +0200},
biburl = {https://dblp.org/rec/conf/afips/LevinH63.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-09-27 22:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
