The following pages link to Alexander V. Karzanov (Q423889):
Displayed 50 items.
- Condorcet domains of tiling type (Q423890) (← links)
- (Q522659) (redirect page) (← links)
- Combined tilings and separated set-systems (Q522661) (← links)
- Half-integral five-terminus flows (Q581412) (← links)
- On maximal weakly separated set-systems (Q604830) (← links)
- Cyclical games with prohibitions (Q689132) (← links)
- Packings of cuts realizing distances between certain vertices in a planar graph (Q804586) (← links)
- On interrelations between strongly, weakly and chord separated set-systems (a geometric approach) (Q825552) (← links)
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra (Q869913) (← links)
- Combinatorics of regular \(A_{2}\)-crystals (Q876347) (← links)
- Assembling crystals of type A (Q895942) (← links)
- The crossing model for regular \(A_n\)-crystals (Q958628) (← links)
- Plücker environments, wiring and tiling diagrams, and weakly separated set-systems (Q962148) (← links)
- \(B_2\)-crystals: axioms, structure, models (Q1003641) (← links)
- Minimum mean cycle problem in bidirected and skew-symmetric graphs (Q1013299) (← links)
- Families of cuts with the MFMC-property (Q1082240) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- Minimal quantity of operators for serving a homogeneous linear technological process (Q1136692) (← links)
- (Q1182034) (redirect page) (← links)
- On the conductance of order Markov chains (Q1182035) (← links)
- Planning of computation using computing models when solving problems (Q1238418) (← links)
- A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons (Q1280281) (← links)
- Metrics with finite sets of primitive extensions (Q1293426) (← links)
- A combinatorial algorithm for the minimum \((2,r)\)-metric problem and some generalizations (Q1297737) (← links)
- Paths and metrics in a planar graph with three or more holes. I: Metrics (Q1322003) (← links)
- Paths and metrics in a planar graph with three or more holes. II: Paths (Q1322004) (← links)
- Minimum cost multiflows in undirected networks (Q1337137) (← links)
- How to tidy up a symmetric set-system by use of uncrossing operations (Q1351503) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- Minimum 0-extensions of graph metrics (Q1378296) (← links)
- Minimum weight \((T,d)\)-joins and multi-joins (Q1381848) (← links)
- A characterization of minimizable metrics in the multifacility location problem (Q1582478) (← links)
- On one maximum multiflow problem and related metrics (Q1584451) (← links)
- Planar flows and quadratic relations over semirings (Q1759332) (← links)
- Concave cocirculations in a triangular grid (Q1779253) (← links)
- Sums of cuts and bipartite metrics (Q1813228) (← links)
- A fast algorithm for determining the distances of the points of a given set in an integral lattice from its complement (Q1816128) (← links)
- Half-integral flows in a planar graph with four holes (Q1842657) (← links)
- Maximum skew-symmetric flows and matchings (Q1885276) (← links)
- Hard cases of the multifacility location problem (Q1887076) (← links)
- Minimum \((2,r)\)-metrics and integer multiflows (Q1911842) (← links)
- Min-cost multiflows in node-capacitated undirected networks (Q1928531) (← links)
- An efficient algorithm for packing cuts and \((2,3)\)-metrics in a planar graph with three holes (Q2010919) (← links)
- Cubillages in odd dimensions (Q2199856) (← links)
- Majority rule on rhombus tilings and Condorcet super-domains (Q2223688) (← links)
- The weak separation in higher dimensions (Q2229161) (← links)
- Erratum to: ``\(B_2\)-crystals: axioms, structure, models'' (Q2229179) (← links)
- Free multiflows in bidirected and skew-symmetric graphs (Q2381535) (← links)
- One more well-solved case of the multifacility location problem (Q2386213) (← links)
- Path problems in skew-symmetric graphs (Q2563512) (← links)