


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Likely matches
- Andrey Kupavskii
aka: Andrei Kupavskii, Andrey B. Kupavskii
Moscow Institute of Physics and Technology, Russia - Andrey Kupavskiy
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 150 matches
- 2025
- Andrey Kupavskii, Fedor Noskov:
Octopuses in the Boolean cube: Families with pairwise small intersections, part II. Discret. Math. 348(2): 114280 (2025) - Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth:
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. SODA 2025: 4292-4326 - 2024
- Agnijo Banerjee:
A Proof of a Frankl-Kupavskii Conjecture on Intersecting Families. Comb. 44(5): 1053-1061 (2024) - Radoslav Fulek
, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner:
The Crossing Tverberg Theorem. Discret. Comput. Geom. 72(2): 831-848 (2024) - Sergei Kiselev, Andrey Kupavskii:
Trivial colors in colorings of Kneser graphs. Discret. Math. 347(4): 113869 (2024) - Andrey Kupavskii, Elizaveta Popova:
Tilings of Z with multisets of distances. Discret. Math. 347(9): 114053 (2024) - Peter Frankl, Andrey Kupavskii:
Intersection theorems for (-1,0,1)-vectors. Eur. J. Comb. 117: 103830 (2024) - Nóra Frankl, Andrey Kupavskii, Arsenii Sagdeev:
Max-norm Ramsey theory. Eur. J. Comb. 118: 103918 (2024) - Sergei Kiselev, Andrey Kupavskii, Oleg Verbitsky, Maksim Zhukovskii:
On Isomorphism-Invariant Antistochastic Properties of Random Graphs. SIAM J. Discret. Math. 38(4): 3043-3078 (2024) - Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, Csaba D. Tóth:
Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers. CoRR abs/2404.05045 (2024) - Andrey Kupavskii, Dmitry V. Tsarev:
Stability for binary scalar products. CoRR abs/2404.17933 (2024) - Andrey Kupavskii:
Intersecting families with covering number 3. CoRR abs/2405.02621 (2024) - Andrey Kupavskii:
An almost complete t-intersection theorem for permutations. CoRR abs/2405.07843 (2024) - Eduard Inozemtsev, Andrey Kupavskii:
Two questions on Kneser colorings. CoRR abs/2405.08797 (2024) - Grigorii Dakhno, Dmitry Gribanov, Nikita Kasianov, Anastasiia Kats, Andrey Kupavskii, Nikita Kuzmin:
Hyperplanes Avoiding Problem and Integer Points Counting in Polyhedra. CoRR abs/2411.07030 (2024) - Andrey Kupavskii:
Structure of non-trivial intersecting families. CoRR abs/2412.07974 (2024) - 2023
- Andrey Kupavskii:
Rainbow version of the Erdős Matching Conjecture via concentration. Comb. Theory 3(1) (2023) - Nóra Frankl
, Andrey Kupavskii:
Nearly k-Distance Sets. Discret. Comput. Geom. 70(3): 455-494 (2023) - Peter Frankl, Andrey Kupavskii:
Perfect matchings in down-sets. Discret. Math. 346(5): 113323 (2023) - Dmitriy Kolupaev, Andrey Kupavskii:
Erdős matching conjecture for almost perfect matchings. Discret. Math. 346(4): 113304 (2023) - Peter Frankl, Andrey Kupavskii:
Uniform intersecting families with large covering number. Eur. J. Comb. 113: 103747 (2023) - Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Comb. 107: 103601 (2023) - Alexander Golovanov, Andrey Kupavskii, Arsenii Sagdeev:
Odd-distance and right-equidistant sets in the maximum and Manhattan metrics. Eur. J. Comb. 107: 103603 (2023) - Andrey Kupavskii, Aleksei Volostnov, Yury Yarovikov:
Minimum number of partial triangulations. Eur. J. Comb. 108: 103636 (2023) - Andrey Kupavskii, Fedor Noskov
:
Octopuses in the Boolean cube: Families with pairwise small intersections, part I. J. Comb. Theory B 163: 308-331 (2023) - Ilya A. Kuruzov
, Alexander Rogozin
, S. A. Chezhegov
, Andrey B. Kupavskii
:
Robust Algebraic Connectivity. Program. Comput. Softw. 49(6): 525-534 (2023) - Andrey Kupavskii:
Erd\H os-Ko-Rado type results for partitions via spread approximations. CoRR abs/2309.00097 (2023) - Sergey Komech, Andrey Kupavskii, Alexei Vezolainen:
Choosing optimal parameters for a distributed multi-constrained QoS routing. CoRR abs/2310.07350 (2023) - 2022
- Nóra Frankl, Andrey Kupavskii:
Almost Sharp Bounds on the Number of Discrete Chains in the Plane. Comb. 42(6): 1119-1143 (2022) - Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
Intersection Theorems for Triangles. Discret. Comput. Geom. 68(3): 728-737 (2022)
skipping 120 more matches
loading more results
failed to load more results, please try again later

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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-12 08:17 CET 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