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 | Conference Paper | IST-REx-ID: 7806 | OA
Filakovský M, Wagner U, Zhechev SY. 2020. Embeddability of simplicial complexes is undecidable. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January. 767–785.
View | DOI | Download Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7807 | OA
Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2020–January. 2823–2841.
View | DOI | Download Submitted Version (ext.) | arXiv
 
2020 | Journal Article | IST-REx-ID: 6563 | OA
Filakovský M, Vokřínek L. 2020. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 20, 311–330.
View | DOI | Download Preprint (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7990 | OA
Wagner U, Welzl E. 2020. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7992 | OA
Patakova Z, Tancer M, Wagner U. 2020. Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164.
View | Files available | DOI | arXiv
 
2020 | Thesis | IST-REx-ID: 8156 | OA
Avvakumov S. 2020. Topological methods in geometry and discrete mathematics, IST Austria, 119p.
View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 8732
Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. 2020. Inserting one edge into a simple drawing is hard. Graph-Theoretic Concepts in Computer Science. WG: Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, vol. 12301. 325–338.
View | DOI
 
2020 | Thesis | IST-REx-ID: 8032 | OA
Huszár K. 2020. Combinatorial width parameters for 3-dimensional manifolds, IST Austria, xviii+120p.
View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 7994 | OA
Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7991 | OA
Avvakumov S, Nivasch G. 2020. Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164.
View | Files available | DOI | arXiv
 
2020 | Conference Paper | IST-REx-ID: 7989 | OA
Patakova Z. 2020. Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164.
View | Files available | DOI | arXiv
 
2020 | Thesis | IST-REx-ID: 7944 | OA
Masárová Z. 2020. Reconfiguration problems, IST Austria, 160p.
View | Files available | DOI
 
2020 | Journal Article | IST-REx-ID: 7960 | OA
Kalai G, Patakova Z. 2020. Intersection patterns of planar sets. Discrete and Computational Geometry. 64, 304–323.
View | DOI | Download Preprint (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 Preprint (ext.) | arXiv
 
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.
View | Files available | DOI | arXiv
 
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 Preprint (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 5857 | OA
Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.
View | Files available | DOI | Download Preprint (ext.) | 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: 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 Preprint (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
 

Search

Display / Sort

Citation Style: IST Annual Report

Export / Embed