Volume 50, Number 1, April 1994
Volume 50, Number 2, May 1994
- El Houssaine Aghezzaf, Laurence A. Wolsey:
Modelling piecewise linear concave costs in a tree partitioning problem.
101-109
- Richard A. Brualdi, Hyung Chan Jung, William T. Trotter:
On the poset of all posets on n elements.
111-123
- Axel Conrad, Tanja Hindrichs, Hussein Morsy, Ingo Wegener:
Solution of the knight's Hamiltonian path problem on chessboards.
125-134
- Derek G. Corneil, Shigeru Masuyama, S. Louis Hakimi:
Edge-disjoint packings of graphs.
135-148
- Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks:
Guarding rectangular art galleries.
149-157
- M. Hasler, C. Marthy, A. Oberlin, Dominique de Werra:
A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits.
169-184
- Janny Leung, Jon Lee:
More facets from fences for linear ordering and acyclic subgraph polytopes.
185-200
- Gabriel Istrate:
Self-reading sequences.
201-203
Volume 50, Number 3, May 1994
- Djangir A. Babayev, Sahib S. Mardanov:
Sequential and simultaneous aggregation of diophantine equations.
209-220
- Panayotis N. Delivorias, Reinhard J. Richter:
Maximum path digraphs.
221-237
- Moshe Dror, Gilbert Laporte, Pierre Trudeau:
Vehicle routing with split deliveries.
239-254
- Alain Hertz, Brigitte Jaumard, Celso C. Ribeiro:
A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing.
255-265
- Sambhavi Lakshminarayanan, R. Chandrasekaran:
A rounding algorithm for integer programs.
267-282
- Tomomi Matsui, Akihisa Tamura, Yoshiko Ikebe:
Algorithms for finding a Kth best valued assignment.
283-296
- Jan Kratochvíl, Zsolt Tuza:
Algorithmic complexity of list colorings.
297-302
Last update Sat May 18 20:20:24 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
