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 | OA
Avvakumov, S. (2020). Topological methods in geometry and discrete mathematics. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8156
[Published Version] View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 15082 | OA
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.
[Published Version] View | Download Published Version (ext.)
 
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. 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
[Published Version] 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. Wiley. https://doi.org/10.1002/jgt.22436
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Journal Article | IST-REx-ID: 5857 | OA
Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Journal Article | IST-REx-ID: 6638 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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. Springer Nature. https://doi.org/10.1007/s00493-019-3905-7
[Preprint] View | DOI | Download Preprint (ext.) | WoS | 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. ACM. https://doi.org/10.1145/3314024
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 7230 | OA
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
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Thesis | IST-REx-ID: 6681 | OA
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
[Published Version] View | Files available | DOI
 
2019 | Preprint | IST-REx-ID: 8182 | OA
Avvakumov, S., & Kudrya, S. (n.d.). Vanishing of all equivariant obstructions and the mapping degree. arXiv. arXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2019 | Preprint | IST-REx-ID: 8185 | OA
Avvakumov, S., & Karasev, R. (n.d.). Envy-free division using mapping degree. arXiv. https://doi.org/10.48550/arXiv.1907.11183
[Preprint] 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. Springer Nature. https://doi.org/10.1007/s00454-018-0035-8
[Published Version] View | Files available | DOI | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6556 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 7093 | OA
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
[Published Version] View | Files available | DOI | arXiv
 
2019 | Preprint | IST-REx-ID: 8184 | OA
Avvakumov, S., Karasev, R., & Skopenkov, A. (n.d.). Stronger counterexamples to the topological Tverberg conjecture. arXiv. arXiv.
[Preprint] View | Files available | Download Preprint (ext.) | WoS | arXiv
 
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. ACM. https://doi.org/10.1145/3344549
[Preprint] View | Files available | 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. 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
[Published Version] View | Files available | DOI | arXiv
 
2019 | Preprint | IST-REx-ID: 7950 | OA
Biniaz, A., Jain, K., Lubiw, A., Masárová, Z., Miltzow, T., Mondal, D., … Turcotte, A. (n.d.). Token swapping on trees. arXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 185 | OA
Fulek, R., & Kynčl, 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
[Published Version] View | Files available | DOI
 

Search

Filter Publications