Andrey Kupavskii

About Andrey Kupavskii

Andrey Kupavskii, With an exceptional h-index of 20 and a recent h-index of 17 (since 2020), a distinguished researcher at Moscow Institute of Physics and Technology, specializes in the field of combinatorics, discrete geometry.

His recent articles reflect a diverse array of research interests and contributions to the field:

Tilings of Z with multisets of distances

Spread approximations for forbidden intersections problems

Max-norm Ramsey theory

Stability for binary scalar products

Non-trivial -wise agreeing families

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers

Robust Algebraic Connectivity

Intersection theorems for uniform subfamilies of hereditary families

Andrey Kupavskii Information

University

Position

Department of Discrete Mathematics

Citations(all)

1583

Citations(since 2020)

1046

Cited By

1011

hIndex(all)

20

hIndex(since 2020)

17

i10Index(all)

52

i10Index(since 2020)

37

Email

University Profile Page

Google Scholar

Andrey Kupavskii Skills & Research Interests

combinatorics

discrete geometry

Top articles of Andrey Kupavskii

Tilings of Z with multisets of distances

Discrete Mathematics

2024/9/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Spread approximations for forbidden intersections problems

Advances in Mathematics

2024/5/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Max-norm Ramsey theory

European Journal of Combinatorics

2024/5/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Stability for binary scalar products

arXiv preprint arXiv:2404.17933

2024/4/27

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Non-trivial -wise agreeing families

arXiv preprint arXiv:2404.14178

2024/4/22

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers

arXiv preprint arXiv:2404.05045

2024/4/7

Robust Algebraic Connectivity

Programming and Computer Software

2023/12

Intersection theorems for uniform subfamilies of hereditary families

arXiv preprint arXiv:2311.02246

2023/11/3

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Octopuses in the Boolean cube: Families with pairwise small intersections, part I

Journal of Combinatorial Theory, Series B

2023/11/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Choosing optimal parameters for a distributed multi-constrained QoS routing

arXiv preprint arXiv:2310.07350

2023/10/11

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Uniform intersecting families with large covering number

European Journal of Combinatorics

2023/10/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Nearly k-Distance Sets

Discrete & Computational Geometry

2023/10

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Erd\H os--Ko--Rado type results for partitions via spread approximations

arXiv preprint arXiv:2309.00097

2023/8/31

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

The crossing Tverberg theorem

Discrete & Computational Geometry

2023/7/27

Radoslav Fulek
Radoslav Fulek

H-Index: 9

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings

Proceedings of the American Mathematical Society

2023/6

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Perfect matchings in down-sets

Discrete Mathematics

2023/5/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Tilings of with multisets of distances

arXiv preprint arXiv:2304.05082

2023/4/11

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Erdős matching conjecture for almost perfect matchings

Discrete Mathematics

2023/4/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Minimum number of partial triangulations

European Journal of Combinatorics

2023/2/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

Odd-distance and right-equidistant sets in the maximum and Manhattan metrics

European Journal of Combinatorics

2023/1/1

Andrey Kupavskii
Andrey Kupavskii

H-Index: 15

See List of Professors in Andrey Kupavskii University(Moscow Institute of Physics and Technology)

Co-Authors

academic-engine