Volume 89,
Number 1-3,
December 1998
- Gérard Cornuéjols, William R. Pulleyblank:
Foreword.
1-2
- Egon Balas:
Disjunctive Programming: Properties of the Convex Hull of Feasible Points.
3-44
- Luitpold Babel:
Triangulating Graphs with Few P4's.
45-57
- Andreas Brandstädt, Van Bang Le, Thomas Szymczak:
The Complexity of some Problems Related to Graph 3-colorability.
59-73
- Helen Cameron:
Fringe Thickness and Maximum Path Length of Binary Trees.
75-97
- Krzysztof Ciebiera, Adam Malinowski:
Efficient Broadcasting with Linearly Bounded Faults.
99-105
- José Gómez, Carles Padró, Stephane Perennes:
Large Generalized Cycles.
107-123
- Nili Guttmann-Beck, Refael Hassin:
Approximation Algorithms for Min-sum p-clustering.
125-142
- David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan:
Partial and Perfect Path Covers of Cographs.
143-153
- P. Sreenivasa Kumar, C. E. Veni Madhavan:
Minimal Vertex Separators of Chordal Graphs.
155-168
- Burkhard Lenze:
Linking Discrete Orthogonality with Dilation and Translation for Incomplete Sigma-pi Neural Networks of Hopfield-type.
169-180
- Horst Martini, Anita Schöbel:
Median Hyperplanes in Normed Spaces - A Survey.
181-195
- David Pisinger:
A Fast Algorithm for Strongly Correlated Knapsack Problems.
197-212
- Wim F. J. Verhaegh, Paul E. R. Lippens, Emile H. L. Aarts, Jef L. van Meerbergen, Albert van der Werf:
The Complexity of Multidimensional Periodic Scheduling.
213-242
- S. S. Yu:
d-minimal Languages.
243-262
- Alain Hertz:
On Perfect Switching Classes.
263-267
- Shutao Xia, Fangwei Fu:
On the Average Hamming Distance for Binary Codes.
269-276
- Jing Huang:
A Note on Spanning Local Tournaments in Locally Semicomplete Digraphs.
277-279
- Ming Ouyang:
How Good Are Branching Rules in DPLL?
281-286
Copyright © Tue Dec 1 16:30:31 2009
by Michael Ley (ley@uni-trier.de)