Discrete Applied Mathematics, Volume 64

Volume 64, Number 1, 1996

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

Volume 64, Number 2, 1996

• Ronald D. Armstrong, Zhiying Jin:
  Strongly Polynomial Simplex Algorithm for Bipartite Vertex Packing. 97-103
  Electronic Edition (link) BibTeX
• Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi:
  Gossiping with Multiple Sends and Receives. 105-116
  Electronic Edition (link) BibTeX
• Rong-si Chen:
  Coronoid Systems with Perfect Matchings. 117-133
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Alon Orlitsky, Santosh S. Venkatesh:
  On Edge-colored Interior Planar Graphs on a Circle and the Expected Number of RNA Secondary Structures. 151-178
  Electronic Edition (link) BibTeX
• Masatsugu Urabe:
  on a Partition into Convex Polygons. 179-191
  Electronic Edition (link) BibTeX

Volume 64, Number 3, 1996

• Andreas Brandstädt, Heinz-Jürgen Voss:
  Short Disjoint Cycles in Graphs with Degree Constraints. 197-205
  Electronic Edition (link) BibTeX
• Michael B. Dillencourt:
  Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. 207-217
  Electronic Edition (link) BibTeX
• Alix Munier:
  The Basic Cyclic Scheduling Problem with Linear Precedence Constraints. 219-238
  Electronic Edition (link) BibTeX
• Carles Padró, Paz Morillo, Eduard Llobet Valero:
  Diameter-vulnerability of Large Bipartite Digraphs. 239-248
  Electronic Edition (link) BibTeX
• G. Sajith, Sanjeev Saxena:
  Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. 249-265
  Electronic Edition (link) BibTeX
• 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
  Electronic Edition (link) BibTeX
• Rolf H. Möhring:
  Triangulating Graphs Without Asteroidal Triples. 281-287
  Electronic Edition (link) BibTeX