Marek Krcál
Wagner Group
Edelsbrunner Group
10 Publications
2017 | Journal Article | IST-REx-ID: 568 | 
Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Journal Article | IST-REx-ID: 1073 |
Čadek, M., Krcál, M., & Vokřínek, L. (2017). Algorithmic solvability of the lifting extension problem. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-016-9855-6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2016 | Conference Paper | IST-REx-ID: 1237
Krcál, M., & Pilarczyk, P. (2016). Computation of cubical Steenrod squares (Vol. 9667, pp. 140–151). Presented at the CTIC: Computational Topology in Image Context, Marseille, France: Springer. https://doi.org/10.1007/978-3-319-39441-1_13
View
| DOI
2016 | Journal Article | IST-REx-ID: 1408 |
Franek, P., & Krcál, M. (2016). On computability and triviality of well groups. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-016-9794-2
[Published Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1510 |
Franek, P., & Krcál, M. (2015). On computability and triviality of well groups (Vol. 34, pp. 842–856). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.842
[Published Version]
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1682 |
Franek, P., & Krcál, M. (2015). Robust satisfiability of systems of equations. Journal of the ACM. ACM. https://doi.org/10.1145/2751524
[Preprint]
View
| DOI
| Download Preprint (ext.)
2014 | Journal Article | IST-REx-ID: 1842 |
Cibulka, J., Gao, P., Krcál, M., Valla, T., & Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9646-x
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Journal Article | IST-REx-ID: 2184 |
Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., & Wagner, U. (2014). Computing all maps into a sphere. Journal of the ACM. ACM. https://doi.org/10.1145/2597629
[Preprint]
View
| DOI
| Download Preprint (ext.)
2013 | Conference Paper | IST-REx-ID: 2807 |
Čadek, M., Krcál, M., Matoušek, J., Vokřínek, L., & Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In 45th Annual ACM Symposium on theory of computing (pp. 595–604). Palo Alto, CA, United States: ACM. https://doi.org/10.1145/2488608.2488683
[Submitted Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2440
Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., & Wagner, U. (2012). Computing all maps into a sphere (pp. 1–10). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View
| Download (ext.)
10 Publications
2017 | Journal Article | IST-REx-ID: 568 |
Franek, P., & Krcál, M. (2017). Persistence of zero sets. Homology, Homotopy and Applications. International Press. https://doi.org/10.4310/HHA.2017.v19.n2.a16
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Journal Article | IST-REx-ID: 1073 |
Čadek, M., Krcál, M., & Vokřínek, L. (2017). Algorithmic solvability of the lifting extension problem. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-016-9855-6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2016 | Conference Paper | IST-REx-ID: 1237
Krcál, M., & Pilarczyk, P. (2016). Computation of cubical Steenrod squares (Vol. 9667, pp. 140–151). Presented at the CTIC: Computational Topology in Image Context, Marseille, France: Springer. https://doi.org/10.1007/978-3-319-39441-1_13
View
| DOI
2016 | Journal Article | IST-REx-ID: 1408 |
Franek, P., & Krcál, M. (2016). On computability and triviality of well groups. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-016-9794-2
[Published Version]
View
| Files available
| DOI
2015 | Conference Paper | IST-REx-ID: 1510 |
Franek, P., & Krcál, M. (2015). On computability and triviality of well groups (Vol. 34, pp. 842–856). Presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SOCG.2015.842
[Published Version]
View
| Files available
| DOI
2015 | Journal Article | IST-REx-ID: 1682 |
Franek, P., & Krcál, M. (2015). Robust satisfiability of systems of equations. Journal of the ACM. ACM. https://doi.org/10.1145/2751524
[Preprint]
View
| DOI
| Download Preprint (ext.)
2014 | Journal Article | IST-REx-ID: 1842 |
Cibulka, J., Gao, P., Krcál, M., Valla, T., & Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9646-x
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Journal Article | IST-REx-ID: 2184 |
Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., & Wagner, U. (2014). Computing all maps into a sphere. Journal of the ACM. ACM. https://doi.org/10.1145/2597629
[Preprint]
View
| DOI
| Download Preprint (ext.)
2013 | Conference Paper | IST-REx-ID: 2807 |
Čadek, M., Krcál, M., Matoušek, J., Vokřínek, L., & Wagner, U. (2013). Extending continuous maps: Polynomiality and undecidability. In 45th Annual ACM Symposium on theory of computing (pp. 595–604). Palo Alto, CA, United States: ACM. https://doi.org/10.1145/2488608.2488683
[Submitted Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2440
Čadek, M., Krcál, M., Matoušek, J., Sergeraert, F., Vokřínek, L., & Wagner, U. (2012). Computing all maps into a sphere (pp. 1–10). Presented at the SODA: Symposium on Discrete Algorithms, SIAM.
View
| Download (ext.)