2009 | ||
---|---|---|
64 | EE | Wayne Goddard, Stephen T. Hedetniemi: A note on trees, tables, and algorithms. Networks 53(2): 184-190 (2009) |
2008 | ||
63 | EE | 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: 182-190 |
62 | Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall: Braodcast Chromatic Numbers of Graphs. Ars Comb. 86: (2008) | |
61 | EE | Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki: On domination and reinforcement numbers in trees. Discrete Mathematics 308(7): 1165-1175 (2008) |
60 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu: Self-Stabilizing Graph Protocols. Parallel Processing Letters 18(1): 189-199 (2008) |
59 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan: Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. 399(1-2): 118-127 (2008) |
2007 | ||
58 | EE | Wayne Goddard, Michael A. Henning: Restricted domination parameters in graphs. J. Comb. Optim. 13(4): 353-363 (2007) |
2006 | ||
57 | Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi: An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA 2006: 797-803 | |
56 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan: Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356 |
55 | Michael Dorfling, Wayne Goddard, Michael A. Henning: Domination in Planar Graphs with Small Diameter II. Ars Comb. 78: (2006) | |
54 | EE | Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar: Simultaneous graph parameters: Factor domination and factor total domination. Discrete Mathematics 306(18): 2229-2233 (2006) |
53 | EE | Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt: Construction of trees and graphs with equal domination parameters. Discrete Mathematics 306(21): 2647-2654 (2006) |
2005 | ||
52 | EE | Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar: Generalized subgraph-restricted matchings in graphs. Discrete Mathematics 293(1-3): 129-138 (2005) |
51 | EE | Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning: Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Mathematics 300(1-3): 82-90 (2005) |
50 | EE | Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae: An algorithm for partial Grundy number on trees. Discrete Mathematics 304(1-3): 108-116 (2005) |
49 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. IJDSN 1(3&4): 329-344 (2005) |
48 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. 16(1): 19-36 (2005) |
47 | EE | Wayne Goddard, Michael A. Henning: Multiple vertex coverings by cliques. Journal of Graph Theory 48(2): 157-167 (2005) |
2004 | ||
46 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004 |
45 | EE | 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. Discrete Mathematics 281(1-3): 137-148 (2004) |
44 | EE | Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe: The diameter of total domination vertex critical graphs. Discrete Mathematics 286(3): 255-261 (2004) |
43 | EE | Wayne Goddard: Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. Graphs and Combinatorics 20(4): 467-483 (2004) |
42 | EE | Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi: An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Inf. Process. Lett. 91(2): 77-83 (2004) |
41 | EE | Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs: Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Processing Letters 14(1): 75-82 (2004) |
40 | EE | Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Distance-two information in self-stabilizing algorithms. Parallel Processing Letters 14(3-4): 387-398 (2004) |
2003 | ||
39 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC 2003: 66-73 |
38 | EE | 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: 461-465 |
37 | EE | 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: 162 |
36 | EE | 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: 240 |
35 | EE | Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani: A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. IWDC 2003: 26-32 |
34 | EE | Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart: MAD trees and distance-hereditary graphs. Discrete Applied Mathematics 131(1): 151-167 (2003) |
33 | EE | Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt: Changing upper irredundance by edge addition. Discrete Mathematics 266(1-3): 185-193 (2003) |
32 | EE | Wayne Goddard, Michael A. Henning: Nordhaus-Gaddum bounds for independent domination. Discrete Mathematics 268(1-3): 299-302 (2003) |
31 | EE | Wayne Goddard, Michael Edwin Raines, Peter J. Slater: Distance and connectivity measures in permutation graphs. Discrete Mathematics 271(1-3): 61-70 (2003) |
2002 | ||
30 | Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart: Augmenting trees so that every three vertices lie on a cycle. Discrete Applied Mathematics 116(1-2): 145-159 (2002) | |
29 | EE | Wayne Goddard: 4-connected maximal planar graphs are 4-ordered. Discrete Mathematics 257(2-3): 405-410 (2002) |
28 | EE | Wayne Goddard, Michael A. Henning: Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. Electronic Notes in Discrete Mathematics 11: 338-348 (2002) |
2001 | ||
27 | David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart: Multipartite Ramsey Numbers. Ars Comb. 58: (2001) | |
26 | EE | Wayne Goddard, Michael A. Henning: Pancyclicity of the prism. Discrete Mathematics 234(1-3): 139-142 (2001) |
2000 | ||
25 | EE | Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann: Bipartite Ramsey numbers and Zarankiewicz numbers. Discrete Mathematics 219(1-3): 85-95 (2000) |
1999 | ||
24 | Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart: Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54: (1999) | |
23 | EE | Wayne Goddard, Michael A. Henning: Real and integer domination in graphs. Discrete Mathematics 199(1-3): 61-75 (1999) |
22 | EE | Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart: Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999) |
1997 | ||
21 | Lenore Cowen, Wayne Goddard, C. E. Jesurum: Coloring with Defect. SODA 1997: 548-557 | |
20 | Lowell W. Beineke, Wayne Goddard, Marc J. Lipman: Graphs with Maximum Edge-Integrity. Ars Comb. 46: (1997) | |
19 | EE | Wayne Goddard, Michael D. Plummer, Henda C. Swart: Maximum and minimum toughness of graphs of small genus. Discrete Mathematics 167-168: 329-339 (1997) |
1996 | ||
18 | EE | 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 68(1-2): 73-84 (1996) |
17 | EE | Wayne Goddard, Henda C. Swart: Distances between graphs under edge operations. Discrete Mathematics 161(1-3): 121-132 (1996) |
16 | EE | Wayne Goddard, Meir Katchalski, Daniel J. Kleitman: Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17(4): 391-395 (1996) |
15 | EE | Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen: Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory, Ser. A 74(2): 173-187 (1996) |
1995 | ||
14 | EE | Wayne Goddard: Mistilings with dominoes. Discrete Mathematics 137(1-3): 361-365 (1995) |
1994 | ||
13 | Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Combinatorica 14(2): 127-134 (1994) | |
12 | EE | Wayne Goddard, Daniel J. Kleitman: An upper bound for the Ramsey numbers r(K3, G). Discrete Mathematics 125(1-3): 177-182 (1994) |
11 | EE | Lowell W. Beineke, Peter Hamburger, Wayne Goddard: Random packings of graphs. Discrete Mathematics 125(1-3): 45-54 (1994) |
10 | EE | Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart: Steiner distance stable graphs. Discrete Mathematics 132(1-3): 65-73 (1994) |
9 | EE | Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman: Even Cycles in Directed Graphs. SIAM J. Discrete Math. 7(3): 474-483 (1994) |
1993 | ||
8 | EE | Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart: Principal Common Divisors of Graphs. Eur. J. Comb. 14(2): 85-93 (1993) |
7 | Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman: Optimal Randomized Algorithms for Local Sorting and Set-Maxima. SIAM J. Comput. 22(2): 272-283 (1993) | |
1992 | ||
6 | EE | Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert: A Survey of Integrity. Discrete Applied Mathematics 37/38: 13-28 (1992) |
1991 | ||
5 | EE | Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Symposium on Computational Geometry 1991: 351-356 |
4 | EE | Wayne Goddard: Acyclic colorings of planar graphs. Discrete Mathematics 91(1): 91-94 (1991) |
3 | Binghuan Zhu, Wayne Goddard: An Algorithm for Outerplanar Graphs with Parameter. J. Algorithms 12(4): 657-662 (1991) | |
2 | EE | Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian: On multipartite tournaments. J. Comb. Theory, Ser. B 52(2): 284-300 (1991) |
1990 | ||
1 | Wayne Goddard, Valerie King, Leonard J. Schulman: Optimal Randomized Algorithms for Local Sorting and Set-Maxima STOC 1990: 45-53 |