1. C. Bentz, M.-C. Costa, F. Roupin, Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs, Journal of Discrete Algorithms, in press.
2. U. Brandes, G. Neyer, D. Wagner, Edge-disjoint paths in planar graphs with minimum total length, Technical Report, Konstanzer Schriften in Mathematik und Informatik 19, Universität Konstanz, 1996, 11p.
3. Efficient algorithms for finding the maximum number of disjoint paths in grids;Chan;Journal of Algorithms,2000
4. Bounds and heuristics for the shortest capacited paths problem;Costa;Journal of Heuristics,2002
5. Routing through a dense channel with minimum total wire length;Formann;Journal of Algorithms,1993