Discrete Applied Mathematics, Volume 64

Volume 64, Number 1, 1996

Victor Chepoi:
A Multifacility Location Problem on Median Spaces. 1-29
Aviezri S. Fraenkel, Shmuel T. Klein:
Robust Universal Complete Codes for Transmission and Compression. 31-55
Bert Hartnell, Michael D. Plummer:
On 4-connected Claw-free Well-covered Graphs. 57-65
Denise Sakai Troxell:
No-hole k-tuple (r+1)-distant Colorings. 67-85
David R. Guichard:
No-hole K-tuple (r+1)-distant Colorings of odd Cycles. 87-92

Ronald D. Armstrong, Zhiying Jin:
Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing. 97-103
Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
Gossiping with Multiple Sends and Receives. 105-116
Rong-si Chen:
Coronoid Systems with Perfect Matchings. 117-133
Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs. 135-149
Alon Orlitsky, Santosh S. Venkatesh:
On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures. 151-178
Masatsugu Urabe:
on a Partition into Convex Polygons. 179-191

Andreas Brandstädt, Heinz-Jürgen Voss:
Short Disjoint Cycles in Graphs with Degree Constraints. 197-205
Michael B. Dillencourt:
Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. 207-217
Alix Munier:
The Basic Cyclic Scheduling Problem with Linear Precedence Constraints. 219-238
Carles Padró, Paz Morillo, Eduard Llobet Valero:
Diameter-vulnerability of Large Bipartite Digraphs. 239-248
G. Sajith, Sanjeev Saxena:
Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. 249-265
Terunao Soneoka, Makoto Imase, Yoshifumi Manabe:
Design of a D-connected Digraph with a Minimum Number of Edges and a Quasiminimal Diameter: II. 267-279
Rolf H. Möhring:
Triangulating Graphs Without Asteroidal Triples. 281-287