Flow in planar graphs with vertex capacities Samir KhullerJoseph (Seffi) Naor OriginalPaper Pages: 200 - 225
Tight bounds on the number of minimum-mean cycle cancellations and related results Tomasz RadzikAndrew V. Goldberg OriginalPaper Pages: 226 - 242
A new scaling algorithm for the maximum mean cut problem Kazuo IwanoShinji MisonoSatoru Fujishige OriginalPaper Pages: 243 - 255
Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs Yaron PintoRon Shamir OriginalPaper Pages: 256 - 277
Algorithms and complexity analysis for some flow problems Edith CohenNimrod Megiddo OriginalPaper Pages: 320 - 340
