Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
133 Publications
2021 | Published | Journal Article | IST-REx-ID: 10220 | 
Avvakumov S, Mabillard I, Skopenkov AB, Wagner U. Eliminating higher-multiplicity intersections. III. Codimension 2. Israel Journal of Mathematics. 2021;245:501–534. doi:10.1007/s11856-021-2216-z
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 10856 |
Ivanov G, Tsiutsiurupa I. On the volume of sections of the cube. Analysis and Geometry in Metric Spaces. 2021;9(1):1-18. doi:10.1515/agms-2020-0103
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 10860 |
Ivanov G. Tight frames and related geometric problems. Canadian Mathematical Bulletin. 2021;64(4):942-963. doi:10.4153/s000843952000096x
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8732
Arroyo Guevara AM, Klute F, Parada I, Seidel R, Vogtenhuber B, Wiedera T. Inserting one edge into a simple drawing is hard. In: Graph-Theoretic Concepts in Computer Science. Vol 12301. Springer Nature; 2020:325-338. doi:10.1007/978-3-030-60440-0_26
View
| DOI
2020 | Published | Journal Article | IST-REx-ID: 9308 |
Avvakumov S, Wagner U, Mabillard I, Skopenkov AB. Eliminating higher-multiplicity intersections, III. Codimension 2. Russian Mathematical Surveys. 2020;75(6):1156-1158. doi:10.1070/RM9943
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Published | Thesis | IST-REx-ID: 7944 |
Masárová Z. Reconfiguration problems. 2020. doi:10.15479/AT:ISTA:7944
[Published Version]
View
| Files available
| DOI
2020 | Published | Thesis | IST-REx-ID: 8156 |
Avvakumov S. Topological methods in geometry and discrete mathematics. 2020. doi:10.15479/AT:ISTA:8156
[Published Version]
View
| Files available
| DOI
2020 | Published | Conference Paper | IST-REx-ID: 15082 |
Aichholzer O, Obmann J, Patak P, Perz D, Tkadlec J. Disjoint tree-compatible plane perfect matchings. In: 36th European Workshop on Computational Geometry. ; 2020.
[Published Version]
View
| Download Published Version (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 7806 |
Filakovský M, Wagner U, Zhechev SY. Embeddability of simplicial complexes is undecidable. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:767-785. doi:10.1137/1.9781611975994.47
[Published Version]
View
| DOI
| Download Published Version (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 7807 |
Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part I: Edge flips). In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol 2020-January. SIAM; 2020:2823-2841. doi:10.1137/1.9781611975994.172
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2020 | Published | Journal Article | IST-REx-ID: 7960 |
Kalai G, Patakova Z. Intersection patterns of planar sets. Discrete and Computational Geometry. 2020;64:304-323. doi:10.1007/s00454-020-00205-z
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7989 |
Patakova Z. Bounding radon number via Betti numbers. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.61
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7990 |
Wagner U, Welzl E. Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips). In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.67
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7991 |
Avvakumov S, Nivasch G. Homotopic curve shortening and the affine curve-shortening flow. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.12
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7992 |
Patakova Z, Tancer M, Wagner U. Barycentric cuts through a convex body. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.62
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7994 |
Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.9
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Thesis | IST-REx-ID: 8032 |
Huszár K. Combinatorial width parameters for 3-dimensional manifolds. 2020. doi:10.15479/AT:ISTA:8032
[Published Version]
View
| Files available
| DOI
2020 | Published | Journal Article | IST-REx-ID: 6563 |
Filakovský M, Vokřínek L. Are two given maps homotopic? An algorithmic viewpoint. Foundations of Computational Mathematics. 2020;20:311-330. doi:10.1007/s10208-019-09419-x
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6647 |
Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:38:1-38:13. doi:10.4230/LIPICS.SOCG.2019.38
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Draft | Preprint | IST-REx-ID: 7950 |
Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv. doi:10.48550/arXiv.1903.06981
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv