On Implementing the Push—Relabel Method for the Maximum Flow Problem B. V. CherkasskyA. V. Goldberg Pages: 390 - 410
A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound Shun-Shii LinKwei-Jay Lin Pages: 411 - 426
On Triangulating Planar Graphs under the Four-Connectivity Constraint T. BiedlG. KantM. Kaufmann Pages: 427 - 446
On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees G. DasS. KapoorM. Smid Pages: 447 - 462
