The complexity of nonrepetitive edge coloring of graphs - Fedor Manin (CoRR, 2007)

Algorithmic aspects of immersibility and embeddability. - Fedor Manin; Shmuel Weinberger (CoRR, 2018)

A hardness of approximation result in metric geometry. - Zarathustra Brady; Larry Guth; Fedor Manin (CoRR, 2019)

High-Dimensional Holeyominoes. - Greg Malen; Fedor Manin; Erika Berenice Roldan-Roa (Electron. J. Comb., 2022)

Topology and Local Geometry of the Eden Model. - Fedor Manin; Érika Roldán; Benjamin Schweinhart (Discret. Comput. Geom., 2023)

Rational Homotopy Type and Computability. - Fedor Manin (Found. Comput. Math., 2023)

Local behavior of the Eden model on graphs and tessellations of manifolds. - Dongming Merrick Hua; Fedor Manin; Tahda Queer; Tianyi Wang (J. Appl. Comput. Topol., 2024)