The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stephen T. Hedetniemi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. [Citation Graph (0, 0)][DBLP]
    HiPC, 2003, pp:66-73 [Conf]
  2. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2003, pp:461-465 [Conf]
  3. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:162- [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:240- [Conf]
  5. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Fault Tolerant Algorithms for Orderings and Colorings. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  6. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  7. Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani
    A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. [Citation Graph (0, 0)][DBLP]
    IWDC, 2003, pp:26-32 [Conf]
  8. Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi
    An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2006, pp:797-803 [Conf]
  9. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
    Distance-k Information in Self-stabilizing Algorithms. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:349-356 [Conf]
  10. Martin Gairing, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
    Self-Stabilizing Algorithms for {k}-Domination. [Citation Graph (0, 0)][DBLP]
    Self-Stabilizing Systems, 2003, pp:49-60 [Conf]
  11. Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi
    The complexity of approximating MAPs for belief networks with bounded probabilities. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:124, n:2, pp:283-288 [Journal]
  12. Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
    Independence and Irredundance in k-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:49, n:, pp:- [Journal]
  13. Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
    Stable and unstable graphs with total irredundance number zero. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:61, n:, pp:- [Journal]
  14. Robert Geist, Madhu Chetuparambil, Stephen T. Hedetniemi, A. Joe Turner
    Computing Research Programs in the US. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1996, v:39, n:12, pp:96-99 [Journal]
  15. Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning
    Global Defensive Alliances in Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  16. Philip J. Bernhard, Stephen T. Hedetniemi, David Pokrass Jacobs
    Efficient Sets in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:99-108 [Journal]
  17. Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman
    The even adjacency split problem for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:175-188 [Journal]
  18. Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
    Broadcasts in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:1, pp:59-75 [Journal]
  19. Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning
    The Algorithmic Complexity of Minus Domination in Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:1-2, pp:73-84 [Journal]
  20. Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
    Maximal Irredundant Functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:68, n:3, pp:267-277 [Journal]
  21. Roger Labahn, Stephen T. Hedetniemi, Renu Laskar
    Periodic gossiping on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:235-245 [Journal]
  22. Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
    k-Path Partitions in Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:227-233 [Journal]
  23. Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi
    Roman domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:11-22 [Journal]
  24. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:1, pp:53-64 [Journal]
  25. Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
    Total irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:115-127 [Journal]
  26. Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
    On k-dependent domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:83-94 [Journal]
  27. Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar
    Generalized subgraph-restricted matchings in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:293, n:1-3, pp:129-138 [Journal]
  28. Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater
    H-forming sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:262, n:1-3, pp:159-169 [Journal]
  29. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle
    Iterated colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:278, n:1-3, pp:81-108 [Journal]
  30. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall
    Acyclic domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:151-165 [Journal]
  31. Michael A. Henning, Stephen T. Hedetniemi
    Defending the Roman Empire--A new strategy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:239-251 [Journal]
  32. Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae
    An algorithm for partial Grundy number on trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:108-116 [Journal]
  33. Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao
    Extremal graphs for inequalities involving domination parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:1-10 [Journal]
  34. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Self-Stabilizing Algorithms For Orderings And Colorings. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:1, pp:19-36 [Journal]
  35. Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski
    Centering a Spanning Tree of a Biconnected Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:5, pp:247-250 [Journal]
  36. Ernest J. Cockayne, S. E. Goodman, Stephen T. Hedetniemi
    A Linear Algorithm for the Domination Number of a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1975, v:4, n:2, pp:41-44 [Journal]
  37. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Maximal matching stabilizes in time O(m). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:5, pp:221-223 [Journal]
  38. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Linear time self-stabilizing colorings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:5, pp:251-255 [Journal]
  39. Sandra L. Mitchell, Stephen T. Hedetniemi
    Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:3, pp:110-112 [Journal]
  40. Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi
    An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:2, pp:77-83 [Journal]
  41. Arthur C. Fleck, Stephen T. Hedetniemi, Robert H. Oehmke
    S-Semigroups of Automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:1, pp:3-10 [Journal]
  42. S. E. Goodman, Stephen T. Hedetniemi, Peter J. Slater
    Advances on the Hamiltonian Completion Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:3, pp:352-360 [Journal]
  43. Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi
    Linear Algorithms on Recursive Representations of Trees. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:1, pp:76-85 [Journal]
  44. Ernest J. Cockayne, Stephen T. Hedetniemi
    On the diagonal queens domination problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:1, pp:137-139 [Journal]
  45. Ernest J. Cockayne, Stephen T. Hedetniemi, Peter J. Slater
    Matchings and transversals in hypergraphs, domination and independence-in trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1979, v:26, n:1, pp:78-80 [Journal]
  46. Ernest J. Cockayne, Stephen T. Hedetniemi
    Disjoint cliques in regular graphs of degree seven and eight. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1978, v:24, n:2, pp:233-237 [Journal]
  47. Martin Gairing, Robert Geist, Stephen T. Hedetniemi, Petter Kristiansen
    A Self-stabilizing Algorithm for Maximal 2-packing. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2004, v:11, n:1, pp:1-11 [Journal]
  48. Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
    Self-Stabilizing Maximal K-Dependent Sets In Linear Time. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:1, pp:75-82 [Journal]
  49. Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
    Distance-two information in self-stabilizing algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:3-4, pp:387-398 [Journal]
  50. S. E. Goodman, Stephen T. Hedetniemi
    Eulerian Walks in Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:1, pp:16-27 [Journal]
  51. S. E. Goodman, Stephen T. Hedetniemi
    On Hamiltonian Walks in Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:3, pp:214-221 [Journal]
  52. S. E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan
    b-Matchings in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:1, pp:104-108 [Journal]
  53. Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi
    Information Dissemination in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:692-701 [Journal]
  54. Michael R. Fellows, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
    The Private Neighbor Cube. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:41-47 [Journal]
  55. Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
    Domination in Graphs Applied to Electric Power Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:4, pp:519-529 [Journal]
  56. Robert C. Brigham, Ronald D. Dutton, Stephen T. Hedetniemi
    Security in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:13, pp:1708-1714 [Journal]
  57. Robert B. Allan, Renu Laskar, Stephen T. Hedetniemi
    A note on total domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:1, pp:7-13 [Journal]
  58. Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar
    Gallai theorems for graphs, hypergraphs, and set systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:35-47 [Journal]
  59. Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke
    The subchromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:33-49 [Journal]
  60. Gayla S. Domke, Johannes H. Hattingh, Stephen T. Hedetniemi, Renu C. Laskar, Lisa R. Markus
    Restrained domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:61-69 [Journal]
  61. Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
    On perfect neighborhood sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:221-225 [Journal]
  62. Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
    Minus domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:35-47 [Journal]
  63. Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
    Irredundant and perfect neighbourhood sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:253-260 [Journal]
  64. Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae
    Using maximality and minimality conditions to construct inequality chains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:43-61 [Journal]
  65. Jean E. Dunbar, Jerrold W. Grossman, Johannes H. Hattingh, Stephen T. Hedetniemi, Alice A. McRae
    On weakly connected domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:261-269 [Journal]
  66. Stephen T. Hedetniemi, Renu C. Laskar
    Bibliography on domination in graphs and some basic definitions of domination parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:257-277 [Journal]
  67. Stephen T. Hedetniemi, Renu C. Laskar
    Introduction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:86, n:1-3, pp:3-9 [Journal]
  68. Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
    Minus domination in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:149, n:1-3, pp:311-312 [Journal]
  69. Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar
    Nearly perfect sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:229-246 [Journal]

  70. Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. [Citation Graph (, )][DBLP]


  71. Braodcast Chromatic Numbers of Graphs. [Citation Graph (, )][DBLP]


  72. On the computational complexity of upper fractional domination. [Citation Graph (, )][DBLP]


  73. On domination and reinforcement numbers in trees. [Citation Graph (, )][DBLP]


  74. Powerful alliances in graphs. [Citation Graph (, )][DBLP]


Search in 0.114secs, Finished in 0.117secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002