Volume 39,
Number 1,
January 2002
Volume 39,
Number 2,
March 2002
Volume 39,
Number 3,
May 2002
- Michael J. Dinneen, Geoffrey Pritchard, Mark C. Wilson:
Degree- and time-constrained broadcast networks.
121-129
Electronic Edition (link) BibTeX
- Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang:
Light graphs with small routing cost.
130-138
Electronic Edition (link) BibTeX
- Richard L. Francis, Timothy J. Lowe, Arie Tamir:
Worst-case incremental analysis for a class of p-facility location problems.
139-143
Electronic Edition (link) BibTeX
- Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, J. David Kirkpatrick, Michael Segal:
Efficient algorithms for centers and medians in interval and circular-arc graphs.
144-152
Electronic Edition (link) BibTeX
- Camino Balbuena, Josep Fàbrega, Xavier Marcote, Ignacio M. Pelayo:
Superconnected digraphs and graphs with small conditional diameters.
153-160
Electronic Edition (link) BibTeX
- Matteo Fischetti, Giuseppe Lancia, Paolo Serafini:
Exact algorithms for minimum routing cost trees.
161-173
Electronic Edition (link) BibTeX
Volume 39,
Number 4,
July 2002
- Andrés Cano, Serafín Moral, Antonio Salmerón:
Lazy evaluation in penniless propagation over join trees.
175-185
Electronic Edition (link) BibTeX
- Marcus Brazil, D. A. Thomas, J. F. Weng:
Forbidden subpaths for Steiner minimum networks in uniform orientation metrics.
186-202
Electronic Edition (link) BibTeX
- Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki:
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.
203-209
Electronic Edition (link) BibTeX
- Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Vahab S. Mirrokni:
Length-constrained path-matchings in graphs.
210-215
Electronic Edition (link) BibTeX
- Mikael Prytz, Anders Forsgre:
Dimensioning multicast-enabled communications networks.
216-231
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:15:22 2009
by Michael Ley (ley@uni-trier.de)