The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wayne Goddard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:351-356 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  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. Lenore Cowen, Wayne Goddard, C. E. Jesurum
    Coloring with Defect. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:548-557 [Conf]
  11. Wayne Goddard, Valerie King, Leonard J. Schulman
    Optimal Randomized Algorithms for Local Sorting and Set-Maxima [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:45-53 [Conf]
  12. Lowell W. Beineke, Wayne Goddard, Marc J. Lipman
    Graphs with Maximum Edge-Integrity. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:46, n:, pp:- [Journal]
  13. David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart
    Multipartite Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  14. Michael Dorfling, Wayne Goddard, Michael A. Henning
    Domination in Planar Graphs with Small Diameter II. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2006, v:78, n:, pp:- [Journal]
  15. Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
    Bounds on the Total Redundance and Efficiency of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:54, n:, pp:- [Journal]
  16. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:127-134 [Journal]
  17. Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert
    A Survey of Integrity. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:13-28 [Journal]
  18. Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
    MAD trees and distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:151-167 [Journal]
  19. Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
    Augmenting trees so that every three vertices lie on a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:145-159 [Journal]
  20. 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]
  21. Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
    Changing upper irredundance by edge addition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:185-193 [Journal]
  22. Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart
    Maximum sizes of graphs with given domination parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:137-148 [Journal]
  23. Michael A. Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning
    Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:82-90 [Journal]
  24. Wayne Goddard
    4-connected maximal planar graphs are 4-ordered. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:405-410 [Journal]
  25. Wayne Goddard, Michael A. Henning
    Pancyclicity of the prism. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:139-142 [Journal]
  26. Wayne Goddard, Michael A. Henning
    Nordhaus-Gaddum bounds for independent domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:299-302 [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. Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe
    The diameter of total domination vertex critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:255-261 [Journal]
  29. Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
    Bipartite Ramsey numbers and Zarankiewicz numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:219, n:1-3, pp:85-95 [Journal]
  30. Wayne Goddard, Michael Edwin Raines, Peter J. Slater
    Distance and connectivity measures in permutation graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:61-70 [Journal]
  31. 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]
  32. Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar
    Simultaneous graph parameters: Factor domination and factor total domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:18, pp:2229-2233 [Journal]
  33. Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt
    Construction of trees and graphs with equal domination parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:21, pp:2647-2654 [Journal]
  34. Wayne Goddard, Meir Katchalski, Daniel J. Kleitman
    Forcing Disjoint Segments in the Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:4, pp:391-395 [Journal]
  35. Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart
    Principal Common Divisors of Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:2, pp:85-93 [Journal]
  36. Wayne Goddard
    Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:467-483 [Journal]
  37. 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]
  38. 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]
  39. Binghuan Zhu, Wayne Goddard
    An Algorithm for Outerplanar Graphs with Parameter. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:657-662 [Journal]
  40. Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen
    Counting Pairs of Lattice Paths by Intersections. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:74, n:2, pp:173-187 [Journal]
  41. Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian
    On multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:52, n:2, pp:284-300 [Journal]
  42. Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
    Generalized eccentricity, radius, and diameter in graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:312-319 [Journal]
  43. 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]
  44. 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]
  45. Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman
    Optimal Randomized Algorithms for Local Sorting and Set-Maxima. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:272-283 [Journal]
  46. Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman
    Even Cycles in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:474-483 [Journal]
  47. Wayne Goddard, Michael A. Henning
    Multiple vertex coverings by cliques. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:157-167 [Journal]
  48. Wayne Goddard, Michael A. Henning
    Real and integer domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:61-75 [Journal]
  49. Wayne Goddard, Henda C. Swart
    Distances between graphs under edge operations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:121-132 [Journal]
  50. Wayne Goddard, Michael D. Plummer, Henda C. Swart
    Maximum and minimum toughness of graphs of small genus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:329-339 [Journal]
  51. Wayne Goddard
    Acyclic colorings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:1, pp:91-94 [Journal]
  52. Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart
    Steiner distance stable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:132, n:1-3, pp:65-73 [Journal]
  53. Wayne Goddard
    Mistilings with dominoes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:361-365 [Journal]
  54. Lowell W. Beineke, Peter Hamburger, Wayne Goddard
    Random packings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:45-54 [Journal]
  55. Wayne Goddard, Daniel J. Kleitman
    An upper bound for the Ramsey numbers r(K3, G). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:177-182 [Journal]
  56. Wayne Goddard, Michael A. Henning
    Restricted domination parameters in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:4, pp:353-363 [Journal]

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


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


  59. The binding number of a graph and its cliques. [Citation Graph (, )][DBLP]


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


Search in 0.005secs, Finished in 0.008secs
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