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
2023 | Journal Article | IST-REx-ID: 11999 | 
Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.” Discrete and Computational Geometry, vol. 69, Springer Nature, 2023, pp. 745–770, doi:10.1007/s00454-022-00394-9.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 13969 |
Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.” Journal of Graph Algorithms and Applications, vol. 27, no. 6, Brown University, 2023, pp. 433–57, doi:10.7155/jgaa.00629.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Thesis | IST-REx-ID: 13331 |
Köse, Seyda. Exterior Algebra and Combinatorics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13331.
[Published Version]
View
| Files available
| DOI
2023 | Journal Article | IST-REx-ID: 12680 |
Ivanov, Grigory, and Seyda Köse. “Erdős-Ko-Rado and Hilton-Milner Theorems for Two-Forms.” Discrete Mathematics, vol. 346, no. 6, 113363, Elsevier, 2023, doi:10.1016/j.disc.2023.113363.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 14660 |
Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial Bound.” Bulletin of the London Mathematical Society, London Mathematical Society, 2023, doi:10.1112/blms.12965.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 13974 |
Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” Discrete and Computational Geometry, Springer Nature, 2023, doi:10.1007/s00454-023-00532-x.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 14445 |
Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.” Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:10.1007/s11856-023-2521-9.
[Published Version]
View
| Files available
| DOI
| WoS
2023 | Journal Article | IST-REx-ID: 12833 |
Biniaz, Ahmad, et al. “Token Swapping on Trees.” Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2, 9, EPI Sciences, 2023, doi:10.46298/DMTCS.8383.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Journal Article | IST-REx-ID: 14737 |
Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.” International Mathematics Research Notices, vol. 2023, no. 23, Oxford University Press, 2023, pp. 20613–69, doi:10.1093/imrn/rnad210.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Journal Article | IST-REx-ID: 9651 |
Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.” Geometriae Dedicata, 15, Springer Nature, 2023, doi:10.1007/s10711-023-00862-3.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 13270 |
Brunck, Florestan R. “Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature.” Discrete and Computational Geometry, vol. 70, no. 3, Springer Nature, 2023, pp. 1059–89, doi:10.1007/s00454-023-00500-5.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 11991 |
Krokhin, Andrei, and Jakub Opršal. “An Invitation to the Promise Constraint Satisfaction Problem.” ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11938 |
Aichholzer, Oswin, et al. “On Compatible Matchings.” Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Thesis | IST-REx-ID: 11777 |
Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes. Institute of Science and Technology, 2022, doi:10.15479/at:ista:11777.
[Published Version]
View
| Files available
| DOI
2022 | Journal Article | IST-REx-ID: 10335 |
Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.” Combinatorica, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 10776 |
Patakova, Zuzana, et al. “Barycentric Cuts through a Convex Body.” Discrete and Computational Geometry, vol. 68, Springer Nature, 2022, pp. 1133–54, doi:10.1007/s00454-021-00364-7.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 10887 |
Ivanov, Grigory, and Márton Naszódi. “Functional John Ellipsoids.” Journal of Functional Analysis, vol. 282, no. 11, 109441, Elsevier, 2022, doi:10.1016/j.jfa.2022.109441.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 | Journal Article | IST-REx-ID: 12129 |
Wagner, Uli, and Emo Welzl. “Connectivity of Triangulation Flip Graphs in the Plane.” Discrete & Computational Geometry, vol. 68, no. 4, Springer Nature, 2022, pp. 1227–84, doi:10.1007/s00454-022-00436-2.
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Journal Article | IST-REx-ID: 11593 |
Fulek, Radoslav, and Jan Kynčl. “The Z2-Genus of Kuratowski Minors.” Discrete and Computational Geometry, vol. 68, Springer Nature, 2022, pp. 425–47, doi:10.1007/s00454-022-00412-w.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 | Conference Paper | IST-REx-ID: 11185 |
Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.” WALCOM 2022: Algorithms and Computation, vol. 13174, Springer Nature, 2022, pp. 383–95, doi:10.1007/978-3-030-96731-4_31.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv