default search action
Discrete Applied Mathematics, Volume 50
Volume 50, Number 1, April 1994
- Francine Blanchet-Sadri:
On a complete set of generators for dot-depth two. 1-25 - Colin Cooper:
Probabilistic analysis of two k-cluster problems. 27-51 - Joachim Rosenmüller, Peter Sudhölter:
The nucleolus of homogeneous games with steps. 53-76 - Uwe T. Zimmermann:
On the complexity of the dual method for maximum balanced flows. 77-88 - David C. Fisher, Jennifer Ryan, Gayla S. Domke, Aniket Majumdar:
Fractional domination of strong direct products. 89-91 - Frank K. Hwang, Uriel G. Rothblum:
Constrained partitioning problems. 93-96
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 - Dietmar Dorninger:
Hamiltonian circuits determining the order of chromosomes. 159-168 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.