Discrete Applied Mathematics, Volume 41

Volume 41, Number 1, 1993

• Richard J. Nowakowski:
  Search ans Sweep Numbers of Finite Directed Acyclic Graphs. 1-11
  Electronic Edition (link) BibTeX
• Randy Shull, Alan Shuchat, James B. Orlin, Marianne Lepp:
  Recognizing Hidden Bicircular Networks. 13-53
  Electronic Edition (link) BibTeX
• Frank W. Sinden:
  Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly. 55-68
  Electronic Edition (link) BibTeX

• Tadashi Arai, Shuichi Ueno, Yoji Kajitani:
  Generalization of aTheorem on the Parametric Maximum Flow Problem. 69-74
  Electronic Edition (link) BibTeX
• Jørgen Bang-Jensen, Pavol Hell:
  Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. 75-79
  Electronic Edition (link) BibTeX

Volume 41, Number 2, 1993

• Karel Culik II, Simant Dube:
  Rational and Affine Expressions for Image Description. 85-120
  Electronic Edition (link) BibTeX
• Caterina De Simone, Antonio Sassano:
  Stability Number of Bull- and Chair-Free Graphs. 121-129
  Electronic Edition (link) BibTeX
• Jutta Eusterbrock:
  Errata to "Selecting the Top Three Elements" by M. Aigner: A Result of a Computer-Assisted Proof Search. 131-137
  Electronic Edition (link) BibTeX
• Frieda Granot, Jadranka Skorin-Kapov:
  On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. 139-146
  Electronic Edition (link) BibTeX
• Ephraim Korach, Ady Tal:
  General Vertex Disjoint Paths in Series-Parallel Graphs. 147-164
  Electronic Edition (link) BibTeX

• Neal Brand, Stephen M. Curran, Sajal K. Das, Tom Jacob:
  Probability of Diameter Two for Steinhaus Graphs. 165-171
  Electronic Edition (link) BibTeX
• Gábor Galambos, J. B. G. Frenk:
  A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case. 173-178
  Electronic Edition (link) BibTeX

• Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
  New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). 179-180
  Electronic Edition (link) BibTeX

Volume 41, Number 3, 1993

• E. Andrew Boyd:
  Polyhedral Results for the Precedence-Constrained Knapsack Problem. 185-201
  Electronic Edition (link) BibTeX
• John V. Franco:
  On the Occurrence of Null Clauses in Random Instances of Satisfiability. 203-209
  Electronic Edition (link) BibTeX
• Chung-Yee Lee, Surya Danusaputro Liman:
  Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times. 211-222
  Electronic Edition (link) BibTeX
• Sheelagh Lloyd:
  Balance, Uncorrelatedness and the Strict Avalanche Criterion. 223-233
  Electronic Edition (link) BibTeX
• Kyle Siegrist, Ashok T. Amin, Peter J. Slater:
  The Optimal Unicyclic Graphs for Pair-Connected Reliability. 235-243
  Electronic Edition (link) BibTeX
• Mike A. Steel:
  Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony. 245-261
  Electronic Edition (link) BibTeX
• Huishan Zhou:
  The Chromatic Difference Sequence of the Cartesian Product of Graphs: Part II. 263-267
  Electronic Edition (link) BibTeX

• Judit Csima, László Lovász:
  Dating to Marriage. 269-270
  Electronic Edition (link) BibTeX
• Arto Salomaa:
  Simple Reductions Between D0L Language and Sequence Equivalence Problems. 271-274
  Electronic Edition (link) BibTeX