Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Goddard, Wayne"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vizing's conjecture: A survey and recent results
Bos̑tjan Bres̑ar
,
Paul Dorbec
,
Wayne Goddard
,
Bert L. Hartnell
,
Michael A. Henning
,
Sandi Klavz̑ar
,
Douglas F. Rall
Journal of Graph Theory
69
(1), 2012, pp. 46-76
Eccentric counts, connectivity and chordality
Peter Dankelmann
,
David Erwin
,
Wayne Goddard
,
Simon Mukwembi
,
Henda C. Swart
Information Processing Letters
112
(24), 2012, pp. 944-947
Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size
Wayne Goddard
,
Pradip K. Srimani
International Journal of Foundations of Computer Science
23
(4), 2012, pp. 763-777
Dense graphs with small clique number
Wayne Goddard
,
Jeremy Lyle
Journal of Graph Theory
66
(4), 2011, pp. 319-331
A note on trees, tables, and algorithms
Wayne Goddard
,
Stephen T. Hedetniemi
Networks
53
(2), 2009, pp. 184-190
A characterization of cubic graphs with paired-domination number three-fifths their order
Wayne Goddard
,
Michael A. Henning
Graphs and Combinatorics
25
(5), 2009, pp. 675-692
Self-stabilizing graph protocols
Wayne Goddard
,
Stephen T. Hedetniemi
,
David P. Jacobs
,
Pradip K. Srimani
,
Zhenyu Xu
Parallel Processing Letters
18
(1), 2008, pp. 189-199
Distance-
k
knowledge in self-stabilizing algorithms
Wayne Goddard
,
Stephen T. Hedetniemi
,
David P. Jacobs
,
Vilmar Trevisan
Theoretical Computer Science
399
(1-2), 2008, pp. 118-127
Self-stabilizing algorithms for orderings and colorings
Wayne Goddard
,
Stephen T. Hedetniemi
,
David P. Jacobs
,
Pradip K. Srimani
International Journal of Foundations of Computer Science
16
(1), 2005, pp. 19-36
Multiple vertex coverings by cliques
Wayne Goddard
,
Michael A. Henning
Journal of Graph Theory
48
(2), 2005, pp. 157-167
Self-stabilizing maximal
k
-dependent sets in linear time
Martin Gairing
,
Wayne Goddard
,
Stephen T. Hedetniemi
,
David P. Jacobs
Parallel Processing Letters
14
(1), 2004, pp. 75-82
Distance-two information in self-stabilizing algorithms
Martin Gairing
,
Wayne Goddard
,
Stephen T. Hedetniemi
,
Petter Kristiansen
,
Alice A. McRae
Parallel Processing Letters
14
(3-4), 2004, pp. 387-398
Minimum degree conditions for cycles including specified sets of vertices
Wayne Goddard
Graphs and Combinatorics
20
(4), 2004, pp. 467-483
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
Zhengnan Shi
,
Wayne Goddard
,
Stephen T. Hedetniemi
Information Processing Letters
91
(2), 2004, pp. 77-83
Augmenting trees so that every three vertices lie on a cycle
Peter Dankelmann
,
Wayne Goddard
,
Ortrud R. Oellermann
,
Henda C. Swart
Discrete Applied Mathematics
116
(1-2), 2002, pp. 145-159
Domination in planar graphs with small diameter
Wayne Goddard
,
Michael A. Henning
Journal of Graph Theory
40
(1), 2002, pp. 1-25
Average distance in colored graphs
Peter Dankelmann
,
Wayne Goddard
,
Peter Slater
Journal of Graph Theory
38
(1), 2001, pp. 1-17
Generalized eccentricity, radius, and diameter in graphs
Peter Dankelmann
,
Wayne Goddard
,
Michael A. Henning
,
Henda C. Swart
Networks
34
(4), 1999, pp. 312-319
Homogeneous embeddings of cycles in graphs
Wayne Goddard
,
Michael A. Henning
,
Hiren Maharaj
Graphs and Combinatorics
15
(2), 1999, pp. 159-173
Weakly pancyclic graphs
Stephan Brandt
,
Ralph Faudree
,
Wayne Goddard
Journal of Graph Theory
27
(3), 1998, pp. 141-176
Defective coloring revisited
Lenore Cowen
,
Wayne Goddard
,
C. Esther Jesurum
Journal of Graph Theory
24
(3), 1997, pp. 205-219
A note on cliques and independent sets
Roger C. Entringer
,
Wayne Goddard
,
Michael A. Henning
Journal of Graph Theory
24
(1), 1997, pp. 21-23
The algorithmic complexity of minus domination in graphs
Jean Dunbar
,
Wayne Goddard
,
Stephen Hedetniemi
,
Alice McRae
,
Michael A. Henning
Discrete Applied Mathematics
68
(1-2), 1996, pp. 73-84
Counting pairs of lattice paths by intersections
Ira Gessel
,
Wayne Goddard
,
Walter Shur
,
Herbert S. Wilf
,
Lily Yen
Journal of Combinatorial Theory Series A
74
(2), 1996, pp. 173-187
The toughness of cubic graphs
Wayne Goddard
Graphs and Combinatorics
12
, 1996, pp. 17-22
Seiten 1
2
>