Wayne Goddard - RankMe

126 papers A* 2A 3B 2Misc 3Journal 109Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	On the toughness of regular graphs and prisms. Australas. J Comb. Geoffrey Boyer, Wayne Goddard
2025	J	`jnl`	Bounds on coloring trees without rainbow paths. Discuss. Math. Graph Theory Wayne Goddard, Tyler Herrman, Simon Hughes
2025	J	`jnl`	Bounds on independent isolation in graphs. Discret. Appl. Math. Geoffrey Boyer, Wayne Goddard
2025	J	`jnl`	Coloring of graphs with cost-functions whose marginal costs decrease. Ars Comb. Wayne Goddard, Deirdre Lavey, Morgan S. Schalizki
2025	J	`jnl`	Domination in graphs and the removal of a matching. Discuss. Math. Graph Theory Geoffrey Boyer, Wayne Goddard
2024	J	`jnl`	Disjoint isolating sets and graphs with maximum isolation number. Discret. Appl. Math. Geoffrey Boyer, Wayne Goddard
2024	J	`jnl`	Domination parameters and the removal of matchings. Appl. Math. Comput. Geoffrey Boyer, Wayne Goddard, Michael A. Henning
2024	J	`jnl`	Illuminating a Graph. Ars Comb. Wayne Goddard, Deirdre Lavey
2024	J	`jnl`	On the Extremal Values of the Weighted Integrity of a Graph. J. Interconnect. Networks Wayne Goddard, Julia VanLandingham
2024	J	`jnl`	The fully weighted toughness of a graph. Discret. Appl. Math. Wayne Goddard, Julia VanLandingham
2024	J	`jnl`	The packing number of cubic graphs. Discret. Optim. Wayne Goddard, Michael A. Henning
2023	J	`jnl`	Graphs with Unique Minimum Specified Domination Sets. Graphs Comb. Wayne Goddard, Michael A. Henning
2023	J	`jnl`	Independent domination in outerplanar graphs. Discret. Appl. Math. Wayne Goddard, Michael A. Henning
2022	J	`jnl`	Compelling colorings: A generalization of the dominator chromatic number. Appl. Math. Comput. Anna Bachstein, Wayne Goddard, Michael A. Henning, John Xue
2022	J	`jnl`	Domination and dominator colorings in planar graphs with small diameter. Discret. Appl. Math. Wayne Goddard, Michael A. Henning
2022	J	`jnl`	The maximum average connectivity among all orientations of a graph. J. Comb. Optim. Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann
2022	J	`jnl`	Well-hued graphs. Discret. Appl. Math. Wayne Goddard, Kirsti Kuenzel, Eileen Melville
2020	J	`jnl`	Independent domination, colorings and the fractional idomatic number of a graph. Appl. Math. Comput. Wayne Goddard, Michael A. Henning
2020	J	`jnl`	The generalized matcher game. Discret. Appl. Math. Anna Bachstein, Wayne Goddard, Connor Lehmacher
2019	J	`jnl`	Almost injective colorings. Discuss. Math. Graph Theory Wayne Goddard, Robert Melville, Honghai Xu
2018	J	`jnl`	A note on domination and total domination in prisms. J. Comb. Optim. Wayne Goddard, Michael A. Henning
2018	J	`jnl`	Properly colored trails, paths, and bridges. J. Comb. Optim. Wayne Goddard, Robert Melville
2018	J	`jnl`	The matcher game played in graphs. Discret. Appl. Math. Wayne Goddard, Michael A. Henning
2018	J	`jnl`	Thoroughly dispersed colorings. J. Graph Theory Wayne Goddard, Michael A. Henning
2017	J	`jnl`	Coloring Graphs to Produce Properly Colored Walks. Graphs Comb. Robert Melville, Wayne Goddard
2016	J	`jnl`	Fractional, Circular, and Defective Coloring of Series-Parallel Graphs. J. Graph Theory Wayne Goddard, Honghai Xu
2016	J	`jnl`	Vertex colorings without rainbow subgraphs. Discuss. Math. Graph Theory Wayne Goddard, Honghai Xu
2015	J	`jnl`	WORM colorings. Discuss. Math. Graph Theory Wayne Goddard, Kirsti Wash, Honghai Xu
2014	J	`jnl`	A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
2014	J	`jnl`	A note on S-packing colorings of lattices. Discret. Appl. Math. Wayne Goddard, Honghai Xu
2013	J	`jnl`	An efficient algorithm for stopping on a sink in a directed graph. Oper. Res. Lett. Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki
2013	B	`conf`	Daemon Conversions in Distributed Self-stabilizing Algorithms. WALCOM Wayne Goddard, Pradip K. Srimani
2013	J	`jnl`	Independent domination in graphs: A survey and recent results. Discret. Math. Wayne Goddard, Michael A. Henning
2012	J	`jnl`	Eccentric counts, connectivity and chordality. Inf. Process. Lett. Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
2012	J	`jnl`	Independent dominating sets in triangle-free graphs. J. Comb. Optim. Wayne Goddard, Jeremy Lyle
2012	J	`jnl`	Self-Stabilizing Master-Slave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size. Int. J. Found. Comput. Sci. Wayne Goddard, Pradip K. Srimani
2012	J	`jnl`	The Discuss. Math. Graph Theory Wayne Goddard, Honghai Xu
2012	J	`jnl`	Vizing's conjecture: a survey and recent results. J. Graph Theory Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall
2011	J	`jnl`	Bounds on the k-domination number of a graph. Appl. Math. Lett. Ermelinda DeLaViña, Wayne Goddard, Michael A. Henning, Ryan Pepper, Emil R. Vaughan
2011	J	`jnl`	Dense graphs with small clique number. J. Graph Theory Wayne Goddard, Jeremy Lyle
2011	—	`ch.`	Distance in Graphs. Structural Analysis of Complex Networks Wayne Goddard, Ortrud R. Oellermann
2011	—	`conf`	Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size. IPDPS Workshops Wayne Goddard, Pradip K. Srimani
2010	J	`jnl`	Capacitated Domination. Ars Comb. Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae
2010	—	`conf`	Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size. IPDPS Workshops Wayne Goddard, Pradip K. Srimani
2009	J	`jnl`	A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. Graphs Comb. Wayne Goddard, Michael A. Henning
2009	J	`jnl`	A note on trees, tables, and algorithms. Networks Wayne Goddard, Stephen T. Hedetniemi
2009	J	`jnl`	The binding number of a graph and its cliques. Discret. Appl. Math. Jeremy Lyle, Wayne Goddard
2008	Misc	`conf`	Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. ICDCN Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2008	J	`jnl`	Braodcast Chromatic Numbers of Graphs. Ars Comb. Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall
2008	J	`jnl`	Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2008	J	`jnl`	On domination and reinforcement numbers in trees. Discret. Math. Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki
2008	J	`jnl`	Self-Stabilizing Graph Protocols. Parallel Process. Lett. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
2007	J	`jnl`	Orientation distance graphs revisited. Discuss. Math. Graph Theory Wayne Goddard, Kiran Kanakadandi
2007	J	`jnl`	Restricted domination parameters in graphs. J. Comb. Optim. Wayne Goddard, Michael A. Henning
2006	Misc	`conf`	An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi
2006	J	`jnl`	Construction of trees and graphs with equal domination parameters. Discret. Math. Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt
2006	B	`conf`	Distance- SIROCCO Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
2006	J	`jnl`	Domination in Planar Graphs with Small Diameter II. Ars Comb. Michael Dorfling, Wayne Goddard, Michael A. Henning
2006	J	`jnl`	Simultaneous graph parameters: Factor domination and factor total domination. Discret. Math. Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar
2005	J	`jnl`	An algorithm for partial Grundy number on trees. Discret. Math. Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae
2005	J	`jnl`	Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discret. Math. Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning
2005	J	`jnl`	Generalized subgraph-restricted matchings in graphs. Discret. Math. Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar
2005	J	`jnl`	Multiple vertex coverings by cliques. J. Graph Theory Wayne Goddard, Michael A. Henning
2005	J	`jnl`	Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2005	J	`jnl`	Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. Int. J. Distributed Sens. Networks Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2004	J	`jnl`	An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Inf. Process. Lett. Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi
2004	J	`jnl`	Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
2004	A	`conf`	Fault Tolerant Algorithms for Orderings and Colorings. IPDPS Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2004	J	`jnl`	Hereditary domination and independence parameters . Discuss. Math. Graph Theory Wayne Goddard, Teresa W. Haynes, Debra J. Knisley
2004	J	`jnl`	Maximum sizes of graphs with given domination parameters. Discret. Math. Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart
2004	J	`jnl`	Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. Graphs Comb. Wayne Goddard
2004	J	`jnl`	Offensive alliances in graphs. Discuss. Math. Graph Theory Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs
2004	J	`jnl`	Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
2004	J	`jnl`	The diameter of total domination vertex critical graphs. Discret. Math. Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe
2003	—	`conf`	A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. ICDCS Workshops Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003	A	`conf`	A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. IPDPS Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003	—	`conf`	A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. IWDC Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani
2003	J	`jnl`	A computer / human mastermind player using grids. South Afr. Comput. J. Wayne Goddard
2003	J	`jnl`	Changing upper irredundance by edge addition. Discret. Math. Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
2003	J	`jnl`	Distance and connectivity measures in permutation graphs. Discret. Math. Wayne Goddard, Michael Edwin Raines, Peter J. Slater
2003	J	`jnl`	MAD trees and distance-hereditary graphs. Discret. Appl. Math. Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
2003	J	`jnl`	Nordhaus-Gaddum bounds for independent domination. Discret. Math. Wayne Goddard, Michael A. Henning
2003	Misc	`conf`	Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2003	A	`conf`	Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. IPDPS Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
2002	J	`jnl`	4-connected maximal planar graphs are 4-ordered. Discret. Math. Wayne Goddard
2002	J	`jnl`	Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
2002	J	`jnl`	Domination in planar graphs with small diameter. J. Graph Theory Wayne Goddard, Michael A. Henning
2002	J	`jnl`	Limited flooding protocol for mobile ad hoc networks. South Afr. Comput. J. Mieso K. Denko, Wayne Goddard
2002	J	`jnl`	Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. Electron. Notes Discret. Math. Wayne Goddard, Michael A. Henning
2001	J	`jnl`	Average distance in colored graphs. J. Graph Theory Peter Dankelmann, Wayne Goddard, Peter J. Slater
2001	J	`jnl`	Multipartite Ramsey Numbers. Ars Comb. David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart
2001	J	`jnl`	Pancyclicity of the prism. Discret. Math. Wayne Goddard, Michael A. Henning
2000	J	`jnl`	Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
1999	J	`jnl`	Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
1999	J	`jnl`	Generalized eccentricity, radius, and diameter in graphs. Networks Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
1999	J	`jnl`	Homogeneous Embeddings of Cycles in Graphs. Graphs Comb. Wayne Goddard, Michael A. Henning, Hiren Maharaj
1999	J	`jnl`	Real and integer domination in graphs. Discret. Math. Wayne Goddard, Michael A. Henning
1998	J	`jnl`	Weakly pancyclic graphs. J. Graph Theory Stephan Brandt, Ralph J. Faudree, Wayne Goddard
1997	J	`jnl`	A note on cliques and independent sets. J. Graph Theory Roger C. Entringer, Wayne Goddard, Michael A. Henning
1997	A*	`conf`	Coloring with Defect. SODA Lenore Cowen, Wayne Goddard, C. Esther Jesurum
1997	J	`jnl`	Defective coloring revisited. J. Graph Theory Lenore Cowen, Wayne Goddard, C. Esther Jesurum
1997	J	`jnl`	Graphs with Maximum Edge-Integrity. Ars Comb. Lowell W. Beineke, Wayne Goddard, Marc J. Lipman
1997	J	`jnl`	Maximum and minimum toughness of graphs of small genus. Discret. Math. Wayne Goddard, Michael D. Plummer, Henda C. Swart
1996	J	`jnl`	Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory A Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen
1996	J	`jnl`	Distances between graphs under edge operations. Discret. Math. Wayne Goddard, Henda C. Swart
1996	J	`jnl`	Forcing Disjoint Segments in the Plane. Eur. J. Comb. Wayne Goddard, Meir Katchalski, Daniel J. Kleitman
1996	J	`jnl`	The Algorithmic Complexity of Minus Domination in Graphs. Discret. Appl. Math. Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning
1996	J	`jnl`	The toughness of cubic graphs. Graphs Comb. Wayne Goddard
1995	J	`jnl`	Mistilings with dominoes. Discret. Math. Wayne Goddard
1994	J	`jnl`	An upper bound for the Ramsey numbers r(K Discret. Math. Wayne Goddard, Daniel J. Kleitman
1994	J	`jnl`	Crossing Families. Comb. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1994	J	`jnl`	Even Cycles in Directed Graphs. SIAM J. Discret. Math. Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman
1994	J	`jnl`	Measures of vulnerability-the integrity family. Networks Wayne Goddard
1994	J	`jnl`	Random packings of graphs. Discret. Math. Lowell W. Beineke, Peter Hamburger, Wayne Goddard
1994	J	`jnl`	Steiner distance stable graphs. Discret. Math. Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart
1993	J	`jnl`	A note on maximal triangle-free graphs. J. Graph Theory Wayne Goddard, Daniel J. Kleitman
1993	—	`conf`	Agreement Subtrees, Metric and Consensus for Labeled Binary Trees. Partitioning Data Sets Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki, Fred R. McMorris
1993	J	`jnl`	Optimal Randomized Algorithms for Local Sorting and Set-Maxima. SIAM J. Comput. Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman
1993	J	`jnl`	Principal Common Divisors of Graphs. Eur. J. Comb. Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart
1992	J	`jnl`	A Survey of Integrity. Discret. Appl. Math. Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert
1992	J	`jnl`	Some nordhaus- gaddum-type results. J. Graph Theory Wayne Goddard, Michael A. Henning, Henda C. Swart
1991	J	`jnl`	Acyclic colorings of planar graphs. Discret. Math. Wayne Goddard
1991	J	`jnl`	An Algorithm for Outerplanar Graphs with Parameter. J. Algorithms Binghuan Zhu, Wayne Goddard
1991	—	`conf`	Crossing Families. SCG Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
1991	J	`jnl`	On multipartite tournaments. J. Comb. Theory B Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian
1990	A*	`conf`	Optimal Randomized Algorithms for Local Sorting and Set-Maxima STOC Wayne Goddard, Valerie King, Leonard J. Schulman