Wayne Goddard

J. Graph Theory, 2005

Self-Stabilizing Algorithms For Orderings And Colorings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2005

An algorithm for partial Grundy number on trees.

[BibT_eX]

[DOI]

Zhengnan Shi

Ken Kennedy

Renu C. Laskar

Alice A. McRae

Discret. Math., 2005

Generalized subgraph-restricted matchings in graphs.

[BibT_eX]

[DOI]

Sandra Mitchell Hedetniemi

Renu C. Laskar

Discret. Math., 2005

Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

Distance-two information in self-stabilizing algorithms.

[BibT_eX]

[DOI]

Martin Gairing

Petter Kristiansen

Alice A. McRae

Parallel Process. Lett., 2004

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.

[BibT_eX]

[DOI]

Martin Gairing

Parallel Process. Lett., 2004

An anonymous self-stabilizing algorithm for 1-maximal independent set in trees.

[BibT_eX]

[DOI]

Zhengnan Shi

Inf. Process. Lett., 2004

Minimum Degree Conditions for Cycles Including Specified Sets of Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2004

Hereditary domination and independence parameters .

[BibT_eX]

[DOI]

Teresa W. Haynes

Debra J. Knisley

Discuss. Math. Graph Theory, 2004

Offensive alliances in graphs.

[BibT_eX]

[DOI]

Odile Favaron

Gerd Fricke

Sandra Mitchell Hedetniemi

Petter Kristiansen

Renu C. Laskar

R. Duane Skaggs

Discuss. Math. Graph Theory, 2004

The diameter of total domination vertex critical graphs.

[BibT_eX]

[DOI]

Teresa W. Haynes

Lucas C. van der Merwe

Discret. Math., 2004

Maximum sizes of graphs with given domination parameters.

[BibT_eX]

[DOI]

Discret. Math., 2004

Fault Tolerant Algorithms for Orderings and Colorings.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

A computer / human mastermind player using grids.

[BibT_eX]

[DOI]

S. Afr. Comput. J., 2003

Distance and connectivity measures in permutation graphs.

[BibT_eX]

[DOI]

Michael Edwin Raines

Peter J. Slater

Discret. Math., 2003

Nordhaus-Gaddum bounds for independent domination.

[BibT_eX]

[DOI]

Discret. Math., 2003

Changing upper irredundance by edge addition.

[BibT_eX]

[DOI]

Christina M. Mynhardt

Discret. Math., 2003

MAD trees and distance-hereditary graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph.

[BibT_eX]

[DOI]

Zhenyu Xu

Proceedings of the Distributed Computing, 2003

A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems Workshops (ICDCS 2003 Workshops), 2003

Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

2002

Limited flooding protocol for mobile ad hoc networks.

[BibT_eX]

[DOI]

Mieso K. Denko

S. Afr. Comput. J., 2002

Domination in planar graphs with small diameter.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

4-connected maximal planar graphs are 4-ordered.

[BibT_eX]

[DOI]

Discret. Math., 2002

Augmenting trees so that every three vertices lie on a cycle.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Average distance in colored graphs.

[BibT_eX]

[DOI]

Peter Dankelmann

Peter J. Slater

J. Graph Theory, 2001

Pancyclicity of the prism.

[BibT_eX]

[DOI]

Discret. Math., 2001

Multipartite Ramsey Numbers.

[BibT_eX]

Ars Comb., 2001

2000

Bipartite Ramsey numbers and Zarankiewicz numbers.

[BibT_eX]

[DOI]

Ortrud R. Oellermann

Discret. Math., 2000

1999

Generalized eccentricity, radius, and diameter in graphs.

[BibT_eX]

[DOI]

Networks, 1999

Homogeneous Embeddings of Cycles in Graphs.

[BibT_eX]

[DOI]

Hiren Maharaj

Graphs Comb., 1999

Real and integer domination in graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Bounds on the Total Redundance and Efficiency of a Graph.

[BibT_eX]

Ars Comb., 1999

1998

Weakly pancyclic graphs.

[BibT_eX]

[DOI]

Stephan Brandt

Ralph J. Faudree

J. Graph Theory, 1998

1997

A note on cliques and independent sets.

[BibT_eX]

[DOI]

Roger C. Entringer

J. Graph Theory, 1997

Defective coloring revisited.

[BibT_eX]

[DOI]

Lenore Cowen

C. Esther Jesurum

J. Graph Theory, 1997

Maximum and minimum toughness of graphs of small genus.

[BibT_eX]

[DOI]

Michael D. Plummer

Discret. Math., 1997

Graphs with Maximum Edge-Integrity.

[BibT_eX]

Lowell W. Beineke

Marc J. Lipman

Ars Comb., 1997

Coloring with Defect.

[BibT_eX]

[DOI]

Lenore Cowen

C. Esther Jesurum

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Counting Pairs of Lattice Paths by Intersections.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

The toughness of cubic graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1996

Forcing Disjoint Segments in the Plane.

[BibT_eX]

[DOI]

Meir Katchalski

Eur. J. Comb., 1996

Distances between graphs under edge operations.

[BibT_eX]

[DOI]

Discret. Math., 1996

The Algorithmic Complexity of Minus Domination in Graphs.

[BibT_eX]

[DOI]

Jean E. Dunbar

Alice A. McRae

Discret. Appl. Math., 1996

1995

Mistilings with dominoes.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

Even Cycles in Directed Graphs.

[BibT_eX]

[DOI]

Fan R. K. Chung

SIAM J. Discret. Math., 1994

Measures of vulnerability-the integrity family.

[BibT_eX]

[DOI]

Networks, 1994

Steiner distance stable graphs.

[BibT_eX]

[DOI]

Ortrud R. Oellermann

Discret. Math., 1994

An upper bound for the Ramsey numbers r(K3, G).

[BibT_eX]

[DOI]

Discret. Math., 1994

Random packings of graphs.

[BibT_eX]

[DOI]

Lowell W. Beineke

Peter Hamburger

Discret. Math., 1994

1993

Optimal Randomized Algorithms for Local Sorting and Set-Maxima.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

A note on maximal triangle-free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Principal Common Divisors of Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1993

Agreement Subtrees, Metric and Consensus for Labeled Binary Trees.

[BibT_eX]

[DOI]

Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993

1992

Some nordhaus- gaddum-type results.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

A Survey of Integrity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1991

On multipartite tournaments.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

An Algorithm for Outerplanar Graphs with Parameter.

[BibT_eX]

[DOI]

Binghuan Zhu

J. Algorithms, 1991

Acyclic colorings of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 1991

Crossing Families.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Optimal Randomized Algorithms for Local Sorting and Set-Maxima

[BibT_eX]

[DOI]