Extending continuous maps: polynomiality and undecidability. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Lukás Vokrínek; Uli Wagner 001 (STOC, 2013)

Computing the abelian heap of unpointed stable homotopy classes of maps. - Lukás Vokrínek (CoRR, 2013)

Extendability of Continuous Maps Is Undecidable. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Lukás Vokrínek; Uli Wagner 001 (Discret. Comput. Geom., 2014)

Computing All Maps into a Sphere. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Francis Sergeraert; Lukás Vokrínek; Uli Wagner 001 (J. ACM, 2014)

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension. - Martin Cadek; Marek Krcál; Jirí Matousek 001; Lukás Vokrínek; Uli Wagner 001 (SIAM J. Comput., 2014)

Algorithmic Solvability of the Lifting-Extension Problem. - Martin Cadek; Marek Krcál; Lukás Vokrínek (Discret. Comput. Geom., 2017)

Decidability of the Extension Problem for Maps into Odd-Dimensional Spheres. - Lukás Vokrínek (Discret. Comput. Geom., 2017)

Are Two Given Maps Homotopic? An Algorithmic Viewpoint. - Marek Filakovský; Lukás Vokrínek (Found. Comput. Math., 2020)

Computing Homotopy Classes for Diagrams. - Marek Filakovský; Lukás Vokrínek (Discret. Comput. Geom., 2023)