Bhandari, R. (1994). Optimal diverse routing in telecommunication fiber networks. Proceedings of IEEE Infocom, pp. 1498–1508.
Chvátal, V. (1975). On certain polytopes associated with graphs. Journal of Combinatorial Theory, Series B, 18:138–154.
Cook, W., Cunningham, W., Pulleyblank, W., and Schrijver, A. (1998). Combinatorial Optimization. Wiley-Interscience, New York.
Cui, W. and Fujishige, S. (1998). A primal algorithm for the submodular flow problem with minimum-mean cycle selection. Journal of the Operations Research Society of Japan, 31:431–440.
Cunningham, W. and Frank, A. (1985). A primal-dual algorithm for submodular flows. Mathematics of Operations Research, 10(2):251–261.
Edmonds, J. (1973). Edge-disjoint branchings. In: R. Rustin (ed.), Combinatorial Algorithms, pp. 91–86, Alg. Press, New York.
Edmonds, J. and Giles, R. (1977). A min-max relation for submodular functions on graphs. Annals of Discrete Mathematics, 1:185–204.
Frank, A. (1981). How to make a, digraph strongly connected. Combinatorica, 1:145–153.
Frank, A., Király, T., and Király, Z. (2001). On the Orientation of Graphs and Hypergraphs. Technical Report TR-2001-06 of the Egerváry Research Group, Budapest, Hungary.
Feofiloff, P. and Younger, D. (1987). Directed cut transversal packing for source-sink connected graphs. Combinatorica, 7:255–263.
Fleischer, L. and Iwata, S. (2000). Improved algorithms for submodular function minimization and submodular flow. STOC, 107–116.
Fujishige, S. (1978). Algorithms for solving the independent flow problem. Journal of the Operations Research Society of Japan, 21(2):189–204.
Fujishige, S. (1991). Submodular functions and optimization. Annals of Discrete Mathematics, 47, Monograph, North Holland Press, Amsterdam.
Gabow, H. (1995). Centroids, representations, and submodular flows. Journal of Algorithms, 18:586–628.
Iwata, S., Fleischer, L., and Fujishige, S. (2001). A combinatorial strongly polynomial time algorithm for minimizing submodular functions. Journal of the ACM, 48(4):761–777.
Iwata, S., McCormick, S., and Shigeno, M. (2003). Fast cycle canceling algorithms for minimum cost submodular flow. Combinatorica, 23:503–525.
Jain, K. (2001). A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica, 21(1):39–60.
Karzanov, A.V. (1979). On the minimal number of arcs of a digraph meeting all its directed cutsets. Abstract in Graph Theory Newsletter, 8.
Khanna, S., Naor, S., and Shepherd, F.B. (1999). Directed network design problems with orientation constraints. SODA, 663–671.
Klein, M. (1967). A primal method for minimal cost flows. Management Science, 14:205–220.
Lee O. and Wakabayashi, Y. (2001). Note on a min-max conjecture of Woodall. Journal of Graph Theory, 14:36–41.
Lehman, A. (1990). Width-length inequality and degenerate projective planes. In: P.D. Seymour and W. Cook (eds.), Polyhedral Combinatorics, pp. 101–106, Proceedings of the DIMACS Workshop, Morristown, New Jersey, June 1989. American Mathematical Society.
Lovász, L. (1976). On two minmax theorems in graphs. Journal of Combinatorial Theory, Series B, 21:96–103.
Lucchesi, C. (1976). A Minimax Equality for Directed Graphs. Ph.D. thesis, University of Waterloo.
Lucchesi, C. and Younger, D. (1978). A minimax theorem for directed graphs. Journal of the London Mathematical Society, 17:369–374.
McWhirter, I. and Younger, D. (1971). Strong covering of a bipartite graph. Journal of the London Mathematical Society, 3:86–90.
Melkonian, V. and Tardos, É. (1999). Approximation algorithms for a directed network design problem. IPCO, 345–360.
Pulleyblank, W.R. (1994). Personal cominunication.
Schrijver, A. (1980). A counterexample to a conjecture of Edmonds and Giles. Discrete Mathematics, 32:213–214.
Schrijver, A. (1982). Min-max relations for directed graphs. Annals of Discrete Mathematics, 16:261–280.
Schrijver, A. (2000). A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80:346–355.
Schrijver, A. Combinatorial Optimization: Polyhedra and Efficiency. Springer Verlag, Berlin.
Wallacher, C. and Zimmermann, U. (1999). A polynomial cycle canceling algorithm for submodular flows. Mathematical Programming, Series A, 86(1):1–15.
Williamson, D., Goemans, M., Mihail, M., and Vazirani, V. (1995). A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica, 15:435–454.
Younger, D. (1963). Feedback in a directed graph. Ph.D. thesis, Columbia University.
Younger, D. (1969). Maximum families of disjoint directed cuts. In: Recent Progress in Combinatorics, pp. 329–333, Academic Press, New York.
Zimmermann, U. (1982). Minimization on submodular flows. Discrete Applied Mathematics, 4:303–323.