Volume 33, Number 1, January 1999
Volume 33, Number 2, March 1999
Volume 33, Number 3, May 1999
- Weizhen Gu:
On diameter of permutation graphs.
161-166

- Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis:
Transmissions in a network with capacities and delays.
167-174

- Dan Trietsch, J. F. Weng:
Pseudo-Gilbert-Steiner trees.
175-178

- Bruno Beauquier:
All-to-all communication for some wavelength-routed all-optical networks.
179-187

- Bettina Klinz, Gerhard J. Woeginger:
A note on the bottleneck graph partition problem.
189-191

- Enrique F. Castillo, Ali S. Hadi, F. Jubete, Cristina Solares:
An expert system for coherent assessment of probabilities in multigraph models.
193-206

- Cécile Murat, Vangelis Th. Paschos:
The probabilistic longest path problem.
207-219

- Yu-Chee Tseng, Yuh-Shyan Chen, Tong-Ying Juang, Chiou-Jyu Chang:
Congestion-free, dilation-2 embedding of complete binary trees into star graphs.
221-231

- Hajo Broersma, Erik Engbers, Huib Trommel:
Various results on the toughness of graphs.
233-238

- Ashish Tripathy, Haldun Süral, Yigal Gerchak:
Multidimensional assortment problem with an application.
239-245

Volume 33, Number 4, July 1999
Special Issue:
DIMACS Workshop on Switching Networks
Last update Thu May 23 19:18:56 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page