Proof of Schur's conjecture in ℝd. - Andrey B. Kupavskii; Alexandr Polyanskii (CoRR, 2014)

Multiple Transversals Greedily. - Márton Naszódi; Alexandr Polyanskii (CoRR, 2016)

Proof of Schur's Conjecture in ℝ D. - Andrey B. Kupavskii; Alexandr Polyanskii (Comb., 2017)

Pairwise intersecting homothets of a convex body. - Alexandr Polyanskii (Electron. Notes Discret. Math., 2017)

Hunting for Reduced Polytopes. - Bernardo González Merino; Thomas Jahn; Alexandr Polyanskii; Gerd Wachsmuth (Discret. Comput. Geom., 2018)

Approximating set multi-covers. - Márton Naszódi; Alexandr Polyanskii (Eur. J. Comb., 2018)

On Almost-Equidistant Sets - II. - Alexandr Polyanskii (Electron. J. Comb., 2019)

A One-Page Solution of a Problem of Erdős and Purdy. - Rom Pinchasi; Alexandr Polyanskii (Discret. Comput. Geom., 2020)

A Cap Covering Theorem. - Alexandr Polyanskii (Comb., 2021)

Perron and Frobenius Meet Carathéodory. - Márton Naszódi; Alexandr Polyanskii (Electron. J. Comb., 2021)

On a Tverberg graph. - Olimjoni Pirahmad; Alexandr Polyanskii; Alexey Vasilevskii (CoRR, 2021)

Disjoint Edges in Geometric Graphs. - Nikita Chernega; Alexandr Polyanskii; Rinat Sadykov (Graphs Comb., 2022)

Intersecting balls induced by a geometric graph II. - Polina Barabanshchikova; Alexandr Polyanskii (CoRR, 2023)

Alon-Boppana-Type Bounds for Weighted Graphs. - Alexandr Polyanskii; Rynat Sadykov (Electron. J. Comb., 2024)

Intersecting diametral balls induced by a geometric graph II. - Polina Barabanshchikova; Alexandr Polyanskii (Discret. Math., 2024)

Intersecting ellipses induced by a max-sum matching. - Polina Barabanshchikova; Alexandr Polyanskii (J. Glob. Optim., 2024)

Intersecting Diametral Balls Induced by a Geometric Graph. - Olimjoni Pirahmad; Alexandr Polyanskii; Alexey Vasilevskii (Discret. Comput. Geom., 2024)