Cut packings:

• A.V. Karzanov, An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes,  Discrete Optimization, 33, 2019, pp. 118-139. [PDF]
• A.V. Karzanov, An algorithm for determining a maximum packing of odd-terminus cuts and its applications, American Math. Soc. Transl., Ser. 2, 158, 1994, 57-70.[PDF]
• A.V. Karzanov, Sums of cuts and bipartite metrics, European Journal of Combinatorics, 11, 1990, 473-484. [PDF]
• A.V. Karzanov, Packing of cuts realizing distances between certain vertices of a planar graph, Discrete Mathematics, 85, 1990, 73-87. [PDF]
• A.V. Karzanov, Algoritm maksimal'noǐ upakovki nechetnopolyusnykh razrezov i ego prilozheniya, In: Isslidovaniya po Prikladnoǐ Teorii Grafov (A.S. Alekseev, ed.), Nauka Siberian Dept., Novosibirsk, 1986, pp.126-140, in Russian. (Title transl.: An algorithm for a maximum packing of odd-terminal cuts and its applications, in: Studies in Applied Graph Theory.) [PDF]
• A.V. Karzanov, Families of cuts with the MFMC-property, Combinatorica, 5, No.4, 1985, 325-335. [PDF]
• A.V. Karzanov, Metrics and undirected cuts, Mathematical Programming, 35, 1985, 183-198. [PDF]
• A.V. Karzanov, A generalized MFMC-prorerty and multicommodity cut problems, in: Finite and Infinite Sets (Proc. of 6th Hungarian Combinatorial Colloquium, Eger, 1981), Vol.2, North-Holland, Amsterdam, 1984, pp.443-486. [PDF]

Preprints, technical reports and extended abstracts:

• A.V. Karzanov, Zadachi o mul'tirazrezakh i metody ikh resheniya, Preprint, Inst. for System Studies (VNIISI) Press, Moscow, 1982, 62pp., in Russian. (Title transl.: Problems on multi-cuts and methods to solve them.)  [PDF]