default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander V. Karzanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Alexander V. Karzanov:
On stable assignments generated by choice functions of mixed type. Discret. Appl. Math. 358: 112-135 (2024)- 2021
- [j38]Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy
:
Majority rule on rhombus tilings and Condorcet super-domains. Discret. Appl. Math. 292: 85-96 (2021) - [j37]Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy:
The weak separation in higher dimensions. J. Comb. Theory A 180: 105392 (2021) - [j36]Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy:
Erratum to "B2-crystals: Axioms, structure, models" [J. Comb. Theory, Ser. A 116 (2009) 265-289]. J. Comb. Theory A 180: 105417 (2021)
2010 – 2019
- 2019
- [j35]Alexander V. Karzanov:
An efficient algorithm for packing cuts and (2, 3)-metrics in a planar graph with three holes. Discret. Optim. 33: 118-139 (2019) - 2015
- [c7]Maxim A. Babenko, Alexander V. Karzanov:
A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes. CSR 2015: 53-66 - 2012
- [j34]Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy:
Condorcet domains of tiling type. Discret. Appl. Math. 160(7-8): 933-940 (2012) - [j33]Maxim A. Babenko, Alexander V. Karzanov:
Min-cost multiflows in node-capacitated undirected networks. J. Comb. Optim. 24(3): 202-228 (2012) - [i1]Maxim A. Babenko, Alexander V. Karzanov:
On Weighted Multicommodity Flows in Directed Networks. CoRR abs/1212.0224 (2012)
2000 – 2009
- 2009
- [j32]Maxim A. Babenko, Alexander V. Karzanov:
Minimum mean cycle problem in bidirected and skew-symmetric graphs. Discret. Optim. 6(1): 92-97 (2009) - [j31]Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy:
B2-crystals: Axioms, structure, models. J. Comb. Theory A 116(2): 265-289 (2009) - 2008
- [c6]Maxim A. Babenko, Alexander V. Karzanov:
A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem. ESA 2008: 124-135 - 2007
- [j30]Maxim A. Babenko, Alexander V. Karzanov:
Free multiflows in bidirected and skew-symmetric graphs. Discret. Appl. Math. 155(13): 1715-1730 (2007) - 2005
- [j29]Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy:
Discrete strip-concave functions, Gelfand-Tsetlin patterns, and related polyhedra. J. Comb. Theory A 112(2): 175-193 (2005) - 2004
- [j28]Alexander V. Karzanov:
Hard cases of the multifacility location problem. Discret. Appl. Math. 143(1-3): 368-373 (2004) - [j27]Alexander V. Karzanov:
One more well-solved case of the multifacility location problem. Discret. Optim. 1(1): 51-66 (2004) - [j26]Andrew V. Goldberg, Alexander V. Karzanov:
Maximum skew-symmetric flows and matchings. Math. Program. 100(3): 537-568 (2004) - [c5]Alexander V. Karzanov:
Integer Concave Cocirculations and Honeycombs. IPCO 2004: 368-387 - 2000
- [j25]Hans-Jürgen Bandelt, Victor Chepoi, Alexander V. Karzanov:
A Characterization of Minimizable Metrics in the Multifacility Location Problem. Eur. J. Comb. 21(6): 715-725 (2000) - [j24]Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. RAIRO Theor. Informatics Appl. 34(2): 87-98 (2000)
1990 – 1999
- 1998
- [j23]Toshihide Ibaraki, Alexander V. Karzanov, Hiroshi Nagamochi:
A Fast Algorithm For Finding A Maximum Free Multiflow In An Inner Eulerian Network And Some Generalizations. Comb. 18(1): 61-83 (1998) - [j22]Alexander V. Karzanov:
A Combinatorial Algorithm for the Minimum (2, r )-Metric Problem and Some Generalizations. Comb. 18(4): 549-568 (1998) - [j21]Michel Burlet, Alexander V. Karzanov:
Minimum weight (T, d)-joins and multi-joins. Discret. Math. 181(1-3): 65-76 (1998) - [j20]Alexander V. Karzanov:
On one maximum multiflow problem and related metrics. Discret. Math. 192(1-3): 187-204 (1998) - [j19]Alexander V. Karzanov:
Minimum 0-Extensions of Graph Metrics. Eur. J. Comb. 19(1): 71-101 (1998) - [j18]Evripidis Bampis, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
A Parallel Algorithm for Finding a Perfect Matching in a Planar Graph. Parallel Process. Lett. 8(3): 399-405 (1998) - 1997
- [j17]Andrew V. Goldberg, Alexander V. Karzanov:
Scaling Methods for Finding a Maximum Free Multiflow of Minimum Cost. Math. Oper. Res. 22(1): 90-109 (1997) - [j16]Alexander V. Karzanov:
Multiflows and disjoint paths of minimum total cost. Math. Program. 77: 219-242 (1997) - [j15]Alexander V. Karzanov, S. Thomas McCormick:
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications. SIAM J. Comput. 26(4): 1245-1275 (1997) - [j14]András Frank, Alexander V. Karzanov, András Sebö:
On Integer Multiflow Maximization. SIAM J. Discret. Math. 10(1): 158-170 (1997) - 1996
- [j13]Andrew V. Goldberg, Alexander V. Karzanov:
Path Problems in Skew-Symmetric Graphs. Comb. 16(3): 353-382 (1996) - [j12]Alexander V. Karzanov, Yannis Manoussakis:
Minimum (2, r)-Metrics and Integer Multiflows. Eur. J. Comb. 17(2-3): 223-232 (1996) - [j11]Alexander V. Karzanov:
How to Tidy up a General Set-System by Use of Uncrossing Operations. Theor. Comput. Sci. 157(2): 215-225 (1996) - 1995
- [j10]Alexander V. Karzanov:
Half-integral Flows in a Planar Graph with Four Holes. Discret. Appl. Math. 56(2-3): 267-295 (1995) - [c4]Andrew V. Goldberg, Alexander V. Karzanov:
Maximum Skew-Symmetric Flows. ESA 1995: 155-170 - [c3]Alexander V. Karzanov, S. Thomas McCormick:
Polynomial Methods for Separable Convex Optimization in Unimodular Spaces. SODA 1995: 78-87 - 1994
- [j9]Alexander V. Karzanov:
Paths and Metrics in a Planar Graph with Three or More Holes. I. Metrics. J. Comb. Theory B 60(1): 1-18 (1994) - [j8]Alexander V. Karzanov:
Paths and Metrics in a Planar Graph with Three or More Holes. II. Paths. J. Comb. Theory B 60(1): 19-35 (1994) - [j7]Alexander V. Karzanov:
Minimum cost multiflows in undirected networks. Math. Program. 66: 313-325 (1994) - [c2]Andrew V. Goldberg, Alexander V. Karzanov:
Path Problems in Skew-Symmetric Graphs. SODA 1994: 526-535 - 1993
- [j6]Alexander V. Karzanov, Vasilij N. Lebedev:
Cyclical games with prohibitions. Math. Program. 60: 277-293 (1993) - 1992
- [c1]András Frank, Alexander V. Karzanov, András Sebö:
On Multiflow Problems. IPCO 1992: 85-101 - 1990
- [j5]Alexander V. Karzanov:
Packings of cuts realizing distances between certain vertices in a planar graph. Discret. Math. 85(1): 73-87 (1990) - [j4]Alexander V. Karzanov:
Sums of Cuts and Bipartite Metrics. Eur. J. Comb. 11(5): 473-484 (1990)
1980 – 1989
- 1987
- [j3]Alexander V. Karzanov:
Half-integral five-terminus flows. Discret. Appl. Math. 18(3): 263-278 (1987) - 1985
- [j2]Alexander V. Karzanov:
Families of cuts with the MFMC-property. Comb. 5(4): 325-336 (1985) - [j1]Alexander V. Karzanov:
Metrics and undirected cuts. Math. Program. 32(2): 183-198 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
