Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




87 Publications

2020 | Journal Article | IST-REx-ID: 6563 | OA
Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
View | DOI | Download Preprint (ext.) | arXiv
 
2020 | Journal Article | IST-REx-ID: 7960 | OA
Kalai, Gil, and Zuzana Patakova. “Intersection Patterns of Planar Sets.” Discrete and Computational Geometry, vol. 64, Springer Nature, 2020, pp. 304–23, doi:10.1007/s00454-020-00205-z.
View | DOI | Download Preprint (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7989 | OA
Patakova, Zuzana. “Bounding Radon Number via Betti Numbers.” 36th International Symposium on Computational Geometry, vol. 164, 61:1-61:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.61.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7990 | OA
Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” 36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7991 | OA
Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7992 | OA
Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7994 | OA
Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.
View | Files available | DOI | arXiv
 
2020 | Thesis | IST-REx-ID: 7944 | OA
Masárová, Zuzana. Reconfiguration Problems. IST Austria, 2020, doi:10.15479/AT:ISTA:7944.
View | Files available | DOI
 
2020 | Thesis | IST-REx-ID: 8032 | OA
Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds. IST Austria, 2020, doi:10.15479/AT:ISTA:8032.
View | Files available | DOI
 
2020 | Thesis | IST-REx-ID: 8156 | OA
Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. IST Austria, 2020, doi:10.15479/AT:ISTA:8156.
View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský, Marek, et al. “Embeddability of Simplicial Complexes Is Undecidable.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 767–85, doi:10.1137/1.9781611975994.47.
View | DOI | Download Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7807 | OA
Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.
View | DOI | Download Submitted Version (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 8732
Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.” Graph-Theoretic Concepts in Computer Science, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:10.1007/978-3-030-60440-0_26.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 5790 | OA
Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.” Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
View | DOI | Download Preprint (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 5857 | OA
Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6638 | OA
Silva, André, et al. “Graphs with at Most One Crossing.” Discrete Mathematics, vol. 342, no. 11, Elsevier, 2019, pp. 3201–07, doi:10.1016/j.disc.2019.06.031.
View | DOI | Download Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6647 | OA
Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.
View | Files available | DOI | arXiv
 
2019 | Thesis | IST-REx-ID: 6681 | OA
Zhechev, Stephan Y. Algorithmic Aspects of Homotopy Theory and Embeddability. IST Austria, 2019, doi:10.15479/AT:ISTA:6681.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6982 | OA
Akitaya, Hugo, et al. “Recognizing Weak Embeddings of Graphs.” ACM Transactions on Algorithms, vol. 15, no. 4, 50, ACM, 2019, doi:10.1145/3344549.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 7034 | OA
Fulek, Radoslav, and Jan Kynčl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.” Combinatorica, vol. 39, no. 6, Springer Nature, 2019, pp. 1267–79, doi:10.1007/s00493-019-3905-7.
View | DOI | Download Preprint (ext.) | arXiv
 

Search

Filter Publications