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
Electronic Edition (link) BibTeX
- Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis:
Transmissions in a network with capacities and delays.
167-174
Electronic Edition (link) BibTeX
- Dan Trietsch, J. F. Weng:
Pseudo-Gilbert-Steiner trees.
175-178
Electronic Edition (link) BibTeX
- Bruno Beauquier:
All-to-all communication for some wavelength-routed all-optical networks.
179-187
Electronic Edition (link) BibTeX
- Bettina Klinz, Gerhard J. Woeginger:
A note on the bottleneck graph partition problem.
189-191
Electronic Edition (link) BibTeX
- Enrique Castillo, Ali S. Hadi, F. Jubete, Cristina Solares:
An expert system for coherent assessment of probabilities in multigraph models.
193-206
Electronic Edition (link) BibTeX
- Cécile Murat, Vangelis Th. Paschos:
The probabilistic longest path problem.
207-219
Electronic Edition (link) BibTeX
- 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
Electronic Edition (link) BibTeX
- Hajo Broersma, Erik Engbers, Huib Trommel:
Various results on the toughness of graphs.
233-238
Electronic Edition (link) BibTeX
- Ashish Tripathy, Haldun Süral, Yigal Gerchak:
Multidimensional assortment problem with an application.
239-245
Electronic Edition (link) BibTeX
Volume 33,
Number 4,
July 1999
Special Issue:
DIMACS Workshop on Switching Networks
Copyright © Sun May 17 00:15:21 2009
by Michael Ley (ley@uni-trier.de)
