Lukás Vokrínek

According to our database, Lukás Vokrínek authored at least 9 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Computing Homotopy Classes for Diagrams.

Marek Filakovský, Lukás Vokrínek

Discret. Comput. Geom., October, 2023

2020

Are Two Given Maps Homotopic? An Algorithmic Viewpoint.

Marek Filakovský, Lukás Vokrínek

Found. Comput. Math., 2020

2017

Decidability of the Extension Problem for Maps into Odd-Dimensional Spheres.

Lukás Vokrínek

Discret. Comput. Geom., 2017

Algorithmic Solvability of the Lifting-Extension Problem.

Martin Cadek, Marek Krcál, Lukás Vokrínek

Discret. Comput. Geom., 2017

2014

Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

SIAM J. Comput., 2014

Extendability of Continuous Maps Is Undecidable.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

Discret. Comput. Geom., 2014

2013

Computing the abelian heap of unpointed stable homotopy classes of maps.

Lukás Vokrínek

CoRR, 2013

Extending continuous maps: polynomiality and undecidability.

Martin Cadek, Marek Krcál, Jirí Matousek, Lukás Vokrínek, Uli Wagner

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Computing all maps into a sphere.

Martin Cadek, Marek Krcál, Jirí Matousek, Francis Sergeraert, Lukás Vokrínek, Uli Wagner

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012