De Nooijer P, Terziadis S, Weinberger A, Masárová Z, Mchedlidze T, Löffler M, Rote G. 2024. Removing popular faces in curve arrangements. 31st International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 14466, 18–33.

Filakovský M, Nakajima TV, Oprsal J, Tasinato G, Wagner U. 2024. Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. 41st International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 289, 34.

Lopushanski M, Ivanov G. 2024. A constructive algorithm for building rectifiable curves in weakly convex sets. AIP Conference Proceedings. ICCMSE: International Conference of Computational Methods in Sciences and Engiineering vol. 3030, 080002.

Krokhin A, Oprsal J, Wrochna M, divný S. 2023. Topology and adjunction in promise constraint satisfaction. SIAM Journal on Computing. 52(1), 38–79.

Dymond M, Kaluza V. 2023. Highly irregular separated nets. Israel Journal of Mathematics. 253, 501–554.

Arroyo Guevara AM, Klute F, Parada I, Vogtenhuber B, Seidel R, Wiedera T. 2023. Inserting one edge into a simple drawing is hard. Discrete and Computational Geometry. 69, 745–770.

Arroyo Guevara AM, Felsner S. 2023. Approximating the bundled crossing number. Journal of Graph Algorithms and Applications. 27(6), 433–457.

Köse S. 2023. Exterior algebra and combinatorics. Institute of Science and Technology Austria.

Ivanov G, Köse S. 2023. Erds-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. 346(6), 113363.

Ivanov G, Naszódi M. 2023. Quantitative Steinitz theorem: A polynomial bound. Bulletin of the London Mathematical Society.