A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem Ravindra K. AhujaDorit S. HochbaumJames B. Orlin OriginalPaper 25 February 2004 Pages: 189 - 208
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem Petr KolmanChristian Scheideler OriginalPaper 15 March 2004 Pages: 209 - 233
Minimising the Number of Bends and Volume in 3-Dimensional Orthogonal Graph Drawings with a Diagonal Vertex Layout David R. Wood OriginalPaper 19 March 2004 Pages: 235 - 253
Solving Systems of Difference Constraints Incrementally with Bidirectional Search Jianjun ZhouMartin Müller OriginalPaper 25 February 2004 Pages: 255 - 274
