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.
125 Publications
2020 | Published | Conference Paper | IST-REx-ID: 7990 |

Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7991 |

Avvakumov, Sergey, and Gabriel Nivasch. “Homotopic Curve Shortening and the Affine Curve-Shortening Flow.” 36th International Symposium on Computational Geometry, vol. 164, 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.SoCG.2020.12.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7992 |

Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 7994 |

Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” 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.
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Thesis | IST-REx-ID: 8032 |

Huszár, Kristóf. Combinatorial Width Parameters for 3-Dimensional Manifolds. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8032.
[Published Version]
View
| Files available
| DOI
2020 | Published | Thesis | IST-REx-ID: 8156 |

Avvakumov, Sergey. Topological Methods in Geometry and Discrete Mathematics. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:8156.
[Published Version]
View
| Files available
| DOI
2020 | Published | Conference Paper | IST-REx-ID: 8732
Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.” Graph-Theoretic Concepts in Computer Science, vol. 12301, Springer Nature, 2020, pp. 325–38, doi:10.1007/978-3-030-60440-0_26.
View
| DOI
2020 | Published | Journal Article | IST-REx-ID: 6563 |

Filakovský, Marek, and Lukas Vokřínek. “Are Two given Maps Homotopic? An Algorithmic Viewpoint.” Foundations of Computational Mathematics, vol. 20, Springer Nature, 2020, pp. 311–30, doi:10.1007/s10208-019-09419-x.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 15082 |

Aichholzer, Oswin, et al. “Disjoint Tree-Compatible Plane Perfect Matchings.” 36th European Workshop on Computational Geometry, 56, 2020.
[Published Version]
View
| Download Published Version (ext.)
2020 | Published | Journal Article | IST-REx-ID: 9308 |

Avvakumov, Sergey, et al. “Eliminating Higher-Multiplicity Intersections, III. Codimension 2.” Russian Mathematical Surveys, vol. 75, no. 6, IOP Publishing, 2020, pp. 1156–58, doi:10.1070/RM9943.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 5790 |

Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.” Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 5857 |

Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Submitted | Preprint | IST-REx-ID: 7950 |

Biniaz, Ahmad, et al. “Token Swapping on Trees.” ArXiv, 1903.06981.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2019 | Submitted | Preprint | IST-REx-ID: 8182 |

Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” ArXiv, 1910.12628, arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2019 | Submitted | Preprint | IST-REx-ID: 8184 |

Avvakumov, Sergey, et al. “Stronger Counterexamples to the Topological Tverberg Conjecture.” ArXiv, 1908.08731, arXiv.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Submitted | Preprint | IST-REx-ID: 8185 |

Avvakumov, Sergey, and Roman Karasev. “Envy-Free Division Using Mapping Degree.” ArXiv, 1907.11183, doi:10.48550/arXiv.1907.11183.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 5986 |

Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6556 |

Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small Treewidth.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 6638 |

Silva, André, et al. “Graphs with at Most One Crossing.” Discrete Mathematics, vol. 342, no. 11, Elsevier, 2019, pp. 3201–07, doi:10.1016/j.disc.2019.06.031.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6647 |

Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.
[Published Version]
View
| Files available
| DOI
| arXiv