An infinite sequence of non-realizable weavings. - Dusan Repovs; Arkadiy Skopenkov; Fulvia Spaggiari (Discret. Appl. Math., 2005)

On the Kuratowski graph planarity criterion. - Arkadiy Skopenkov (CoRR, 2008)

Eliminating Higher-Multiplicity Intersections, III. Codimension 2. - Sergey Avvakumov; Isaac Mabillard; Arkadiy Skopenkov; Uli Wagner 001 (CoRR, 2015)

A user's guide to disproof of topological Tverberg conjecture. - Arkadiy Skopenkov (CoRR, 2016)

Stability of intersections of graphs in the plane and the van Kampen obstruction. - Arkadiy Skopenkov (CoRR, 2016)

On the metastable Mabillard-Wagner conjecture. - Arkadiy Skopenkov (CoRR, 2017)

Eliminating higher-multiplicity intersections in the metastable dimension range. - Arkadiy Skopenkov (CoRR, 2017)

Invariants of graph drawings in the plane. - Arkadiy Skopenkov (CoRR, 2018)

A short exposition of S. Parsa's theorem on intrinsic linking and non-realizability. - Arkadiy Skopenkov (CoRR, 2018)

Hardness of almost embedding simplicial complexes in Rd. - Arkadiy Skopenkov; Martin Tancer (Discret. Comput. Geom., 2019)

A user's guide to basic knot and link theory. - Arkadiy Skopenkov (CoRR, 2020)

A structured proof of the Kolmogorov superposition theorem. - S. Dzhenzher; Arkadiy Skopenkov (CoRR, 2021)

A short exposition of the Patak-Tancer theorem on non-embeddability of k-complexes in 2k-manifolds. - E. Kogan; Arkadiy Skopenkov (CoRR, 2021)

Simple proofs of estimations of Ramsey numbers and of discrepancy. - A. Buchaev; Arkadiy Skopenkov (CoRR, 2021)

Embeddings of k-complexes in 2k-manifolds and minimum rank of partial symmetric matrices. - E. Kogan; Arkadiy Skopenkov (CoRR, 2021)

A Short Exposition of Salman Parsa's Theorems on Intrinsic Linking and Non-realizability. - Arkadiy Skopenkov (Discret. Comput. Geom., 2021)

To the Kühnel conjecture on embeddability of k-complexes in 2k-manifolds. - S. Dzhenzher; Arkadiy Skopenkov (CoRR, 2022)

Cycles in graphs and in hypergraphs. - Emil Alkin; S. Dzhenzher; O. Nikitenko; Arkadiy Skopenkov; A. Voropaev (CoRR, 2023)

Extendability of Simplicial Maps is Undecidable. - Arkadiy Skopenkov (Discret. Comput. Geom., 2023)

Stronger Counterexamples to the Topological Tverberg Conjecture. - Sergey Avvakumov; Roman N. Karasev; Arkadiy Skopenkov (Comb., 2023)

Some 'Converses' to Intrinsic Linking Theorems. - Roman N. Karasev; Arkadiy Skopenkov (Discret. Comput. Geom., 2023)

Cycles in graphs and in hypergraphs (in Russian). - S. Dzhenzher; Alexander Miroshnikov; O. Nikitenko; Arkadiy Skopenkov (CoRR, 2024)

Invariants of almost embeddings of graphs in the plane: results and problems. - Emil Alkin; E. Bordacheva; Alexander Miroshnikov; O. Nikitenko; Arkadiy Skopenkov (CoRR, 2024)

Invariants of almost embeddings of graphs in the plane. - Emil Alkin; E. Bordacheva; Alexander Miroshnikov; Arkadiy Skopenkov (CoRR, 2024)