Families of cuts with the MFMC-property. - Alexander V. Karzanov (Comb., 1985)

Metrics and undirected cuts. - Alexander V. Karzanov (Math. Program., 1985)

Half-integral five-terminus flows. - Alexander V. Karzanov (Discret. Appl. Math., 1987)

Packings of cuts realizing distances between certain vertices in a planar graph. - Alexander V. Karzanov (Discret. Math., 1990)

Sums of Cuts and Bipartite Metrics. - Alexander V. Karzanov (Eur. J. Comb., 1990)

On Multiflow Problems. - András Frank; Alexander V. Karzanov; András Sebö (IPCO, 1992)

Cyclical games with prohibitions. - Alexander V. Karzanov; Vasilij N. Lebedev (Math. Program., 1993)

Paths and Metrics in a Planar Graph with Three or More Holes. I. Metrics. - Alexander V. Karzanov (J. Comb. Theory B, 1994)

Paths and Metrics in a Planar Graph with Three or More Holes. II. Paths. - Alexander V. Karzanov (J. Comb. Theory B, 1994)

Minimum cost multiflows in undirected networks. - Alexander V. Karzanov (Math. Program., 1994)

Maximum Skew-Symmetric Flows. - Andrew V. Goldberg; Alexander V. Karzanov (ESA, 1995)

Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. - Alexander V. Karzanov; S. Thomas McCormick (SODA, 1995)

Half-integral Flows in a Planar Graph with Four Holes. - Alexander V. Karzanov (Discret. Appl. Math., 1995)

Path Problems in Skew-Symmetric Graphs. - Andrew V. Goldberg; Alexander V. Karzanov (Comb., 1996)

Minimum (2, r)-Metrics and Integer Multiflows. - Alexander V. Karzanov; Yannis Manoussakis (Eur. J. Comb., 1996)

How to Tidy up a General Set-System by Use of Uncrossing Operations. - Alexander V. Karzanov (Theor. Comput. Sci., 1996)

Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. - Andrew V. Goldberg; Alexander V. Karzanov (Math. Oper. Res., 1997)

Multiflows and disjoint paths of minimum total cost. - Alexander V. Karzanov (Math. Program., 1997)

Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. - Alexander V. Karzanov; S. Thomas McCormick (SIAM J. Comput., 1997)

On Integer Multiflow Maximization. - András Frank; Alexander V. Karzanov; András Sebö (SIAM J. Discret. Math., 1997)

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. - Toshihide Ibaraki; Alexander V. Karzanov; Hiroshi Nagamochi (Comb., 1998)

A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations. - Alexander V. Karzanov (Comb., 1998)

Minimum weight (T, d)-joins and multi-joins. - Michel Burlet; Alexander V. Karzanov (Discret. Math., 1998)

On one maximum multiflow problem and related metrics. - Alexander V. Karzanov (Discret. Math., 1998)

Minimum 0-Extensions of Graph Metrics. - Alexander V. Karzanov (Eur. J. Comb., 1998)

A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. - Evripidis Bampis; Alexander V. Karzanov; Yannis Manoussakis; Ioannis Milis (Parallel Process. Lett., 1998)

A Characterization of Minimizable Metrics in the Multifacility Location Problem. - Hans-Jürgen Bandelt; Victor Chepoi; Alexander V. Karzanov (Eur. J. Comb., 2000)

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. - Evripidis Bampis; Aristotelis Giannakos; Alexander V. Karzanov; Yannis Manoussakis; Ioannis Milis (RAIRO Theor. Informatics Appl., 2000)

Integer Concave Cocirculations and Honeycombs. - Alexander V. Karzanov (IPCO, 2004)

Hard cases of the multifacility location problem. - Alexander V. Karzanov (Discret. Appl. Math., 2004)

One more well-solved case of the multifacility location problem. - Alexander V. Karzanov (Discret. Optim., 2004)

Maximum skew-symmetric flows and matchings. - Andrew V. Goldberg; Alexander V. Karzanov (Math. Program., 2004)

Discrete strip-concave functions, Gelfand-Tsetlin patterns, and related polyhedra. - Vladimir I. Danilov; Alexander V. Karzanov; Gleb A. Koshevoy (J. Comb. Theory A, 2005)

Free multiflows in bidirected and skew-symmetric graphs. - Maxim A. Babenko; Alexander V. Karzanov (Discret. Appl. Math., 2007)

A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. - Maxim A. Babenko; Alexander V. Karzanov (ESA, 2008)

Minimum mean cycle problem in bidirected and skew-symmetric graphs. - Maxim A. Babenko; Alexander V. Karzanov (Discret. Optim., 2009)

B2-crystals: Axioms, structure, models. - Vladimir I. Danilov; Alexander V. Karzanov; Gleb A. Koshevoy (J. Comb. Theory A, 2009)

On Weighted Multicommodity Flows in Directed Networks - Maxim A. Babenko; Alexander V. Karzanov (CoRR, 2012)

Condorcet domains of tiling type. - Vladimir I. Danilov; Alexander V. Karzanov; Gleb A. Koshevoy (Discret. Appl. Math., 2012)

Min-cost multiflows in node-capacitated undirected networks. - Maxim A. Babenko; Alexander V. Karzanov (J. Comb. Optim., 2012)

A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. - Maxim A. Babenko; Alexander V. Karzanov (CSR, 2015)

An efficient algorithm for packing cuts and (2, 3)-metrics in a planar graph with three holes. - Alexander V. Karzanov (Discret. Optim., 2019)

Majority rule on rhombus tilings and Condorcet super-domains. - Vladimir I. Danilov; Alexander V. Karzanov; Gleb A. Koshevoy (Discret. Appl. Math., 2021)

The weak separation in higher dimensions. - Vladimir I. Danilov; Alexander V. Karzanov; Gleb A. Koshevoy (J. Comb. Theory A, 2021)

Erratum to "B2-crystals: Axioms, structure, models" [J. Comb. Theory, Ser. A 116 (2009) 265-289]. - Vladimir I. Danilov; Alexander V. Karzanov; Gleb A. Koshevoy (J. Comb. Theory A, 2021)

On stable assignments generated by choice functions of mixed type. - Alexander V. Karzanov (Discret. Appl. Math., 2024)