Discrete Applied Mathematics, Volume 63

Volume 63, Number 1, 1995

• Hernán G. Abeledo, Uriel G. Rothblum:
  Paths to Marriage Stability. 1-12
  Electronic Edition (link) BibTeX
• J. Orestes Cerdeira, Isabel Faria, Paulo Bárcia:
  Establishing Determinantal Inequalities for Positive-definite Matrices. 13-24
  Electronic Edition (link) BibTeX
• Mauro Dell'Amico, Silvano Martello, Daniele Vigo:
  Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. 25-41
  Electronic Edition (link) BibTeX
• Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
  on the Recognition of Permuted Bottleneck Monge Matrices. 43-74
  Electronic Edition (link) BibTeX
• Markus W. Schäffter:
  Drawing Graphs on Rectangular Grids. 75-89
  Electronic Edition (link) BibTeX
• Abdelmadjid Bouabdallah, Charles Delorme, Selma Djelloul:
  Edge Deletion Preserving the Diameter of the Hypercube. 91-95
  Electronic Edition (link) BibTeX

Volume 63, Number 2, 1995

• James R. Driscoll, Dennis M. Healy Jr., Garth Isaak:
  Scheduling Dyadic Intervals. 101-116
  Electronic Edition (link) BibTeX
• Fahir Ö. Ergincan, David A. Gregory:
  Directed Moore Hypergraphs. 117-127
  Electronic Edition (link) BibTeX
• Alexandros V. Gerbessiotis:
  Close-to-optimal and Near-optimal Broadcasting in Random Graphs. 129-150
  Electronic Edition (link) BibTeX
• Hong-Jian Lai, Hongyuan Lai:
  Every Matroid Is a Submatroid of a Uniformly Dense Matroid. 151-160
  Electronic Edition (link) BibTeX
• Mandayam A. Srinivas:
  Matroid optimization with Generalized Constraints. 161-174
  Electronic Edition (link) BibTeX
• Li-Hui Tsai:
  The Modified Differencing Method for the Set Partitioning Problem with Cardinality Constraints. 175-180
  Electronic Edition (link) BibTeX
• María Rosa Brito:
  A Simple as Correct Algorithm for Deciding If a Graph Has a Perfect Matching. 181-185
  Electronic Edition (link) BibTeX
• Carsten Flotow:
  on Powers of M-trapezoid Graphs. 187-192
  Electronic Edition (link) BibTeX
• Marjo Lipponen, Gheorghe Paun:
  Strongly Prime PCP Words. 193-197
  Electronic Edition (link) BibTeX
• Bruno Courcelle:
  The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. 199-200
  Electronic Edition (link) BibTeX

Volume 63, Number 3, 1995

• Igor Averbakh, Oded Berman, Abraham P. Punnen:
  Constrained Matroidal Bottleneck Problems. 201-214
  Electronic Edition (link) BibTeX
• Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg:
  Weighted Independent Perfect Domination on Cocomparability Graphs. 215-222
  Electronic Edition (link) BibTeX
• Evangelos Kranakis, Danny Krizanc:
  Labeled Versus Unlabeled Distributed Cayley Networks. 223-236
  Electronic Edition (link) BibTeX
• Eugeniusz Nowicki, Stanislaw Zdrzaka:
  A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times. 237-256
  Electronic Edition (link) BibTeX
• Wolfgang Stadje:
  Selecting Jobs for Scheduling on a Machine Subject to Failure. 257-265
  Electronic Edition (link) BibTeX
• Jerzy Topp, Preben D. Vestergaard:
  Well Irredundant Graphs. 267-276
  Electronic Edition (link) BibTeX
• Lucian Ilie:
  on Subwords of Infinite Words. 277-279
  Electronic Edition (link) BibTeX