P. Franek and M. Krcál, “Persistence of zero sets,” Homology, Homotopy and Applications, vol. 19, no. 2. International Press, pp. 313–342, 2017.

M. cadek, M. Krcál, and L. Vokínek, “Algorithmic solvability of the lifting extension problem,” Discrete &; Computational Geometry, vol. 54, no. 4. Springer, pp. 915–965, 2017.

M. Krcál and P. Pilarczyk, “Computation of cubical Steenrod squares,” presented at the CTIC: Computational Topology in Image Context, Marseille, France, 2016, vol. 9667, pp. 140–151.

P. Franek and M. Krcál, “On computability and triviality of well groups,” Discrete &; Computational Geometry, vol. 56, no. 1. Springer, pp. 126–164, 2016.

P. Franek and M. Krcál, “On computability and triviality of well groups,” presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands, 2015, vol. 34, pp. 842–856.

P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” Journal of the ACM, vol. 62, no. 4. ACM, 2015.

J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete &; Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.

M. cadek, M. Krcál, J. Matousek, L. Vokínek, and U. Wagner, “Extending continuous maps: Polynomiality and undecidability,” in 45th Annual ACM Symposium on theory of computing, Palo Alto, CA, United States, 2013, pp. 595–604.

M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, and U. Wagner, “Computing all maps into a sphere,” presented at the SODA: Symposium on Discrete Algorithms, 2012, pp. 1–10.