Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "kupavski"
download as .bib file
@article{DBLP:journals/dm/KiselevK24,
author = {Sergei Kiselev and
Andrey Kupavskii},
title = {Trivial colors in colorings of Kneser graphs},
journal = {Discret. Math.},
volume = {347},
number = {4},
pages = {113869},
year = {2024}
}
@article{DBLP:journals/ejc/FranklK24,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Intersection theorems for (-1,0,1)-vectors},
journal = {Eur. J. Comb.},
volume = {117},
pages = {103830},
year = {2024}
}
@article{DBLP:journals/dcg/FranklK23,
author = {N{\'{o}}ra Frankl and
Andrey Kupavskii},
title = {Nearly k-Distance Sets},
journal = {Discret. Comput. Geom.},
volume = {70},
number = {3},
pages = {455--494},
year = {2023}
}
@article{DBLP:journals/dm/FranklK23,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Perfect matchings in down-sets},
journal = {Discret. Math.},
volume = {346},
number = {5},
pages = {113323},
year = {2023}
}
@article{DBLP:journals/dm/KolupaevK23,
author = {Dmitriy Kolupaev and
Andrey Kupavskii},
title = {Erd{\H{o}}s matching conjecture for almost perfect matchings},
journal = {Discret. Math.},
volume = {346},
number = {4},
pages = {113304},
year = {2023}
}
@article{DBLP:journals/ejc/FranklK23,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform intersecting families with large covering number},
journal = {Eur. J. Comb.},
volume = {113},
pages = {103747},
year = {2023}
}
@article{DBLP:journals/ejc/FranklKK23,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {Best possible bounds on the number of distinct differences in intersecting
families},
journal = {Eur. J. Comb.},
volume = {107},
pages = {103601},
year = {2023}
}
@article{DBLP:journals/ejc/GolovanovKS23,
author = {Alexander Golovanov and
Andrey Kupavskii and
Arsenii Sagdeev},
title = {Odd-distance and right-equidistant sets in the maximum and Manhattan
metrics},
journal = {Eur. J. Comb.},
volume = {107},
pages = {103603},
year = {2023}
}
@article{DBLP:journals/ejc/KupavskiiVY23,
author = {Andrey Kupavskii and
Aleksei Volostnov and
Yury Yarovikov},
title = {Minimum number of partial triangulations},
journal = {Eur. J. Comb.},
volume = {108},
pages = {103636},
year = {2023}
}
@article{DBLP:journals/jctb/KupavskiiN23,
author = {Andrey Kupavskii and
Fedor Noskov},
title = {Octopuses in the Boolean cube: Families with pairwise small intersections,
part {I}},
journal = {J. Comb. Theory, Ser. {B}},
volume = {163},
pages = {308--331},
year = {2023}
}
@article{DBLP:journals/pcs/KuruzovRCK23,
author = {Ilya A. Kuruzov and
Alexander Rogozin and
S. A. Chezhegov and
Andrey B. Kupavskii},
title = {Robust Algebraic Connectivity},
journal = {Program. Comput. Softw.},
volume = {49},
number = {6},
pages = {525--534},
year = {2023}
}
@article{DBLP:journals/corr/abs-2309-00097,
author = {Andrey Kupavskii},
title = {Erd{\textbackslash}H os-Ko-Rado type results for partitions via spread
approximations},
journal = {CoRR},
volume = {abs/2309.00097},
year = {2023}
}
@article{DBLP:journals/corr/abs-2310-07350,
author = {Sergey Komech and
Andrey Kupavskii and
Alexei Vezolainen},
title = {Choosing optimal parameters for a distributed multi-constrained QoS
routing},
journal = {CoRR},
volume = {abs/2310.07350},
year = {2023}
}
@article{DBLP:journals/combinatorica/FranklK22,
author = {N{\'{o}}ra Frankl and
Andrey Kupavskii},
title = {Almost Sharp Bounds on the Number of Discrete Chains in the Plane},
journal = {Comb.},
volume = {42},
number = {6},
pages = {1119--1143},
year = {2022}
}
@article{DBLP:journals/dcg/FranklHK22,
author = {Peter Frankl and
Andreas F. Holmsen and
Andrey Kupavskii},
title = {Intersection Theorems for Triangles},
journal = {Discret. Comput. Geom.},
volume = {68},
number = {3},
pages = {728--737},
year = {2022}
}
@article{DBLP:journals/dm/BulankinaK22,
author = {Vera Bulankina and
Andrey Kupavskii},
title = {Choice number of Kneser graphs},
journal = {Discret. Math.},
volume = {345},
number = {11},
pages = {113097},
year = {2022}
}
@article{DBLP:journals/dm/FranklKK22,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {On the maximum number of distinct intersections in an intersecting
family},
journal = {Discret. Math.},
volume = {345},
number = {4},
pages = {112757},
year = {2022}
}
@article{DBLP:journals/ejc/FranklKKP22,
author = {N{\'{o}}ra Frankl and
Sergei Kiselev and
Andrey Kupavskii and
Bal{\'{a}}zs Patk{\'{o}}s},
title = {VC-saturated set systems},
journal = {Eur. J. Comb.},
volume = {104},
pages = {103528},
year = {2022}
}
@article{DBLP:journals/jctb/FranklK22,
author = {Peter Frankl and
Andrey Kupavskii},
title = {The Erd{\H{o}}s Matching Conjecture and concentration inequalities},
journal = {J. Comb. Theory, Ser. {B}},
volume = {157},
pages = {366--400},
year = {2022}
}
@article{DBLP:journals/jctb/GroenlandJKMST22,
author = {Carla Groenland and
Tom Johnston and
Andrey Kupavskii and
Kitty Meeks and
Alex D. Scott and
Jane Tan},
title = {Reconstructing the degree sequence of a sparse graph from a partial
deck},
journal = {J. Comb. Theory, Ser. {B}},
volume = {157},
pages = {283--293},
year = {2022}
}
@article{DBLP:journals/jctb/KiselevK22,
author = {Sergei Kiselev and
Andrey Kupavskii},
title = {Sharp bounds for the chromatic number of random Kneser graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {157},
pages = {96--122},
year = {2022}
}
@article{DBLP:journals/jctb/KupavskiiW22,
author = {Andrey Kupavskii and
Stefan Weltge},
title = {Binary scalar products},
journal = {J. Comb. Theory, Ser. {B}},
volume = {156},
pages = {18--30},
year = {2022}
}
@inproceedings{DBLP:conf/approx/EsperetHK22,
author = {Louis Esperet and
Nathaniel Harms and
Andrey Kupavskii},
title = {Sketching Distances in Monotone Graph Classes},
booktitle = {{APPROX/RANDOM}},
series = {LIPIcs},
volume = {245},
pages = {18:1--18:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022}
}
@inproceedings{DBLP:conf/wg/KiselevKVZ22,
author = {Sergei Kiselev and
Andrey Kupavskii and
Oleg Verbitsky and
Maksim Zhukovskii},
title = {On Anti-stochastic Properties of Unlabeled Graphs},
booktitle = {{WG}},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {300--312},
publisher = {Springer},
year = {2022}
}
@article{DBLP:journals/corr/abs-2201-03865,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Perfect matchings in down-sets},
journal = {CoRR},
volume = {abs/2201.03865},
year = {2022}
}
@article{DBLP:journals/corr/abs-2202-09253,
author = {Louis Esperet and
Nathaniel Harms and
Andrey Kupavskii},
title = {Sketching Distances in Monotone Graph Classes},
journal = {CoRR},
volume = {abs/2202.09253},
year = {2022}
}
@article{DBLP:journals/corr/abs-2206-01526,
author = {Dmitriy Kolupaev and
Andrey Kupavskii},
title = {Erd{\H{o}}s Matching Conjecture for almost perfect matchings},
journal = {CoRR},
volume = {abs/2206.01526},
year = {2022}
}
@article{DBLP:journals/corr/abs-2209-04756,
author = {Andrey Kupavskii and
Fedor Noskov},
title = {Octopuses in the Boolean cube: families with pairwise small intersections,
part {I}},
journal = {CoRR},
volume = {abs/2209.04756},
year = {2022}
}
@article{DBLP:journals/combinatorics/FranklK21,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Almost Intersecting Families},
journal = {Electron. J. Comb.},
volume = {28},
number = {2},
pages = {2},
year = {2021}
}
@article{DBLP:journals/dc/KupavskiiW21,
author = {Andrey Kupavskii and
Emo Welzl},
title = {Lower bounds for searching robots, some faulty},
journal = {Distributed Comput.},
volume = {34},
number = {4},
pages = {229--237},
year = {2021}
}
@article{DBLP:journals/ejc/FranklK21,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Beyond the Erd{\H{o}}s Matching Conjecture},
journal = {Eur. J. Comb.},
volume = {95},
pages = {103338},
year = {2021}
}
@article{DBLP:journals/jcta/FranklK21,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Diversity},
journal = {J. Comb. Theory, Ser. {A}},
volume = {182},
pages = {105468},
year = {2021}
}
@article{DBLP:journals/corr/abs-2106-05344,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform intersecting families with large covering number},
journal = {CoRR},
volume = {abs/2106.05344},
year = {2021}
}
@article{DBLP:journals/corr/abs-2106-05355,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {Best possible bounds on the number of distinct differences in intersecting
families},
journal = {CoRR},
volume = {abs/2106.05355},
year = {2021}
}
@article{DBLP:journals/corr/abs-2108-00479,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {On the maximum number of distinct intersections in an intersecting
family},
journal = {CoRR},
volume = {abs/2108.00479},
year = {2021}
}
@article{DBLP:journals/corr/abs-2108-00502,
author = {Vera Bulankina and
Andrey Kupavskii},
title = {Choice number of Kneser graphs},
journal = {CoRR},
volume = {abs/2108.00502},
year = {2021}
}
@article{DBLP:journals/corr/abs-2112-04395,
author = {Sergei Kiselev and
Andrey Kupavskii and
Oleg Verbitsky and
Maksim Zhukovskii},
title = {On anti-stochastic properties of unlabeled graphs},
journal = {CoRR},
volume = {abs/2112.04395},
year = {2021}
}
@article{DBLP:journals/corr/abs-2112-10245,
author = {N{\'{o}}ra Frankl and
Andrey Kupavskii},
title = {On the Erd{\H{o}}s-Purdy problem and the Zarankiewitz problem for
semialgebraic graphs},
journal = {CoRR},
volume = {abs/2112.10245},
year = {2021}
}
@article{DBLP:journals/combinatorica/Kupavskii20,
author = {Andrey Kupavskii},
title = {The VC-Dimension of K-Vertex D-Polytopes},
journal = {Comb.},
volume = {40},
number = {6},
pages = {869--874},
year = {2020}
}
@article{DBLP:journals/ejc/FranklK20,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Sharp results concerning disjoint cross-intersecting families},
journal = {Eur. J. Comb.},
volume = {86},
pages = {103089},
year = {2020}
}
@article{DBLP:journals/ejc/KupavskiiZ20,
author = {Andrey Kupavskii and
Dmitriy Zakharov},
title = {The right acute angles problem?},
journal = {Eur. J. Comb.},
volume = {89},
pages = {103144},
year = {2020}
}
@article{DBLP:journals/jcss/KupavskiiZ20,
author = {Andrey Kupavskii and
Nikita Zhivotovskiy},
title = {When are epsilon-nets small?},
journal = {J. Comput. Syst. Sci.},
volume = {110},
pages = {22--36},
year = {2020}
}
@article{DBLP:journals/jct/FranklKS20,
author = {N{\'{o}}ra Frankl and
Andrey Kupavskii and
Konrad J. Swanepoel},
title = {Embedding graphs in Euclidean space},
journal = {J. Comb. Theory, Ser. {A}},
volume = {171},
year = {2020}
}
@article{DBLP:journals/rsa/KimKKO20,
author = {Jaehoon Kim and
Daniela K{\"{u}}hn and
Andrey Kupavskii and
Deryk Osthus},
title = {Rainbow structures in locally bounded colorings of graphs},
journal = {Random Struct. Algorithms},
volume = {56},
number = {4},
pages = {1171--1204},
year = {2020}
}
@inproceedings{DBLP:conf/compgeom/FranklK20,
author = {N{\'{o}}ra Frankl and
Andrey Kupavskii},
title = {Almost Sharp Bounds on the Number of Discrete Chains in the Plane},
booktitle = {SoCG},
series = {LIPIcs},
volume = {164},
pages = {48:1--48:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020}
}
@article{DBLP:journals/corr/abs-2001-02181,
author = {Sergei Kiselev and
Andrey Kupavskii},
title = {Rainbow matchings in k-partite hypergraphs},
journal = {CoRR},
volume = {abs/2001.02181},
year = {2020}
}
@article{DBLP:journals/corr/abs-2004-04841,
author = {Andrey Kupavskii},
title = {The VC-dimension of k-vertex d-polytopes},
journal = {CoRR},
volume = {abs/2004.04841},
year = {2020}
}
@article{DBLP:journals/corr/abs-2004-08714,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Almost intersecting families},
journal = {CoRR},
volume = {abs/2004.08714},
year = {2020}
}
@article{DBLP:journals/corr/abs-2004-08718,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Maximal degrees in subgraphs of Kneser graphs},
journal = {CoRR},
volume = {abs/2004.08718},
year = {2020}
}
@article{DBLP:journals/corr/abs-2004-08721,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Intersection theorems for (-1, 0, 1)-vectors},
journal = {CoRR},
volume = {abs/2004.08721},
year = {2020}
}
@article{DBLP:journals/corr/abs-2008-07153,
author = {Andrey Kupavskii and
Stefan Weltge},
title = {Binary scalar products},
journal = {CoRR},
volume = {abs/2008.07153},
year = {2020}
}
@article{DBLP:journals/corr/abs-2009-14560,
author = {Peter Frankl and
Andreas F. Holmsen and
Andrey Kupavskii},
title = {Intersection theorems for triangles},
journal = {CoRR},
volume = {abs/2009.14560},
year = {2020}
}
@article{DBLP:journals/corr/abs-2012-14528,
author = {Sergei Kiselev and
Andrey Kupavskii},
title = {Trivial colors in colorings of Kneser graphs},
journal = {CoRR},
volume = {abs/2012.14528},
year = {2020}
}
@article{DBLP:journals/combinatorica/FranklK19,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Incompatible Intersection Properties},
journal = {Comb.},
volume = {39},
number = {6},
pages = {1255--1266},
year = {2019}
}
@article{DBLP:journals/combinatorica/KupavskiiPT19,
author = {Andrey Kupavskii and
J{\'{a}}nos Pach and
Istv{\'{a}}n Tomon},
title = {On the Size of K-Cross-Free Families},
journal = {Comb.},
volume = {39},
number = {1},
pages = {153--164},
year = {2019}
}
@article{DBLP:journals/cpc/KupavskiiMS19,
author = {Andrey Kupavskii and
Nabil H. Mustafa and
Konrad J. Swanepoel},
title = {Bounding the Size of an Almost-Equidistant Set in Euclidean Space},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {280--286},
year = {2019}
}
@article{DBLP:journals/dam/IhringerK19,
author = {Ferdinand Ihringer and
Andrey Kupavskii},
title = {Regular intersecting families},
journal = {Discret. Appl. Math.},
volume = {270},
pages = {142--152},
year = {2019}
}
@article{DBLP:journals/ejc/FranklK19,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families of sets with no matchings of sizes 3 and 4},
journal = {Eur. J. Comb.},
volume = {75},
pages = {123--135},
year = {2019}
}
@article{DBLP:journals/jct/FranklK19,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Two problems on matchings in set families - In the footsteps of Erd{\H{o}}s
and Kleitman},
journal = {J. Comb. Theory, Ser. {B}},
volume = {138},
pages = {286--313},
year = {2019}
}
@article{DBLP:journals/jct/Kupavskii19,
author = {Andrey Kupavskii},
title = {Degree versions of theorems on intersecting families via stability},
journal = {J. Comb. Theory, Ser. {A}},
volume = {168},
pages = {272--287},
year = {2019}
}
@article{DBLP:journals/jmlr/CsikosMK19,
author = {M{\'{o}}nika Csik{\'{o}}s and
Nabil H. Mustafa and
Andrey Kupavskii},
title = {Tight Lower Bounds on the VC-dimension of Geometric Set Systems},
journal = {J. Mach. Learn. Res.},
volume = {20},
pages = {81:1--81:8},
year = {2019}
}
@inproceedings{DBLP:conf/compgeom/FulekGKV019,
author = {Radoslav Fulek and
Bernd G{\"{a}}rtner and
Andrey Kupavskii and
Pavel Valtr and
Uli Wagner},
title = {The Crossing Tverberg Theorem},
booktitle = {SoCG},
series = {LIPIcs},
volume = {129},
pages = {38:1--38:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019}
}
@article{DBLP:journals/corr/abs-1901-03816,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Simple juntas for shifted families},
journal = {CoRR},
volume = {abs/1901.03816},
year = {2019}
}
@article{DBLP:journals/corr/abs-1901-09278,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Beyond the Erd{\H{o}}s Matching Conjecture},
journal = {CoRR},
volume = {abs/1901.09278},
year = {2019}
}
@article{DBLP:journals/corr/abs-1905-08123,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Sharp results concerning disjoint cross-intersecting families},
journal = {CoRR},
volume = {abs/1905.08123},
year = {2019}
}
@article{DBLP:journals/combinatorics/Kupavskii18,
author = {Andrey Kupavskii},
title = {Random Kneser Graphs and Hypergraphs},
journal = {Electron. J. Comb.},
volume = {25},
number = {4},
pages = {4},
year = {2018}
}
@article{DBLP:journals/cpc/FranklK18,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Counting Intersecting and Pairs of Cross-Intersecting Families},
journal = {Comb. Probab. Comput.},
volume = {27},
number = {1},
pages = {60--68},
year = {2018}
}
@article{DBLP:journals/cpc/KupavskiiS18,
author = {Andrey Kupavskii and
Dmitry A. Shabanov},
title = {Colourings of Uniform Hypergraphs with Large Girth and Applications},
journal = {Comb. Probab. Comput.},
volume = {27},
number = {2},
pages = {245--273},
year = {2018}
}
@article{DBLP:journals/ejc/Kupavskii18,
author = {Andrey Kupavskii},
title = {Diversity of uniform intersecting families},
journal = {Eur. J. Comb.},
volume = {74},
pages = {39--47},
year = {2018}
}
@article{DBLP:journals/ejc/KupavskiiPT18,
author = {Andrey Kupavskii and
J{\'{a}}nos Pach and
G{\'{a}}bor Tardos},
title = {Tilings with noncongruent triangles},
journal = {Eur. J. Comb.},
volume = {73},
pages = {72--80},
year = {2018}
}
@article{DBLP:journals/jct/FranklK18,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Erd{\H{o}}s-Ko-Rado theorem for \{0, {\(\pm\)}1\}-vectors},
journal = {J. Comb. Theory, Ser. {A}},
volume = {155},
pages = {157--179},
year = {2018}
}
@article{DBLP:journals/jct/FranklK18a,
author = {Peter Frankl and
Andrey Kupavskii},
title = {New inequalities for families without \emph{k} pairwise disjoint members},
journal = {J. Comb. Theory, Ser. {A}},
volume = {157},
pages = {427--434},
year = {2018}
}
@article{DBLP:journals/jct/KupavskiiZ18,
author = {Andrey Kupavskii and
Dmitriy Zakharov},
title = {Regular bipartite graphs and intersecting families},
journal = {J. Comb. Theory, Ser. {A}},
volume = {155},
pages = {180--189},
year = {2018}
}
@article{DBLP:journals/siamdm/KupavskiiZ18,
author = {Andrey Kupavskii and
Maksim Zhukovskii},
title = {Short Monadic Second Order Sentences about Sparse Random Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {4},
pages = {2916--2940},
year = {2018}
}
@inproceedings{DBLP:conf/podc/KupavskiiW18,
author = {Andrey Kupavskii and
Emo Welzl},
title = {Lower Bounds for Searching Robots, some Faulty},
booktitle = {{PODC}},
pages = {447--453},
publisher = {{ACM}},
year = {2018}
}
@article{DBLP:journals/corr/abs-1804-03581,
author = {Peter Frankl and
Andrey Kupavskii},
title = {New inequalities for families without k pairwise disjoint members},
journal = {CoRR},
volume = {abs/1804.03581},
year = {2018}
}
@article{DBLP:journals/corr/abs-1807-07924,
author = {M{\'{o}}nika Csik{\'{o}}s and
Andrey Kupavskii and
Nabil H. Mustafa},
title = {Optimal Bounds on the VC-dimension},
journal = {CoRR},
volume = {abs/1807.07924},
year = {2018}
}
@article{DBLP:journals/corr/abs-1808-01229,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Incompatible intersection properties},
journal = {CoRR},
volume = {abs/1808.01229},
year = {2018}
}
@article{DBLP:journals/corr/abs-1810-00915,
author = {Andrey Kupavskii},
title = {Degree versions of theorems on intersecting families via stability},
journal = {CoRR},
volume = {abs/1810.00915},
year = {2018}
}
@article{DBLP:journals/corr/abs-1810-00920,
author = {Andrey Kupavskii},
title = {Structure and properties of large intersecting families},
journal = {CoRR},
volume = {abs/1810.00920},
year = {2018}
}
@article{DBLP:journals/corr/abs-1810-01161,
author = {Sergei Kiselev and
Andrey Kupavskii},
title = {Sharp bounds for the chromatic number of random Kneser graphs},
journal = {CoRR},
volume = {abs/1810.01161},
year = {2018}
}
@article{DBLP:journals/corr/abs-1811-01111,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Diversity},
journal = {CoRR},
volume = {abs/1811.01111},
year = {2018}
}
@article{DBLP:journals/corr/abs-1812-04911,
author = {Radoslav Fulek and
Bernd G{\"{a}}rtner and
Andrey Kupavskii and
Pavel Valtr and
Uli Wagner},
title = {The Crossing Tverberg Theorem},
journal = {CoRR},
volume = {abs/1812.04911},
year = {2018}
}
@article{DBLP:journals/combinatorica/KupavskiiP17,
author = {Andrey B. Kupavskii and
Alexandr Polyanskii},
title = {Proof of Schur's Conjecture in {\(\mathbb{R}\)} {D}},
journal = {Comb.},
volume = {37},
number = {6},
pages = {1181--1205},
year = {2017}
}
@article{DBLP:journals/cpc/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform s-Cross-Intersecting Families},
journal = {Comb. Probab. Comput.},
volume = {26},
number = {4},
pages = {517--524},
year = {2017}
}
@article{DBLP:journals/ejc/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {A size-sensitive inequality for cross-intersecting families},
journal = {Eur. J. Comb.},
volume = {62},
pages = {263--271},
year = {2017}
}
@article{DBLP:journals/endm/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families with no matchings of size s},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {483--489},
year = {2017}
}
@article{DBLP:journals/endm/FranklKS17,
author = {N{\'{o}}ra Frankl and
Andrey Kupavskii and
Konrad J. Swanepoel},
title = {Embedding graphs in Euclidean space},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {475--481},
year = {2017}
}
@article{DBLP:journals/jlms/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families with no s pairwise disjoint sets},
journal = {J. Lond. Math. Soc.},
volume = {95},
number = {3},
pages = {875--894},
year = {2017}
}
@article{DBLP:journals/tamm/KupavskiiP17,
author = {Andrey Kupavskii and
J{\'{a}}nos Pach},
title = {From Tarski's Plank Problem to Simultaneous Approximation},
journal = {Am. Math. Mon.},
volume = {124},
number = {6},
pages = {494--505},
year = {2017}
}
@article{DBLP:journals/corr/KupavskiiW17,
author = {Andrey Kupavskii and
Emo Welzl},
title = {Lower Bounds for Searching Robots, some Faulty},
journal = {CoRR},
volume = {abs/1707.05077},
year = {2017}
}
@article{DBLP:journals/corr/abs-1701-04107,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families of sets with no matchings of sizes 3 and 4},
journal = {CoRR},
volume = {abs/1701.04107},
year = {2017}
}
@article{DBLP:journals/corr/abs-1701-04110,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Counting intersecting and pairs of cross-intersecting families},
journal = {CoRR},
volume = {abs/1701.04110},
year = {2017}
}
@article{DBLP:journals/corr/abs-1704-03062,
author = {Andrey Kupavskii and
J{\'{a}}nos Pach and
G{\'{a}}bor Tardos},
title = {Controlling Lipschitz functions},
journal = {CoRR},
volume = {abs/1704.03062},
year = {2017}
}
@article{DBLP:journals/corr/abs-1705-07216,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families of vectors without antipodal pairs},
journal = {CoRR},
volume = {abs/1705.07216},
year = {2017}
}
@article{DBLP:journals/corr/abs-1706-00215,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Partition-free families of sets},
journal = {CoRR},
volume = {abs/1706.00215},
year = {2017}
}
@article{DBLP:journals/corr/abs-1708-01590,
author = {Andrey Kupavskii and
Nabil H. Mustafa and
Konrad J. Swanepoel},
title = {Bounding the size of an almost-equidistant set in Euclidean space},
journal = {CoRR},
volume = {abs/1708.01590},
year = {2017}
}
@article{DBLP:journals/corr/abs-1709-02829,
author = {Andrey Kupavskii},
title = {Diversity of uniform intersecting families},
journal = {CoRR},
volume = {abs/1709.02829},
year = {2017}
}
@article{DBLP:journals/corr/abs-1709-10462,
author = {Ferdinand Ihringer and
Andrey Kupavskii},
title = {Regular Intersecting Families},
journal = {CoRR},
volume = {abs/1709.10462},
year = {2017}
}
@article{DBLP:journals/corr/abs-1710-02440,
author = {Andrey Kupavskii},
title = {Structure and properties of large intersecting families},
journal = {CoRR},
volume = {abs/1710.02440},
year = {2017}
}
@article{DBLP:journals/corr/abs-1711-04504,
author = {Andrey Kupavskii and
J{\'{a}}nos Pach and
G{\'{a}}bor Tardos},
title = {Tilings with noncongruent triangles},
journal = {CoRR},
volume = {abs/1711.04504},
year = {2017}
}
@article{DBLP:journals/corr/abs-1711-10414,
author = {Andrey Kupavskii and
Nikita Zhivotovskiy},
title = {When are epsilon-nets small?},
journal = {CoRR},
volume = {abs/1711.10414},
year = {2017}
}
@article{DBLP:journals/corr/abs-1712-03118,
author = {Andrey Kupavskii and
J{\'{a}}nos Pach and
G{\'{a}}bor Tardos},
title = {Tilings of the plane with unit area triangles of bounded diameter},
journal = {CoRR},
volume = {abs/1712.03118},
year = {2017}
}
@article{DBLP:journals/dcg/Kupavskii16,
author = {Andrey Kupavskii},
title = {The number of double-normals in space},
journal = {Discret. Comput. Geom.},
volume = {56},
number = {3},
pages = {711--726},
year = {2016}
}
@article{DBLP:journals/jct/Kupavskii16,
author = {Andrey Kupavskii},
title = {On random subgraphs of Kneser and Schrijver graphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {141},
pages = {8--15},
year = {2016}
}
@inproceedings{DBLP:conf/compgeom/KupavskiiMP16,
author = {Andrey Kupavskii and
Nabil H. Mustafa and
J{\'{a}}nos Pach},
title = {New Lower Bounds for epsilon-Nets},
booktitle = {SoCG},
series = {LIPIcs},
volume = {51},
pages = {54:1--54:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016}
}
@article{DBLP:journals/corr/abs-1603-00936,
author = {Peter Frankl and
Andrey Kupavskii},
title = {A size-sensitive inequality for cross-intersecting families},
journal = {CoRR},
volume = {abs/1603.00936},
year = {2016}
}
@article{DBLP:journals/corr/abs-1603-00938,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Intersection theorems for \{0, {\(\pm\)}1\}-vectors and s-cross-intersecting
families},
journal = {CoRR},
volume = {abs/1603.00938},
year = {2016}
}
@article{DBLP:journals/corr/abs-1607-06122,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families with no s pairwise disjoint sets},
journal = {CoRR},
volume = {abs/1607.06122},
year = {2016}
}
@article{DBLP:journals/corr/abs-1607-06126,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Two problems of P. Erd{\H{o}}s on matchings in set families},
journal = {CoRR},
volume = {abs/1607.06126},
year = {2016}
}
@article{DBLP:journals/corr/abs-1611-03129,
author = {Andrey Kupavskii and
Dmitriy Zakharov},
title = {Regular bipartite graphs and intersecting families},
journal = {CoRR},
volume = {abs/1611.03129},
year = {2016}
}
@article{DBLP:journals/corr/abs-1611-07258,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform s-cross-intersecting families},
journal = {CoRR},
volume = {abs/1611.07258},
year = {2016}
}
@article{DBLP:journals/corr/abs-1611-07260,
author = {Andrey Kupavskii and
Maksim Zhukovskii},
title = {Short monadic second order sentences about sparse random graphs},
journal = {CoRR},
volume = {abs/1611.07260},
year = {2016}
}
@article{DBLP:journals/corr/abs-1612-03868,
author = {Andrey Kupavskii},
title = {Random Kneser graphs and hypergraphs},
journal = {CoRR},
volume = {abs/1612.03868},
year = {2016}
}
@inproceedings{DBLP:conf/jcdcg/KupavskiiP15,
author = {Andrei Kupavskii and
J{\'{a}}nos Pach},
title = {Simultaneous Approximation of Polynomials},
booktitle = {{JCDCGG}},
series = {Lecture Notes in Computer Science},
volume = {9943},
pages = {193--203},
publisher = {Springer},
year = {2015}
}
@article{DBLP:journals/corr/abs-1502-00699,
author = {Andrey B. Kupavskii},
title = {On random subgraphs of Kneser and Schrijver graphs},
journal = {CoRR},
volume = {abs/1502.00699},
year = {2015}
}
@article{DBLP:journals/corr/abs-1510-03912,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Erd{\H{o}}s-Ko-Rado theorem for \{0, {\(\pm\)}: 1\}-vectors},
journal = {CoRR},
volume = {abs/1510.03912},
year = {2015}
}
@article{DBLP:journals/corr/abs-1511-08111,
author = {Andrey B. Kupavskii and
J{\'{a}}nos Pach},
title = {From Tarski's plank problem to simultaneous approximation},
journal = {CoRR},
volume = {abs/1511.08111},
year = {2015}
}
@article{DBLP:journals/dcg/Kupavskii14,
author = {Andrey Kupavskii},
title = {Diameter Graphs in {\(\mathbb{R}\)}\({}^{\mbox{4}}\)},
journal = {Discret. Comput. Geom.},
volume = {51},
number = {4},
pages = {842--858},
year = {2014}
}
@article{DBLP:journals/jct/AlonK14,
author = {Noga Alon and
Andrey Kupavskii},
title = {Two notions of unit distance graphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {125},
pages = {1--17},
year = {2014}
}
@article{DBLP:journals/corr/abs-1402-3694,
author = {Andrey B. Kupavskii and
Alexandr Polyanskii},
title = {Proof of Schur's conjecture in {\(\mathbb{R}\)}\({}^{\mbox{d}}\)},
journal = {CoRR},
volume = {abs/1402.3694},
year = {2014}
}
@article{DBLP:journals/corr/abs-1412-4405,
author = {Andrey Kupavskii},
title = {Number of double-normal pairs in space},
journal = {CoRR},
volume = {abs/1412.4405},
year = {2014}
}
@article{DBLP:journals/dm/KupavskiiRT13,
author = {Andrey B. Kupavskii and
Andrei M. Raigorodskii and
Maria V. Titova},
title = {New bounds for the distance Ramsey number},
journal = {Discret. Math.},
volume = {313},
number = {22},
pages = {2566--2574},
year = {2013}
}
@article{DBLP:journals/im/KupavskiiOST13,
author = {Andrey Kupavskii and
Liudmila Ostroumova and
Dmitry A. Shabanov and
Prasad Tetali},
title = {The Distribution of Second Degrees in the Buckley-Osthus Random Graph
Model},
journal = {Internet Math.},
volume = {9},
number = {4},
pages = {297--335},
year = {2013}
}
@inproceedings{DBLP:conf/icwsm/KupavskiiUGS13,
author = {Andrey Kupavskii and
Alexey Umnov and
Gleb Gusev and
Pavel Serdyukov},
title = {Predicting the Audience Size of a Tweet},
booktitle = {{ICWSM}},
publisher = {The {AAAI} Press},
year = {2013}
}
@article{DBLP:journals/corr/abs-1304-5715,
author = {Andrey Kupavskii and
Liudmila Ostroumova and
Dmitry A. Shabanov and
Prasad Tetali},
title = {The distribution of second degrees in the Buckley-Osthus random graph
model},
journal = {CoRR},
volume = {abs/1304.5715},
year = {2013}
}
@article{DBLP:journals/corr/abs-1306-3910,
author = {Andrey Kupavskii},
title = {Diameter graphs in {\(\mathbb{R}\)}\({}^{\mbox{4}}\)},
journal = {CoRR},
volume = {abs/1306.3910},
year = {2013}
}
@article{DBLP:journals/corr/abs-1306-3916,
author = {Noga Alon and
Andrey Kupavskii},
title = {Two notions of unit distance graphs},
journal = {CoRR},
volume = {abs/1306.3916},
year = {2013}
}
@article{DBLP:journals/corr/abs-1306-3921,
author = {Andrey Kupavskii},
title = {Distance graphs with large chromatic number and arbitrary girth},
journal = {CoRR},
volume = {abs/1306.3921},
year = {2013}
}
@article{DBLP:journals/corr/abs-1307-0843,
author = {Andrey B. Kupavskii and
Andrei M. Raigorodskii and
Maria V. Titova},
title = {New bounds for the distance Ramsey number},
journal = {CoRR},
volume = {abs/1307.0843},
year = {2013}
}
@inproceedings{DBLP:conf/cikm/KupavskiiOUUSGK12,
author = {Andrey Kupavskii and
Liudmila Ostroumova and
Alexey Umnov and
Svyatoslav Usachev and
Pavel Serdyukov and
Gleb Gusev and
Andrey Kustarev},
title = {Prediction of retweet cascade size over time},
booktitle = {{CIKM}},
pages = {2335--2338},
publisher = {{ACM}},
year = {2012}
}
@article{DBLP:journals/dm/Kupavskiy11,
author = {Andrey Kupavskiy},
title = {On the chromatic number of R\({}^{\mbox{n}}\) with an arbitrary norm},
journal = {Discret. Math.},
volume = {311},
number = {6},
pages = {437--440},
year = {2011}
}
@article{DBLP:journals/corr/abs-1110-1249,
author = {Andrei Kupavskii and
Dmitry A. Shabanov},
title = {On r-colorability of random hypergraphs},
journal = {CoRR},
volume = {abs/1110.1249},
year = {2011}
}
@article{DBLP:journals/corr/abs-1010-0383,
author = {Andrei Kupavskii and
Andrei M. Raigorodskii},
title = {Counterexamples to Borsuk's conjecture on spheres of small radii},
journal = {CoRR},
volume = {abs/1010.0383},
year = {2010}
}
@article{DBLP:journals/endm/KupavskiiR09,
author = {Andrey B. Kupavskii and
Andrei M. Raigorodskii},
title = {On the chromatic numbers of small-dimensional Euclidean spaces},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {435--439},
year = {2009}
}
a service of 
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.
retrieved on 2024-04-20 02:57 CEST from data curated 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:
