Discrete Applied Mathematics
, Volume 22
Volume 22, Number 1, December 1988
Thomas Andreae
:
On the unit interval number of a graph.
1-7
D. C. Blest
,
D. G. Fitzgerald
:
Scheduling sports competitions with a given distribution of times.
9-19
Gerard J. Chang
:
Labeling algorithms for domination problems in sun-free chordal graphs.
21-34
John Franco
,
Yuan Chuan Ho
:
Probabilistic performance of a heuristic for the satisfiability problem.
35-51
Takashi Kayano
,
Maretsugu Yamasaki
:
Discrete Dirichlet integral formula.
53-68
Fred S. Roberts
,
Zangwill Rosenbaum
:
Tight and loose value automorphisms.
69-79
Alica Kelemenová
:
Regeneration in IL systems.
81-86
Anna Lubiw
:
A note on odd/even cycles.
87-92
Miroslawa Skowronska
:
The binding number of Halin graphs.
93-97
Volume 22, Number 2, 1989
Dean S. Clark
,
James T. Lewis
:
Avoiding-sequences with minimum sum.
103-108
Derek G. Corneil
,
Jean Fonlupt
:
The complexity of generalized clique covering.
109-118
Peter C. Fishburn
,
William V. Gehrlein
:
Pick-and-choose heuristics for partial set covering.
119-132
Ron Holzman
:
To vote or not to vote: What is the quota?
133-141
Nancy G. Kinnersley
,
Michael A. Langston
:
Online variable-sized bin packing.
143-148
Ronald C. Mullin
,
I. M. Onyszchuk
,
Scott A. Vanstone
,
R. M. Wilson
:
Optimal normal bases in GF(p
n
).
149-161
Yoav Raz
:
Interactive L Systems with a Fast Local Growth.
163-179
Moshe Segal
,
Donald M. Topkis
:
Acyclic k-connected subgraphs for distributed alternate routing in communications networks.
181-189
Fabio Tardella
:
On a class of functions attaining their maximum at the vertices of a polyhedron.
191-195
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
Thomas J. Marlowe Jr.
,
M. C. Paull
:
Least-cost partition algorithms.
215-239
Kazuo Murota
:
Combinatorial dynamical system theory: General framework and controllability criteria.
241-265
Ivan Stojmenovic
:
On sheffer symmetric functions in three-valued logic.
267-274
Gottfried Tinhofer
:
Strong tree-cographs are birkhoff graphs.
275-288
Antal Iványi
:
Construction of infinite de Bruijn arrays.
289-293
Copyright ©
Mon Nov 2 21:30:59 2009 by
Michael Ley
(
ley@uni-trier.de
)