Alexander V. Karzanov - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2021

Majority rule on rhombus tilings and Condorcet super-domainsVladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy. DAM, 292:85-96, 2021. [doi]

2-crystals: Axioms, structure, models" [J. Comb. Theory, Ser. A 116 (2009) 265-289]Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy. jcta, 180:105417, 2021. [doi]

The weak separation in higher dimensionsVladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy. jcta, 180:105392, 2021. [doi]

2019

An efficient algorithm for packing cuts and (2, 3)-metrics in a planar graph with three holesAlexander V. Karzanov. disopt, 33:118-139, 2019. [doi]

2015

A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three HolesMaxim A. Babenko, Alexander V. Karzanov. csr 2015: 53-66 [doi]

2012

Min-cost multiflows in node-capacitated undirected networksMaxim A. Babenko, Alexander V. Karzanov. jco, 24(3):202-228, 2012. [doi]

Condorcet domains of tiling typeVladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy. DAM, 160(7-8):933-940, 2012. [doi]

2009

Minimum mean cycle problem in bidirected and skew-symmetric graphsMaxim A. Babenko, Alexander V. Karzanov. disopt, 6(1):92-97, 2009. [doi]

B::2::-crystals: Axioms, structure, modelsVladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy. JCT, 116(2):265-289, 2009. [doi]

2008

A Scaling Algorithm for the Maximum Node-Capacitated Multiflow ProblemMaxim A. Babenko, Alexander V. Karzanov. esa 2008: 124-135 [doi]

2007

Free multiflows in bidirected and skew-symmetric graphsMaxim A. Babenko, Alexander V. Karzanov. DAM, 155(13):1715-1730, 2007. [doi]

2005

Discrete strip-concave functions, Gelfand-Tsetlin patterns, and related polyhedraVladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy. JCT, 112(2):175-193, 2005. [doi]

2004

Maximum skew-symmetric flows and matchingsAndrew V. Goldberg, Alexander V. Karzanov. mp, 100(3):537-568, 2004. [doi]

Integer Concave Cocirculations and HoneycombsAlexander V. Karzanov. ipco 2004: 368-387 [doi]

Hard cases of the multifacility location problemAlexander V. Karzanov. DAM, 143(1-3):368-373, 2004. [doi]

One more well-solved case of the multifacility location problemAlexander V. Karzanov. disopt, 1(1):51-66, 2004. [doi]

2000

Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite CasesEvripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis. ita, 34(2):87-98, 2000.

A Characterization of Minimizable Metrics in the Multifacility Location ProblemHans-Jürgen Bandelt, Victor Chepoi, Alexander V. Karzanov. ejc, 21(6):715-725, 2000. [doi]

1998

A Parallel Algorithm for Finding a Perfect Matching in a Planar GraphEvripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis. ppl, 8(3):399-405, 1998.

Minimum weight (T, d)-joins and multi-joinsMichel Burlet, Alexander V. Karzanov. DM, 181(1-3):65-76, 1998. [doi]

A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some GeneralizationsToshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi. combinatorica, 18(1):61-83, 1998. [doi]

On one maximum multiflow problem and related metricsAlexander V. Karzanov. DM, 192(1-3):187-204, 1998. [doi]

A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some GeneralizationsAlexander V. Karzanov. combinatorica, 18(4):549-568, 1998. [doi]

Minimum 0-Extensions of Graph MetricsAlexander V. Karzanov. ejc, 19(1):71-101, 1998. [doi]

1997

On Integer Multiflow MaximizationAndrás Frank, Alexander V. Karzanov, András Sebö. siamdm, 10(1):158-170, 1997. [doi]

Scaling Methods for Finding a Maximum Free Multiflow of Minimum CostAndrew V. Goldberg, Alexander V. Karzanov. mor, 22(1):90-109, 1997. [doi]

Multiflows and disjoint paths of minimum total costAlexander V. Karzanov. mp, 77:219-242, 1997.

Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with ApplicationsAlexander V. Karzanov, S. Thomas McCormick. SICOMP, 26(4):1245-1275, 1997.

1996

Path Problems in Skew-Symmetric GraphsAndrew V. Goldberg, Alexander V. Karzanov. combinatorica, 16(3):353-382, 1996.

Minimum (2, r)-Metrics and Integer MultiflowsAlexander V. Karzanov, Yannis Manoussakis. ejc, 17(2-3):223-232, 1996. [doi]

How to Tidy up a General Set-System by Use of Uncrossing OperationsAlexander V. Karzanov. TCS, 157(2):215-225, 1996. [doi]

1995

Maximum Skew-Symmetric FlowsAndrew V. Goldberg, Alexander V. Karzanov. esa 1995: 155-170

Polynomial Methods for Separable Convex Optimization in Unimodular SpacesAlexander V. Karzanov, S. Thomas McCormick. soda 1995: 78-87

Half-integral Flows in a Planar Graph with Four HolesAlexander V. Karzanov. DAM, 56(2-3):267-295, 1995. [doi]

1994

Path Problems in Skew-Symmetric GraphsAndrew V. Goldberg, Alexander V. Karzanov. soda 1994: 526-535

Paths and Metrics in a Planar Graph with Three or More Holes. I. MetricsAlexander V. Karzanov. JCT, 60(1):1-18, 1994. [doi]

Paths and Metrics in a Planar Graph with Three or More Holes. II. PathsAlexander V. Karzanov. JCT, 60(1):19-35, 1994. [doi]

Minimum cost multiflows in undirected networksAlexander V. Karzanov. mp, 66:313-325, 1994.

1993

Cyclical games with prohibitionsAlexander V. Karzanov, Vasilij N. Lebedev. mp, 60:277-293, 1993.

1992

On Multiflow ProblemsAndrás Frank, Alexander V. Karzanov, András Sebö. ipco 1992: 85-101

1990

Packings of cuts realizing distances between certain vertices in a planar graphAlexander V. Karzanov. DM, 85(1):73-87, 1990. [doi]

Sums of Cuts and Bipartite MetricsAlexander V. Karzanov. ejc, 11(5):473-484, 1990. [doi]

1987

Half-integral five-terminus flowsAlexander V. Karzanov. DAM, 18(3):263-278, 1987. [doi]

1985

Families of cuts with the MFMC-propertyAlexander V. Karzanov. combinatorica, 5(4):325-336, 1985.

Metrics and undirected cutsAlexander V. Karzanov. mp, 32(2):183-198, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL