default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArkadiy Skopenkov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i22]S. Dzhenzher, Alexander Miroshnikov, O. Nikitenko, Arkadiy Skopenkov:
Cycles in graphs and in hypergraphs (in Russian). CoRR abs/2406.16705 (2024)- [i21]Emil Alkin, E. Bordacheva, Alexander Miroshnikov, O. Nikitenko, Arkadiy Skopenkov:
Invariants of almost embeddings of graphs in the plane: results and problems. CoRR abs/2408.06392 (2024) - [i20]Emil Alkin, E. Bordacheva, Alexander Miroshnikov, Arkadiy Skopenkov:
Invariants of almost embeddings of graphs in the plane. CoRR abs/2410.09860 (2024) - 2023
- [j6]Sergey Avvakumov, Roman N. Karasev, Arkadiy Skopenkov:
Stronger Counterexamples to the Topological Tverberg Conjecture. Comb. 43(4): 717-727 (2023) - [j5]Arkadiy Skopenkov:
Extendability of Simplicial Maps is Undecidable. Discret. Comput. Geom. 69(1): 250-259 (2023) - [j4]Roman N. Karasev, Arkadiy Skopenkov:
Some 'Converses' to Intrinsic Linking Theorems. Discret. Comput. Geom. 70(3): 921-930 (2023) - [i19]Emil Alkin, S. Dzhenzher, O. Nikitenko, Arkadiy Skopenkov, A. Voropaev:
Cycles in graphs and in hypergraphs. CoRR abs/2308.05175 (2023) - 2022
- [i18]S. Dzhenzher, Arkadiy Skopenkov:
To the Kühnel conjecture on embeddability of k-complexes in 2k-manifolds. CoRR abs/2208.04188 (2022) - 2021
- [j3]Arkadiy Skopenkov:
A Short Exposition of Salman Parsa's Theorems on Intrinsic Linking and Non-realizability. Discret. Comput. Geom. 65(2): 584-585 (2021) - [i17]S. Dzhenzher, Arkadiy Skopenkov:
A structured proof of the Kolmogorov superposition theorem. CoRR abs/2105.00408 (2021) - [i16]E. Kogan, Arkadiy Skopenkov:
A short exposition of the Patak-Tancer theorem on non-embeddability of k-complexes in 2k-manifolds. CoRR abs/2106.14010 (2021) - [i15]A. Buchaev, Arkadiy Skopenkov:
Simple proofs of estimations of Ramsey numbers and of discrepancy. CoRR abs/2107.13831 (2021) - [i14]E. Kogan, Arkadiy Skopenkov:
Embeddings of k-complexes in 2k-manifolds and minimum rank of partial symmetric matrices. CoRR abs/2112.06636 (2021) - 2020
- [i13]Arkadiy Skopenkov:
A user's guide to basic knot and link theory. CoRR abs/2001.01472 (2020) - [i12]Arkadiy Skopenkov:
Extendability of simplicial maps is undecidable. CoRR abs/2008.00492 (2020) - [i11]Roman N. Karasev, Arkadiy Skopenkov:
Some 'converses' to intrinsic linking theorems. CoRR abs/2008.02523 (2020)
2010 – 2019
- 2019
- [j2]Arkadiy Skopenkov, Martin Tancer
:
Hardness of almost embedding simplicial complexes in Rd. Discret. Comput. Geom. 61(2): 452-463 (2019) - [i10]Sergey Avvakumov, Roman N. Karasev, Arkadiy Skopenkov:
Stronger counterexamples to the topological Tverberg conjecture. CoRR abs/1908.08731 (2019) - 2018
- [i9]Arkadiy Skopenkov:
Invariants of graph drawings in the plane. CoRR abs/1805.10237 (2018) - [i8]Arkadiy Skopenkov:
A short exposition of S. Parsa's theorem on intrinsic linking and non-realizability. CoRR abs/1808.08363 (2018) - 2017
- [i7]Arkadiy Skopenkov:
On the metastable Mabillard-Wagner conjecture. CoRR abs/1702.04259 (2017) - [i6]Arkadiy Skopenkov, Martin Tancer:
Hardness of almost embedding simplicial complexes in Rd. CoRR abs/1703.06305 (2017) - [i5]Arkadiy Skopenkov:
Eliminating higher-multiplicity intersections in the metastable dimension range. CoRR abs/1704.00143 (2017) - 2016
- [i4]Arkadiy Skopenkov:
A user's guide to disproof of topological Tverberg conjecture. CoRR abs/1605.05141 (2016) - [i3]Arkadiy Skopenkov:
Stability of intersections of graphs in the plane and the van Kampen obstruction. CoRR abs/1609.03727 (2016) - 2015
- [i2]Sergey Avvakumov, Isaac Mabillard, Arkadiy Skopenkov, Uli Wagner:
Eliminating Higher-Multiplicity Intersections, III. Codimension 2. CoRR abs/1511.03501 (2015)
2000 – 2009
- 2008
- [i1]Arkadiy Skopenkov:
On the Kuratowski graph planarity criterion. CoRR abs/0802.3820 (2008) - 2005
- [j1]Dusan Repovs, Arkadiy Skopenkov, Fulvia Spaggiari:
An infinite sequence of non-realizable weavings. Discret. Appl. Math. 150(1-3): 256-260 (2005)
Coauthor Index
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.
last updated on 2025-03-01 15:14 CET 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:
