Algorithmic solvability of the lifting extension problem
M. cadek, M. Krcál, L. Vokínek, Discrete &; Computational Geometry 54 (2017) 915–965.

Persistence of zero sets
P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.

On computability and triviality of well groups
P. Franek, M. Krcál, Discrete &; Computational Geometry 56 (2016) 126–164.

Computation of cubical Steenrod squares
M. Krcál, P. Pilarczyk, in:, Springer, 2016, pp. 140–151.

On computability and triviality of well groups
P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–856.

Robust satisfiability of systems of equations
P. Franek, M. Krcál, Journal of the ACM 62 (2015).

Computing all maps into a sphere
M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, U. Wagner, Journal of the ACM 61 (2014).

On the geometric ramsey number of outerplanar graphs
J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &; Computational Geometry 53 (2014) 64–79.

Extending continuous maps: Polynomiality and undecidability
M. cadek, M. Krcál, J. Matousek, L. Vokínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604.

Computing all maps into a sphere
M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, U. Wagner, in:, SIAM, 2012, pp. 1–10.