1 citations · 1 across the 6 of their papers we have counts for
6 papers
Stability for binary scalar products
Andrey Kupavskii, Dmitry Tsarev
Bohn, Faenza, Fiorini, Fisikopoulos, Macchia, and Pashkovich (2015) conjectured that 2-level polytopes cannot simultaneously have many vertices and many facets, namely, that the ma…
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii +4
We study spanners in planar domains, including polygonal domains, polyhedral terrain, and planar metrics. Previous work showed that for any constant , one could constru…
Intersection theorems for uniform subfamilies of hereditary families
Andrey Kupavskii
A family of sets is hereditary if whenever and , we have . Chvátal conjectured that the largest intersecting subfamily o…
Choosing optimal parameters for a distributed multi-constrained QoS routing
Sergey Komech, Andrey Kupavskii, Alexei Vezolainen
We consider several basic questions on distributed routing in directed graphs with multiple additive costs, or metrics, and multiple constraints. Distributed routing in this sense…
Octopuses in the Boolean cube: families with pairwise small intersections, part II
Andrey Kupavskii, Fedor Noskov
The problem we consider originally arises from 2-level polytope theory. This class of polytopes generalizes a number of other polytope families. One of the important questions in t…
On the Erdős-Purdy problem and the Zarankiewitz problem for semialgebraic graphs
Nora Frankl, Andrey Kupavskii
Erdős and Purdy, and later Agarwal and Sharir, conjectured that any set of points in determine at most congruent -simplices for even . We obtai…