Avvakumov, S. (2020). Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:8156 
LibreCat: https://research-explorer.ista.ac.at/record/8156
DOI: 10.15479/AT:ISTA:8156

Aichholzer, O., Obmann, J., Patak, P., Perz, D., &; Tkadlec, J. (2020). Disjoint tree-compatible plane perfect matchings. In 36th European Workshop on Computational Geometry. Würzburg, Germany, Virtual.
LibreCat: https://research-explorer.ista.ac.at/record/15082

Fulek, R., &; Kyncl, J. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SOCG.2019.39 
LibreCat: https://research-explorer.ista.ac.at/record/7401
DOI: 10.4230/LIPICS.SOCG.2019.39
arXiv: 1903.08637

Chaplick, S., Fulek, R., &; Klavík, P. (2019). Extending partial representations of circle graphs. Journal of Graph Theory. Wiley.https://doi.org/10.1002/jgt.22436 
LibreCat: https://research-explorer.ista.ac.at/record/5790
DOI: 10.1002/jgt.22436
WoS: 000485392800004
arXiv: 1309.2399

Fulek, R., &; Pach, J. (2019). Thrackles: An improved upper bound. Discrete Applied Mathematics. Elsevier.https://doi.org/10.1016/j.dam.2018.12.025 
LibreCat: https://research-explorer.ista.ac.at/record/5857
DOI: 10.1016/j.dam.2018.12.025
WoS: 000466061100020
arXiv: 1708.08037

Silva, A., Arroyo Guevara, A. M., Richter, B., &; Lee, O. (2019). Graphs with at most one crossing. Discrete Mathematics. Elsevier.https://doi.org/10.1016/j.disc.2019.06.031 
LibreCat: https://research-explorer.ista.ac.at/record/6638
DOI: 10.1016/j.disc.2019.06.031
WoS: 000486358100025
arXiv: 1901.09955

Fulek, R., &; Kyndl, J. (2019). Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica. Springer Nature.https://doi.org/10.1007/s00493-019-3905-7 
LibreCat: https://research-explorer.ista.ac.at/record/7034
DOI: 10.1007/s00493-019-3905-7
WoS: 000493267200003
arXiv: 1709.00508

Goaoc, X., Patak, P., Patakova, Z., Tancer, M., &; Wagner, U. (2019). Shellability is NP-complete. Journal of the ACM. ACM.https://doi.org/10.1145/3314024 
LibreCat: https://research-explorer.ista.ac.at/record/7108
DOI: 10.1145/3314024
WoS: 000495406300007
arXiv: 1711.08436

Arroyo Guevara, A. M., Derka, M., &; Parada, I. (2019). Extending simple drawings. In 27th International Symposium on Graph Drawing and Network Visualization (Vol. 11904, pp. 230–243). Prague, Czech Republic: Springer Nature.https://doi.org/10.1007/978-3-030-35802-0_18 
LibreCat: https://research-explorer.ista.ac.at/record/7230
DOI: 10.1007/978-3-030-35802-0_18
WoS: 000612918800018
arXiv: 1908.08129

Zhechev, S. Y. (2019). Algorithmic aspects of homotopy theory and embeddability. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:6681 
LibreCat: https://research-explorer.ista.ac.at/record/6681
DOI: 10.15479/AT:ISTA:6681

Avvakumov, S., &; Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. arXiv. arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/8182
arXiv: 1910.12628

Avvakumov, S., &; Karasev, R. (n.d.). Envy-free division using mapping degree. arXiv.https://doi.org/10.48550/arXiv.1907.11183 
LibreCat: https://research-explorer.ista.ac.at/record/8185
DOI: 10.48550/arXiv.1907.11183
arXiv: 1907.11183

Lubiw, A., Masárová, Z., &; Wagner, U. (2019). A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete &; Computational Geometry. Springer Nature.https://doi.org/10.1007/s00454-018-0035-8 
LibreCat: https://research-explorer.ista.ac.at/record/5986
DOI: 10.1007/s00454-018-0035-8
WoS: 000466130000009
arXiv: 1710.02741

Huszár, K., &; Spreer, J. (2019). 3-manifold triangulations with small treewidth. In 35th International Symposium on Computational Geometry (Vol. 129, p. 44:1-44:20). Portland, Oregon, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2019.44 
LibreCat: https://research-explorer.ista.ac.at/record/6556
DOI: 10.4230/LIPIcs.SoCG.2019.44
arXiv: 1812.05528

Huszár, K., Spreer, J., &; Wagner, U. (2019). On the treewidth of triangulated 3-manifolds. Journal of Computational Geometry. Computational Geometry Laborartoy.https://doi.org/10.20382/JOGC.V10I2A5 
LibreCat: https://research-explorer.ista.ac.at/record/7093
DOI: 10.20382/JOGC.V10I2A5
arXiv: 1712.00434

Avvakumov, S., Karasev, R., &; Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/8184
WoS: 000986519600004
arXiv: 1908.08731

Akitaya, H., Fulek, R., &; Tóth, C. (2019). Recognizing weak embeddings of graphs. ACM Transactions on Algorithms. ACM.https://doi.org/10.1145/3344549 
LibreCat: https://research-explorer.ista.ac.at/record/6982
DOI: 10.1145/3344549
arXiv: 1709.09209

Fulek, R., Gärtner, B., Kupavskii, A., Valtr, P., &; Wagner, U. (2019). The crossing Tverberg theorem. In 35th International Symposium on Computational Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.SOCG.2019.38 
LibreCat: https://research-explorer.ista.ac.at/record/6647
DOI: 10.4230/LIPICS.SOCG.2019.38
arXiv: 1812.04911

Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D.,  Turcotte, A. (n.d.). Token swapping on trees. arXiv.
LibreCat: https://research-explorer.ista.ac.at/record/7950
arXiv: 1903.06981

Fulek, R., &; Kyndl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.39 
LibreCat: https://research-explorer.ista.ac.at/record/185
DOI: 10.4230/LIPIcs.SoCG.2018.39