Discrete Applied Mathematics, Volume 22

Volume 22, Number 1, December 1988

• Thomas Andreae:
  On the unit interval number of a graph. 1-7
  Electronic Edition (link) BibTeX
• D. C. Blest, D. G. Fitzgerald:
  Scheduling sports competitions with a given distribution of times. 9-19
  Electronic Edition (link) BibTeX
• Gerard J. Chang:
  Labeling algorithms for domination problems in sun-free chordal graphs. 21-34
  Electronic Edition (link) BibTeX
• John Franco, Yuan Chuan Ho:
  Probabilistic performance of a heuristic for the satisfiability problem. 35-51
  Electronic Edition (link) BibTeX
• Takashi Kayano, Maretsugu Yamasaki:
  Discrete Dirichlet integral formula. 53-68
  Electronic Edition (link) BibTeX
• Fred S. Roberts, Zangwill Rosenbaum:
  Tight and loose value automorphisms. 69-79
  Electronic Edition (link) BibTeX
• Alica Kelemenová:
  Regeneration in IL systems. 81-86
  Electronic Edition (link) BibTeX
• Anna Lubiw:
  A note on odd/even cycles. 87-92
  Electronic Edition (link) BibTeX
• Miroslawa Skowronska:
  The binding number of Halin graphs. 93-97
  Electronic Edition (link) BibTeX

Volume 22, Number 2, 1989

• Dean S. Clark, James T. Lewis:
  Avoiding-sequences with minimum sum. 103-108
  Electronic Edition (link) BibTeX
• Derek G. Corneil, Jean Fonlupt:
  The complexity of generalized clique covering. 109-118
  Electronic Edition (link) BibTeX
• Peter C. Fishburn, William V. Gehrlein:
  Pick-and-choose heuristics for partial set covering. 119-132
  Electronic Edition (link) BibTeX
• Ron Holzman:
  To vote or not to vote: What is the quota? 133-141
  Electronic Edition (link) BibTeX
• Nancy G. Kinnersley, Michael A. Langston:
  Online variable-sized bin packing. 143-148
  Electronic Edition (link) BibTeX
• Ronald C. Mullin, I. M. Onyszchuk, Scott A. Vanstone, R. M. Wilson:
  Optimal normal bases in GF(pⁿ). 149-161
  Electronic Edition (link) BibTeX
• Yoav Raz:
  Interactive L Systems with a Fast Local Growth. 163-179
  Electronic Edition (link) BibTeX
• Moshe Segal, Donald M. Topkis:
  Acyclic k-connected subgraphs for distributed alternate routing in communications networks. 181-189
  Electronic Edition (link) BibTeX
• Fabio Tardella:
  On a class of functions attaining their maximum at the vertices of a polyhedron. 191-195
  Electronic Edition (link) BibTeX

Volume 22, Number 3, 1989

• Jean Claude Bermaud, Jean-Michel Fourneau, Alain Jean-Marie:
  A graph theoretical approach to equivalence of multistage interconnection networks. 201-214
  Electronic Edition (link) BibTeX
• Thomas J. Marlowe Jr., M. C. Paull:
  Least-cost partition algorithms. 215-239
  Electronic Edition (link) BibTeX
• Kazuo Murota:
  Combinatorial dynamical system theory: General framework and controllability criteria. 241-265
  Electronic Edition (link) BibTeX
• Ivan Stojmenovic:
  On sheffer symmetric functions in three-valued logic. 267-274
  Electronic Edition (link) BibTeX
• Gottfried Tinhofer:
  Strong tree-cographs are birkhoff graphs. 275-288
  Electronic Edition (link) BibTeX
• Antal Iványi:
  Construction of infinite de Bruijn arrays. 289-293
  Electronic Edition (link) BibTeX