Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.”10.4230/LIPIcs.SoCG.2020.62__36th International Symposium on Computational Geometry, vol. 164, 62:1-62:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.62.
LibreCat: https://research-explorer.ista.ac.at/record/7992
DOI: 10.4230/LIPIcs.SoCG.2020.62
arXiv: 2003.13536

Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.”10.4230/LIPIcs.SoCG.2020.9__36th International Symposium on Computational Geometry, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.9.
LibreCat: https://research-explorer.ista.ac.at/record/7994
DOI: 10.4230/LIPIcs.SoCG.2020.9
arXiv: 1804.09317

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).”10.4230/LIPIcs.SoCG.2020.67__36th International Symposium on Computational Geometry, vol. 164, 67:1-67:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.67.
LibreCat: https://research-explorer.ista.ac.at/record/7990
DOI: 10.4230/LIPIcs.SoCG.2020.67
arXiv: 2003.13557

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).”10.1137/1.9781611975994.172__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2020–January, SIAM, 2020, pp. 2823–41, doi:10.1137/1.9781611975994.172.
LibreCat: https://research-explorer.ista.ac.at/record/7807
DOI: 10.1137/1.9781611975994.172
arXiv: 2003.13557

Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.”10.1070/RM9943__Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.
LibreCat: https://research-explorer.ista.ac.at/record/9308
DOI: 10.1070/RM9943
WoS: 000625983100001
arXiv: 1511.03501

Filakovský, Marek, and Lukas Vokínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.”10.1007/s10208-019-09419-x__Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
LibreCat: https://research-explorer.ista.ac.at/record/6563
DOI: 10.1007/s10208-019-09419-x
WoS: 000522437400004
arXiv: 1312.2337

Kalai, Gil, and Zuzana Patakova. “Intersection Patterns of Planar Sets.”10.1007/s00454-020-00205-z__Discrete and Computational Geometry, vol. 64, Springer Nature, 2020, pp. 304–23, doi:10.1007/s00454-020-00205-z.
LibreCat: https://research-explorer.ista.ac.at/record/7960
DOI: 10.1007/s00454-020-00205-z
WoS: 000537329400001
arXiv: 1907.00885

Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.”10.1007/978-3-030-60440-0_26__Graph-Theoretic Concepts in Computer Science, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:10.1007/978-3-030-60440-0_26.
LibreCat: https://research-explorer.ista.ac.at/record/8732
DOI: 10.1007/978-3-030-60440-0_26

Masárová, Zuzana. Reconfiguration Problems. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7944.
LibreCat: https://research-explorer.ista.ac.at/record/7944
DOI: 10.15479/AT:ISTA:7944

Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8032.
LibreCat: https://research-explorer.ista.ac.at/record/8032
DOI: 10.15479/AT:ISTA:8032

Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8156.
LibreCat: https://research-explorer.ista.ac.at/record/8156
DOI: 10.15479/AT:ISTA:8156

Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/15082

Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.”10.4230/LIPICS.SOCG.2019.39__35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi: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, Steven, et al. “Extending Partial Representations of Circle Graphs.”10.1002/jgt.22436__Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
LibreCat: https://research-explorer.ista.ac.at/record/5790
DOI: 10.1002/jgt.22436
WoS: 000485392800004
arXiv: 1309.2399

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.”10.1016/j.dam.2018.12.025__Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi: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, André, et al. “Graphs with at Most One Crossing.”10.1016/j.disc.2019.06.031__Discrete Mathematics, vol. 342, no. 11, Elsevier, 2019, pp. 3201–07, doi: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, Radoslav, and Jan Kyndl. “Counterexample to an Extension of the Hanani-Tutte Theorem on the Surface of Genus 4.”10.1007/s00493-019-3905-7__Combinatorica, vol. 39, no. 6, Springer Nature, 2019, pp. 1267–79, doi: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, Xavier, et al. “Shellability Is NP-Complete.”10.1145/3314024__Journal of the ACM, vol. 66, no. 3, 21, ACM, 2019, doi:10.1145/3314024.
LibreCat: https://research-explorer.ista.ac.at/record/7108
DOI: 10.1145/3314024
WoS: 000495406300007
arXiv: 1711.08436

Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.”10.1007/978-3-030-35802-0_18__27th International Symposium on Graph Drawing and Network Visualization, vol. 11904, Springer Nature, 2019, pp. 230–43, doi: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, Stephan Y. Algorithmic Aspects of Homotopy Theory and Embeddability. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6681.
LibreCat: https://research-explorer.ista.ac.at/record/6681
DOI: 10.15479/AT:ISTA:6681