Flows and multiflows:

• M.A. Babenko and A.V. Karzanov, A combinatorial algorithm for the planar multiflow problem with demands located on three holes, In: Computer Science – Theory and Applications (10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015, Proceedings), Lecture  Notes in Computer Sci. 9139 (2015), pp. 53–66 [PDF]
• M.A. Babenko and A.V. Karzanov, Min-cost multiflows in node-capacitated undirected networks,  J. of Combinatorial Optimization, 24, No.3, 2012, pp.202-228. (Draft in ArXiv:1001.0125v2[math.CO].) [PDF]. (See also [jour])
• A.V. Karzanov, On one maximum multiflow problem and related metrics, Discrete Mathematics, 192, 1998, 187-204. [PDF]
• T. Ibaraki, A.V. Karzanov, and H. Nagamochi, A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations, Combinatorica, 18, No.1, 1998, 61-83 [PDF]. (See also [jour])
• A.V. Karzanov, Multiflows and disjoint paths of minimum total cost, Mathematical Programming, 78, 1997, 219-242. [PDF,pdf] (See also [jour])
• A. Frank, A.V. Karzanov, and A. Sebő, On integer multiflow maximization, SIAM Journal on Discrete Mathematics, 10, No.1, 1997, 158-170. [jour]
• A.V. Goldberg and A.V. Karzanov, Scaling methods for finding a maximum free multiflow of minimum cost, Mathematics of Operations Research, 22, No.1, 1997, 90-109. [PDF]
• A.V. Karzanov and Y. Manoussakis, Minimum (2,r)-metrics and integer multiflows, European Journal of Combinatorics, 17, 1996, 223-232.  [PDF]
• A.V. Karzanov, Half-integral flows in a planar graph with four holes, Discrete Applied Mathematics, 56, No.2-3, 1995, 267-295. [PDF]
• A.V. Karzanov, Maximum- and minimum-cost multicommodity flow problems having unbounded fractionality, American Math. Soc. Transl., Ser. 2, 158, 1994, 71-80. [PDF]
• A.V. Karzanov, On a class of maximum multicommodity flow problems with integer optimal solutions, American Math. Soc. Transl., Ser. 2, 158, 1994, 81-99. [PDF]
• A.V. Karzanov, Minimum cost multiflows in undirected networks, Mathematical Programming, 66, No.3, 1994, 313-325. [PDF,pdf] (See also [jour])
• A.V. Karzanov, Paths and metrics in a planar graph with three or more holes, Part II: Paths, J. of Combinatorial Theory, Ser.B, 60, 1994, 19-35. [PDF]
• A.V. Karzanov, Paths and metrics in a planar graph with three or more holes, Part I: Metrics, J. of Combinatorial Theory, Ser.B, 60, 1994, 1-18. [PDF]
• A.V. Karzanov, Undirected multiflow problems and related topics - some recent developments and results, Proc. of the International Congress of Mathematicians (Kyoto, 1990), Springer, Tokyo, 1991, pp.1561-1571. [PDF]
• A.V. Karzanov, Polyhedra related to undirected multicommodity flows, Linear Algebra and its Appl., 114-115, 1989, 293-328. [PDF]
• A.V. Karzanov, Maksimal'nye i stoimostnye mnogoproduktovye potoki neogranichennoǐ drobnosti, In: Zadachi Diskrentoǐ Optimizatsii i Metody ikh Resheniya (A.A. Fridman, ed.), Central Institute  of Economics and Mathematics (CEMI) Press, Moscow, 1987, pp.123-135, in Russian. (Title transl.: Maximum and min-cost multicommodity flows of unbounded fractionality, In: Problems in Discrete Optimization and Methods for Their Solution). [PDF]
• A.V. Karzanov, Odin klass zadach o maksimal'nykh mnogoproduktovykh potokakh s tselochislennymi optimal'nymi resheniyami, In: Modelirovanie i Optimizatsiya Sistem Slozhnoǐ Struktury (G.Sh. Fridman, ed.), Omsk State Univ. Press, Omsk, 1987, pp.103-121, in Russian. (Title transl.: One class of maximum multicommodity flows problems with integer optimal solutions, In: Modelling and Optimization of Systems of Complex Structure.) [PDF]
• A.V. Karzanov, Half-integral five-terminus flows, Discrete Applied Mathematics, 18, No.3, 1987, 263-278. [PDF]
• A.V. Karzanov, O mnogoproduktovykh potokovykh zadachakh s tselochislennymi optimal'nymi resheniyami, Doklady Akademii Nauk SSSR, 280, No.4, 1985, 789-792, in Russian. (Title transl.: On multicommodity flow problems with integer-valued optimal solutions, in Russian. [PDF] (English translation in Soviet Math. Dokl., 31, No.1, 1985, 151-154. [engl])
• A.V. Karzanov, Semeǐstva tsepeǐ s MFMC-svoǐstvom, In: Modeli i Algoritmy Issledovaniya Operatsiǐ i ikh Primenenie k Organizatsii Rabot v Vychislitel'nykh Sistemakh, Yaroslavl State Univ. Press, Yaroslavl, 1984, pp.80-84, in Russian. (Title transl.: Families of chains with the MFMC-property, In: Models and Algorithms of Operations Research and their Application to Organizing Works in Computing Systems.) [PDF]
• A.V. Karzanov, Kombinatornye sposoby resheniya razreznykh zadach o mul'tipotokakh, In.: Kombinatornye Methody v Potokovykh Zadachakh, Inst. for System Studies (VNIISI) Press, Moscow, 1979, Issue 3, pp.6-69, in Russian. (Title transl.: Combinatorial methods for solving cut-dependent problems on multiflows, In: Combinatorial Methods for Flow Problems.) [PDF]
• A.V. Karzanov and P.A. Pevzner, Opisanie klassa nerazreznykh zadach o mul'tipotokakh maksimal'noǐ moshchnosti, In.: Kombinatornye Methody v Potokovykh Zadachakh, Inst. for System Studies (VNIISI) Press, Moscow, 1979, Issue 3, pp.70-81, in Russian. (Title transl.: A description of the class of non-cut-dependent problems on maximum multiflows, In: Combinatorial  Methods for Flow Problems.) [PDF]
• A.V. Karzanov, Èkonomnye metody resheniya dvykh izvestnykh zadach o mul'tipotokakh v neorientirovannykh setyakh, In.: Kombinatornye Methody v Potokovykh Zadachakh, Inst. for System Studies (VNIISI) Press, Moscow, 1979, Issue 3, pp.96-103, in Russian. (Title transl.: Fast methods for solving two known problems on multiflows in undirected networks, In: Combinatorial Methods for Flow Problems.) [PDF]
• E.A. Dinitz and A.V. Karzanov, Tselochislennaya zadacha o dvukh potokakh edinichnoǐ moshchnosti, In.: Kombinatornye Methody v Potokovykh Zadachakh, Inst. for System Studies (VNIISI) Press, Moscow, 1979, Issue 3, pp.127-137, in Russian. (Title transl.: The integer problem on two flows with unit values, In: Combinatorial Methods for Flow Problems.) [PDF]
• A.V. Karzanov, Zadacha o maksimal'nom myl'tipotoke minimal'noǐ stoimosti, In.: Kombinatornye Methody v Potokovykh Zadachakh, Inst. for System Studies (VNIISI) Press, Moscow, 1979, Issue 3, pp.138-156, in Russian. (Title transl.: The problem on a maximum multiflow of minimum cost, In: Combinatorial Methods for Flow Problems.) [PDF]
• A.V. Karzanov and M.V. Lomonosov, Sistemy potokov v neorientirovannykh setykh, In.: Mathematicheskoe Programmirovanie i dr. (O.I. Larichev, ed.), Inst. for System Studies (VNIISI) Press, Moscow, 1978, Issue1, pp.59-66, in Russian. (Title transl.: Systems of flows in undirected networks, In: Mathematical Programming, and etc.) [PDF]
• A.V. Karzanov, Èkonomnyǐ algoritm nakhozhdeniya maksimal'nogo potoka v seti, Èkonomika i Matematicheskie Metody, 11, No.4, 1975, 723-729, in Russian. (Title transl.: A fast algorithm for finding a maximum flow in a network.) [PDF]
• G.M. Adelson-Velsky, E.A. Dinitz, and A.V. Karzanov, Potokovye Algoritmy, Nauka, Moscow, 1975, in Russian. (Title transl.: Flow Algorithms.) (For a review, see [rev])
• A.V. Karzanov, Nakhozhdenie maksimal'nogo potoka v seti metodom predpotokov, Doklady Akademii Nauk SSSR, 215, No.1, 1974, 49-52, in Russian [PDF] (English translation: Determining a maximal flow in a network by the method of preflows, Soviet Math. Dokl., 15, No.2, 1974, 434-437. [Engl])
• A.V. Karzanov, Algoritmy resheniya zadach, svodyashchikhsya k potokovym, i otsenki ikh trudoemkosti, Avtoreferat dissertatsii, Central Institute of Economics and Mathematics (CEMI) Press, Moscow, 1973, 15pp., in Russian.  (Title transl.: Algorithms for solving problems reducible to flow ones and their complexity bounds, Syponsis of Ph.D. Thesis.) [PDF]
• A.V. Karzanov, O nakhozhdenii maksimal'nogo potoka v setyakh spetsial'nogo vida i nekotorykh prilozheniyakh, In: Matematicheskie Voprosy Upravleniya Proizvodstvom (L.A. Lyusternik, ed.), Moscow State Univ. Press, Moscow, 1973, Issue 5, pp.81-94, in Russian [PDF]. (Title transl.: On finding a maximum flow in a network with special structure and some applications, In: Mathematical Issues of Production Control [engl])
• A.V. Karzanov, Tochnaya otsenka algoritma nakhozhdeniya maksimal'nogo potoka, primenennogo k zadache "o predstavitelyakh", In: Voprosy Kibernetiki. Trudy Seminara po Kombinatornoǐ Matematike (Moscow, 1971), Sovetskoe Radio, Moscow, 1973, pp.66-70, in Russian. [PDF]. (Title transl.: An exact estimate of an algorithm for finding a maximum flow, applied to the problem "on representatives", In: Issues of Cybernetics. Proc. of the Seminar on Combinatorial Mathematics. [engl]) 

Preprints, technical reports and extended abstracts:

• M.A. Babenko and A.V. Karzanov, On weighted multicommodity flows in directed networks, Report  No.121053, Forshunginstitut f\"ur Diskrete Mathematik, Bonn, 2012, 12pp. (See also ArXiv:1212.0224[math.CO], 2012. [PDF] )
• M.A. Babenko and A.V. Karzanov, A scaling algorithm for the maximum node-capacitated multiflow problem, In: Algorithms' ESA-2008 (Proc. of 16th Annual European Symp. on Algorithms) (D. Halperin and K. Mehlhorn, eds.), Lecture Notes on Computer Sci., 5193, 2008, pp.124-135. [jour]
  
• T. Ibaraki, A.V. Karzanov, and H. Nagamochi, A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations, Technical Report #97002, Kyoto Univ., Kyoto, 1997, 23pp. [PDF]
• A.V. Karzanov and Y. Manoussakis, Minimum (2,r)-metrics, graph partitions and multiflows, Rapport de Recherche 958, LRI, Université de Paris Sud, Orsay, 1995, 16pp. [PDF]
• A.V. Karzanov, Multiflows and disjoint paths of minimum total cost, Rapport de Recherche 951, LRI, Université de Paris Sud, Orsay, 1995, 31pp. [PDF]
• A.V. Karzanov, Half-integral flows in a planar graph with four holes, DIMACS Technical Report 93-44, 1993, 34pp. [PDF]
• A.V. Goldberg and A.V. Karzanov, Transitive fork environments and minimum cost multiflows, Technical Report STAN-CS-93-1476, Computer Sci. Dept., Stanford Univ., Palo Alto, 1993, 44pp. [PDF]
  
• A.V. Karzanov, Edge-disjoint T-paths of minimum total cost, Technical Report STAN-CS-92-1465, Computer Sci. Dept., Stanford Univ., Palo Alto, 1993, 66pp. [PDF]
  
• A. Frank, A.V. Karzanov, and A. Sebő, On multiflow problems, In: Integer Programming and Combinatorial Optimization, Carnegie Mellon Univ. Publ., Pittsburg, 1992, pp.85-101. (Also in:  Rapport de Recherche RR 889-M, Artemis, IMAG, Grenoble, 1992, 19pp. [PDF])
• A.V. Karzanov, Minimum cost multiflows in undirected networks, Rapport de Recherche RR 849-M, Artemis, IMAG, Grenoble, 1991, 22pp. [PDF]