De Nooijer, Phoebe, et al. “Removing Popular Faces in Curve Arrangements.”10.1007/978-3-031-49275-4_2__31st International Symposium on Graph Drawing and Network Visualization, vol. 14466, Springer Nature, 2024, pp. 18–33, doi:10.1007/978-3-031-49275-4_2.

Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.”10.4230/LIPIcs.STACS.2024.34__41st International Symposium on Theoretical Aspects of Computer Science, vol. 289, 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.STACS.2024.34.

Lopushanski, Mariana, and Grigory Ivanov. “A Constructive Algorithm for Building Rectifiable Curves in Weakly Convex Sets.”10.1063/5.0195908__AIP Conference Proceedings, vol. 3030, no. 1, 080002, AIP Publishing, 2024, doi:10.1063/5.0195908.

Krokhin, Andrei, et al. “Topology and Adjunction in Promise Constraint Satisfaction.”10.1137/20m1378223__SIAM Journal on Computing, vol. 52, no. 1, Society for Industrial &; Applied Mathematics, 2023, pp. 38–79, doi:10.1137/20m1378223.

Dymond, Michael, and Vojtech Kaluza. “Highly Irregular Separated Nets.”10.1007/s11856-022-2448-6__Israel Journal of Mathematics, vol. 253, Springer Nature, 2023, pp. 501–54, doi:10.1007/s11856-022-2448-6.

Arroyo Guevara, Alan M., et al. “Inserting One Edge into a Simple Drawing Is Hard.”10.1007/s00454-022-00394-9__Discrete and Computational Geometry, vol. 69, Springer Nature, 2023, pp. 745–770, doi:10.1007/s00454-022-00394-9.

Arroyo Guevara, Alan M., and Stefan Felsner. “Approximating the Bundled Crossing Number.”10.7155/jgaa.00629__Journal of Graph Algorithms and Applications, vol. 27, no. 6, Brown University, 2023, pp. 433–57, doi:10.7155/jgaa.00629.

Köse, Seyda. Exterior Algebra and Combinatorics. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:13331.

Ivanov, Grigory, and Seyda Köse. “Erds-Ko-Rado and Hilton-Milner Theorems for Two-Forms.”10.1016/j.disc.2023.113363__Discrete Mathematics, vol. 346, no. 6, 113363, Elsevier, 2023, doi:10.1016/j.disc.2023.113363.

Ivanov, Grigory, and Márton Naszódi. “Quantitative Steinitz Theorem: A Polynomial Bound.”10.1112/blms.12965__Bulletin of the London Mathematical Society, London Mathematical Society, 2023, doi:10.1112/blms.12965.

Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.”10.1007/s00454-023-00532-x__Discrete and Computational Geometry, Springer Nature, 2023, doi:10.1007/s00454-023-00532-x.

Wagner, Uli, and Pascal Wild. “Coboundary Expansion, Equivariant Overlap, and Crossing Numbers of Simplicial Complexes.”10.1007/s11856-023-2521-9__Israel Journal of Mathematics, vol. 256, no. 2, Springer Nature, 2023, pp. 675–717, doi:10.1007/s11856-023-2521-9.

Biniaz, Ahmad, et al. “Token Swapping on Trees.”10.46298/DMTCS.8383__Discrete Mathematics and Theoretical Computer Science, vol. 24, no. 2, 9, EPI Sciences, 2023, doi:10.46298/DMTCS.8383.

Ivanov, Grigory, and Márton Naszódi. “Functional John and Löwner Conditions for Pairs of Log-Concave Functions.”10.1093/imrn/rnad210__International Mathematics Research Notices, vol. 2023, no. 23, Oxford University Press, 2023, pp. 20613–69, doi:10.1093/imrn/rnad210.

Dymond, Michael, and Vojtech Kaluza. “Divergence of Separated Nets with Respect to Displacement Equivalence.”10.1007/s10711-023-00862-3__Geometriae Dedicata, 15, Springer Nature, 2023, doi:10.1007/s10711-023-00862-3.

Brunck, Florestan R. “Iterated Medial Triangle Subdivision in Surfaces of Constant Curvature.”10.1007/s00454-023-00500-5__Discrete and Computational Geometry, vol. 70, no. 3, Springer Nature, 2023, pp. 1059–89, doi:10.1007/s00454-023-00500-5.

Krokhin, Andrei, and Jakub Oprsal. “An Invitation to the Promise Constraint Satisfaction Problem.”10.1145/3559736.3559740__ACM SIGLOG News, vol. 9, no. 3, Association for Computing Machinery, 2022, pp. 30–59, doi:10.1145/3559736.3559740.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.7155/jgaa.00591__Journal of Graph Algorithms and Applications, vol. 26, no. 2, Brown University, 2022, pp. 225–40, doi:10.7155/jgaa.00591.

Wild, Pascal. High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes. Institute of Science and Technology, 2022, doi:10.15479/at:ista:11777.

Kaluza, Vojtech, and Martin Tancer. “Even Maps, the Colin de Verdière Number and Representations of Graphs.”10.1007/s00493-021-4443-7__Combinatorica, vol. 42, Springer Nature, 2022, pp. 1317–45, doi:10.1007/s00493-021-4443-7.