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.
127 Publications
2020 | 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 | 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.)
2019 | Conference Paper | IST-REx-ID: 7401 |
Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry (SoCG 2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 5790 |
Chaplick S, Fulek R, Klavík P. Extending partial representations of circle graphs. Journal of Graph Theory. 2019;91(4):365-394. doi:10.1002/jgt.22436
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 5857 |
Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics. 2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 6638 |
Silva A, Arroyo Guevara AM, Richter B, Lee O. Graphs with at most one crossing. Discrete Mathematics. 2019;342(11):3201-3207. doi:10.1016/j.disc.2019.06.031
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7034 |
Fulek R, Kynčl J. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. 2019;39(6):1267-1279. doi:10.1007/s00493-019-3905-7
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7108 |
Goaoc X, Patak P, Patakova Z, Tancer M, Wagner U. Shellability is NP-complete. Journal of the ACM. 2019;66(3). doi:10.1145/3314024
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7230 |
Arroyo Guevara AM, Derka M, Parada I. Extending simple drawings. In: 27th International Symposium on Graph Drawing and Network Visualization. Vol 11904. Springer Nature; 2019:230-243. doi:10.1007/978-3-030-35802-0_18
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Thesis | IST-REx-ID: 6681 |
Zhechev SY. Algorithmic aspects of homotopy theory and embeddability. 2019. doi:10.15479/AT:ISTA:6681
[Published Version]
View
| Files available
| DOI
2019 | Preprint | IST-REx-ID: 8182 |
Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2019 | Preprint | IST-REx-ID: 8185 |
Avvakumov S, Karasev R. Envy-free division using mapping degree. arXiv. doi:10.48550/arXiv.1907.11183
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Journal Article | IST-REx-ID: 5986 |
Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 2019;61(4):880-898. doi:10.1007/s00454-018-0035-8
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 6556 |
Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:44:1-44:20. doi:10.4230/LIPIcs.SoCG.2019.44
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 7093 |
Huszár K, Spreer J, Wagner U. On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. 2019;10(2):70–98. doi:10.20382/JOGC.V10I2A5
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Preprint | IST-REx-ID: 8184 |
Avvakumov S, Karasev R, Skopenkov A. Stronger counterexamples to the topological Tverberg conjecture. arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 6982 |
Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. 2019;15(4). doi:10.1145/3344549
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | 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 | Preprint | IST-REx-ID: 7950 |
Biniaz A, Jain K, Lubiw A, et al. Token swapping on trees. arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 185 |
Fulek R, Kynčl J. Hanani-Tutte for approximating maps of graphs. In: Vol 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.SoCG.2018.39
[Published Version]
View
| Files available
| DOI