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.




70 Publications

2019 | Journal Article | IST-REx-ID: 5790   OA
Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of circle graphs. Journal of Graph Theory. 91(4), 365–394.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6647   OA
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. 2019. The crossing Tverberg theorem. 35th International Symposium on Computational Geometry. SoCG 2019: Symposium on Computational Geometry, LIPIcs, vol. 129. 38:1-38:13.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 7108   OA
Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. 2019. Shellability is NP-complete. Journal of the ACM. 66(3), 21.
View | Files available | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7230   OA
Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). GD: Graph Drawing and Network Visualization, LNCS, vol. 11904. 230–243.
View | DOI | Download (ext.) | arXiv
 
2019 | Thesis | IST-REx-ID: 6681
Zhechev SY. 2019. Algorithmic aspects of homotopy theory and embeddability, IST Austria, 104p.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 7401   OA
Fulek R, Kyncl J. 2019. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 129. 39.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 5986   OA
Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 61(4), 880–898.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 7034   OA
Fulek R, Kynčl J. 2019. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. 39(6), 1267–1279.
View | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6638   OA
Silva A, Arroyo Guevara AM, Richter B, Lee O. 2019. Graphs with at most one crossing. Discrete Mathematics. 342(11), 3201–3207.
View | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6563   OA
Filakovský M, Vokřínek L. 2019. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics.
View | DOI | Download (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6556   OA
Huszár K, Spreer J. 2019. 3-manifold triangulations with small treewidth. 35th International Symposium on Computational Geometry (SoCG 2019). SoCG: Symposium on Computational GeometryLeibniz International Proceedings in Informatics (LIPIcs) vol. 129. 44:1-44:20.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 5857
Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6982   OA
Akitaya H, Fulek R, Tóth C. 2019. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 15(4), 50.
View | Files available | DOI | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 7093
Huszár K, Spreer J, Wagner U. 2019. On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. 10(2), 70–98.
View | Files available | DOI | arXiv
 
2018 | Conference Paper | IST-REx-ID: 186   OA
Fulek R, Kynčl J. 2018. The ℤ2-Genus of Kuratowski minors. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 99. 401–4014.
View | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 6774   OA
Filakovský M, Franek P, Wagner U, Zhechev SY. 2018. Computing simplicial representatives of homotopy group elements. Journal of Applied and Computational Topology. 2(3–4), 177–231.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 5791   OA
Fulek R, Tóth CD. 2018. Crossing minimization in perturbed drawings. Graph Drawing and Network Visualization, LNCS, vol. 11282. 229–241.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 309
Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs. SODA: Symposium on Discrete Algorithms 274–292.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 425   OA
Matoušek J, Sedgwick E, Tancer M, Wagner U. 2018. Embeddability in the 3-Sphere is decidable. Journal of the ACM. 65(1), 5.
View | Files available | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 184
Goaoc X, Paták P, Patakova Z, Tancer M, Wagner U. 2018. Shellability is NP-complete. SoCG: Symposium on Computational Geometry, Leibniz International Proceedings in Information, LIPIcs, vol. 99. 41:1-41:16.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed