Volume 37, Number 1, January 2001
: Adaptive least-expected time paths in stochastic, time-varying transportation and data networks.
: Cooperative triangulation in MSBNs without revealing subnet structures.
Volume 37, Number 2, March 2001
, S. P. Hill
: A branch and cut method for the degree-constrained minimum spanning tree problem.
Volume 37, Number 3, May 2001
Volume 37, Number 4, July 2001
Dorit S. Hochbaum
: A new - old algorithm for minimum-cut and maximum-flow in closure graphs.
: Stability of networks and protocols in the adversarial queueing model for packet routing.