| 349 | -- | 356 | Elarbi Choukhmane, John Franco. An approximation algorithm for the maximum independent set problem in cubic planar graphs |
| 357 | -- | 368 | Pierre Hansen, Jacques-François Thisse, Richard E. Wendell. Efficient points on a network |
| 369 | -- | 380 | Timothy B. Brecht, Charles J. Colbourn. Improving reliability bounds in computer networks |
| 381 | -- | 396 | Baruch Awerbuch, Shilmon Event. Reliable broadcast protocols in unreliable networks |
| 397 | -- | 409 | Karen W. Pullen. A random network model of message transmission |
| 411 | -- | 422 | Daniel Blenstock. An algorithm for reliability analysis of planar graphs |
| 423 | -- | 438 | Michael B. Richey, R. Gary Parker. On multiple steiner subgraph problems |
| 439 | -- | 440 | Okitsugu Fujiwara. Decision making, models and algorithms: A first course, by Saul I. Gass, John Wiley & Sons, New York, 1985, 412 pp |
| 440 | -- | 441 | James H. King. Or on the micro, by David Whitaker, John Wiley and Sons, New York, 1984, 197 pp. Price $19.95 |
| 441 | -- | 443 | Michael H. Schneider. Network flows and monotropic optimization, by R. T. Rockafellar, John Wiley & Sons, New York, 616 pp. Price $44.95 |
| 443 | -- | 444 | Warren H. Lieberman. Optimization models for planning and allocation: Text and cases in mathematical programming, by Roy D. Shapiro, John Wiley & Sons, New York, 1984, 650 pp. Price $40.95 |
| 444 | -- | 445 | John R. Current. Discrete computational structures, second edition, By Robert R. Korfhage, Academic Press, Inc., Orlando, FI, 1984, 360 pp. Price $35.00 |