| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson |
γ-graphs of graphs.  |
Discussiones Mathematicae Graph Theory  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae |
Matchability and k-maximal matchings. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi |
Powerful alliances in graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi |
A note on trees, tables, and algorithms. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | John Dabney, Brian C. Dean, Stephen T. Hedetniemi |
A linear-time algorithm for broadcast domination in a tree. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan |
Distance- k knowledge in self-stabilizing algorithms. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki |
On domination and reinforcement numbers in trees. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu |
Self-Stabilizing Graph Protocols. |
Parallel Processing Letters |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall |
Braodcast Chromatic Numbers of Graphs. |
Ars Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. |
ICDCN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi |
Security in graphs. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi |
Broadcasts in graphs. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi |
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. |
PDPTA |
2006 |
DBLP BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan |
Distance-k Information in Self-stabilizing Algorithms. |
SIROCCO |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Self-Stabilizing Algorithms For Orderings And Colorings. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar |
Generalized subgraph-restricted matchings in graphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae |
An algorithm for partial Grundy number on trees. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. |
IJDSN |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi |
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle |
Iterated colorings of graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi |
Roman domination in graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae |
Distance-two information in self-stabilizing algorithms. |
Parallel Processing Letters |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs |
Self-Stabilizing Maximal K-Dependent Sets In Linear Time. |
Parallel Processing Letters |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen |
A Self-stabilizing Algorithm for Maximal 2-packing. |
Nord. J. Comput. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Fault Tolerant Algorithms for Orderings and Colorings. |
IPDPS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Linear time self-stabilizing colorings. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater |
H-forming sets in graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Henning, Stephen T. Hedetniemi |
Defending the Roman Empire--A new strategy. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Erdös, Stephen T. Hedetniemi, Renu Laskar, Geert C. E. Prins |
On the equality of the partial Grundy and upper ochromatic numbers of graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning |
Global Defensive Alliances in Graphs. |
Electr. J. Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. |
HiPC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani |
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. |
IWDC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. |
ICDCS Workshops |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. |
IPDPS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. |
IPDPS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae |
Self-Stabilizing Algorithms for {k}-Domination. |
Self-Stabilizing Systems |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall |
On k-dependent domination. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley |
Total irredundance in graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning |
Domination in Graphs Applied to Electric Power Networks. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. (PDF / PS) |
IPDPS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani |
Maximal matching stabilizes in time O(m). |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley |
Stable and unstable graphs with total irredundance number zero. |
Ars Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall |
Acyclic domination. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao |
Extremal graphs for inequalities involving domination parameters. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi |
The complexity of approximating MAPs for belief networks with bounded probabilities. |
Artif. Intell. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman |
The even adjacency split problem for graphs. |
Discrete Applied Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae |
Minus domination in graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning |
On perfect neighborhood sets in graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus |
Restrained domination in graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt |
Irredundant and perfect neighbourhood sets in trees. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs |
Independence and Irredundance in k-Regular Graphs. |
Ars Comb. |
1998 |
DBLP BibTeX RDF |
|
| 1 | Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae |
On weakly connected domination in graphs. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae |
Using maximality and minimality conditions to construct inequality chains. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi |
k-Path Partitions in Trees. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae |
Minus domination in regular graphs. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Geist, Madhu Chetuparambil, Stephen T. Hedetniemi, A. Joe Turner |
Computing Research Programs in the US. |
Commun. ACM |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs |
Maximal Irredundant Functions. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning |
The Algorithmic Complexity of Minus Domination in Graphs. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar |
Nearly perfect sets in graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs |
The Private Neighbor Cube. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Roger Labahn, Stephen T. Hedetniemi, Renu Laskar |
Periodic gossiping on trees. |
Discrete Applied Mathematics |
1994 |
DBLP BibTeX RDF |
|
| 1 | Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs |
Efficient Sets in Graphs. |
Discrete Applied Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen T. Hedetniemi, Renu C. Laskar |
Introduction. |
Discrete Mathematics |
1990 |
DBLP BibTeX RDF |
|
| 1 | Stephen T. Hedetniemi, Renu C. Laskar |
Bibliography on domination in graphs and some basic definitions of domination parameters. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs |
On the computational complexity of upper fractional domination. |
Discrete Applied Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski |
Centering a Spanning Tree of a Biconnected Graph. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke |
The subchromatic number of a graph. |
Discrete Mathematics |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar |
Gallai theorems for graphs, hypergraphs, and set systems. |
Discrete Mathematics |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Stephen T. Hedetniemi |
On the diagonal queens domination problem. |
J. Comb. Theory, Ser. A |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert B. Allan, Renu Laskar, Stephen T. Hedetniemi |
A note on total domination. |
Discrete Mathematics |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur Parley, Stephen T. Hedetniemi, Andrzej Proskurowski |
Partitioning trees: Matching, domination, and maximum diameter. |
International Journal of Parallel Programming |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi |
Information Dissemination in Trees. |
SIAM J. Comput. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater |
Matchings and transversals in hypergraphs, domination and independence-in trees. |
J. Comb. Theory, Ser. B |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra L. Mitchell, Stephen T. Hedetniemi |
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. |
Inf. Process. Lett. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi |
Linear Algorithms on Recursive Representations of Trees. |
J. Comput. Syst. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Stephen T. Hedetniemi |
Disjoint cliques in regular graphs of degree seven and eight. |
J. Comb. Theory, Ser. B |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | S. E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan |
b-Matchings in Trees. |
SIAM J. Comput. |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, S. E. Goodman, Stephen T. Hedetniemi |
A Linear Algorithm for the Domination Number of a Tree. |
Inf. Process. Lett. |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | S. E. Goodman, Stephen T. Hedetniemi, Peter J. Slater |
Advances on the Hamiltonian Completion Problem. |
J. ACM |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | S. E. Goodman, Stephen T. Hedetniemi |
On Hamiltonian Walks in Graphs. |
SIAM J. Comput. |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | S. E. Goodman, Stephen T. Hedetniemi |
Eulerian Walks in Graphs. |
SIAM J. Comput. |
1973 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur C. Fleck, Stephen T. Hedetniemi, Robert H. Oehmke |
S-Semigroups of Automata. |
J. ACM |
1972 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")