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, Sergey. “Topological Methods in Geometry and Discrete Mathematics.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:8156.
[Published Version] View | Files available | DOI
 
2020 | Conference Paper | IST-REx-ID: 15082 | OA
Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “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 | OA
Fulek, Radoslav, and Jan Kyncl. “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. 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, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial Representations of Circle Graphs.” Journal of Graph Theory. Wiley, 2019. https://doi.org/10.1002/jgt.22436.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Journal Article | IST-REx-ID: 5857 | OA
Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics. Elsevier, 2019. 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, André , Alan M Arroyo Guevara, Bruce Richter, and Orlando Lee. “Graphs with at Most One Crossing.” Discrete Mathematics. Elsevier, 2019. 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, Radoslav, and Jan Kynčl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.” Combinatorica. Springer Nature, 2019. 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, Xavier, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner. “Shellability Is NP-Complete.” Journal of the ACM. ACM, 2019. 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, Alan M, Martin Derka, and Irene Parada. “Extending Simple Drawings.” In 27th International Symposium on Graph Drawing and Network Visualization, 11904:230–43. Springer Nature, 2019. 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, Stephan Y. “Algorithmic Aspects of Homotopy Theory and Embeddability.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6681.
[Published Version] View | Files available | DOI
 
2019 | Preprint | IST-REx-ID: 8182 | OA
Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv. arXiv, n.d.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2019 | Preprint | IST-REx-ID: 8185 | OA
Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, n.d. 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, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry. Springer Nature, 2019. 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, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small Treewidth.” In 35th International Symposium on Computational Geometry, 129:44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. 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, Kristóf, Jonathan Spreer, and Uli Wagner. “On the Treewidth of Triangulated 3-Manifolds.” Journal of Computational Geometry. Computational Geometry Laborartoy, 2019. https://doi.org/10.20382/JOGC.V10I2A5.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Preprint | IST-REx-ID: 8184 | OA
Avvakumov, Sergey, R. Karasev, and A. Skopenkov. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv. arXiv, n.d.
[Preprint] View | Files available | Download Preprint (ext.) | WoS | arXiv
 
2019 | Journal Article | IST-REx-ID: 6982 | OA
Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs.” ACM Transactions on Algorithms. ACM, 2019. https://doi.org/10.1145/3344549.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6647 | OA
Fulek, Radoslav, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner. “The Crossing Tverberg Theorem.” In 35th International Symposium on Computational Geometry, 129:38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.SOCG.2019.38.
[Published Version] View | Files available | DOI | arXiv
 
2019 | Preprint | IST-REx-ID: 7950 | OA
Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” ArXiv, n.d.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 185 | OA
Fulek, Radoslav, and Jan Kynčl. “Hanani-Tutte for Approximating Maps of Graphs,” Vol. 99. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.SoCG.2018.39.
[Published Version] View | Files available | DOI
 

Search

Filter Publications