activity
20002026
most citedCombined tilings and separated set-systems

9 citations · 38 across the 39 of their papers we have counts for

collaborators

45 papers

math.CO2026

On splitting properties of the stability problem with integer choice functions

Alexander V. Karzanov

We consider the integer version of Alkan--Gale's model on stability in a two-sided market, called the stable generalized allocation one. It is given by a triple , where $G…

math.CO2026

On a stable partnership problem with integer choice functions

Alexander V. Karzanov

We consider a far generalization of the well-known stable roommates and non-bipartite stable allocation problems. In its setting, one is given a finite non-bipartite graph $G=(V,E)…

math.CO2026

A poset representation for stable contracts in a two-sided market generated by integer choice functions

Alexander V. Karzanov

Generalizing a variety of earlier problems on stable contracts in two-sided markets, Alkan and Gale introduced in 2003 a general stability model on a bipartite graph in w…

math.CO2025

On universal quadratic inequalities for minors of TNN matrices

Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy

For positive integers , we give a combinatorial characterization for the set of quadratic inequalities on minors that are valid for all totally nonnegative matri…

math.CO2025

On one generalization of stable allocations in a two-sided market

Alexander V. Karzanov

In the stable allocation problem on a two-sided market introduced and studied by Baiou and Balinski in the early 2000's, one is given a bipartite graph with capacities $b…

math.CO2024★ 1 cited

Stable matchings, choice functions, and linear orders

Alexander V. Karzanov

We consider a model of stable edge sets (``matchings'') in a bipartite graph in which the preferences for vertices of one side (``firms'') are given via choice functions…