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
2024 | Conference Paper | IST-REx-ID: 14888 | 
De Nooijer, P., Terziadis, S., Weinberger, A., Masárová, Z., Mchedlidze, T., Löffler, M., & Rote, G. (2024). Removing popular faces in curve arrangements. In 31st International Symposium on Graph Drawing and Network Visualization (Vol. 14466, pp. 18–33). Isola delle Femmine, Palermo, Italy: Springer Nature. https://doi.org/10.1007/978-3-031-49275-4_2
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Conference Paper | IST-REx-ID: 15168 |
Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., & Wagner, U. (2024). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. In 41st International Symposium on Theoretical Aspects of Computer Science (Vol. 289). Clermont-Ferrand, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.34
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Conference Paper | IST-REx-ID: 15296
Lopushanski, M., & Ivanov, G. (2024). A constructive algorithm for building rectifiable curves in weakly convex sets. In AIP Conference Proceedings (Vol. 3030). Virtual: AIP Publishing. https://doi.org/10.1063/5.0195908
View
| DOI
2023 | Journal Article | IST-REx-ID: 12563 |
Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023). Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/20m1378223
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 9652 |
Dymond, M., & Kaluza, V. (2023). Highly irregular separated nets. Israel Journal of Mathematics. Springer Nature. https://doi.org/10.1007/s11856-022-2448-6
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 11999 |
Arroyo Guevara, A. M., Klute, F., Parada, I., Vogtenhuber, B., Seidel, R., & Wiedera, T. (2023). Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-022-00394-9
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2023 | Journal Article | IST-REx-ID: 13969 |
Arroyo Guevara, A. M., & Felsner, S. (2023). Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. Brown University. https://doi.org/10.7155/jgaa.00629
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Thesis | IST-REx-ID: 13331 |
Köse, S. (2023). Exterior algebra and combinatorics. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:13331
[Published Version]
View
| Files available
| DOI
2023 | Journal Article | IST-REx-ID: 12680 |
Ivanov, G., & Köse, S. (2023). Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2023.113363
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2023 | Journal Article | IST-REx-ID: 14660 |
Ivanov, G., & Naszódi, M. (2023). Quantitative Steinitz theorem: A polynomial bound. Bulletin of the London Mathematical Society. London Mathematical Society. https://doi.org/10.1112/blms.12965
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv