Brand, C., Ganian, R., Röder, S., & Schager, F. (2024). Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs. Journal of Graph Algorithms and Applications, 28(2), 131–150. https://doi.org/10.7155/jgaa.v28i2.2995 ( reposiTUm)

Balabán, J., Ganian, R., & Rocton, M. (2024). Computing Twin-Width Parameterized by the Feedback Edge Number. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024) (pp. 7:1-7:19). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.7 ( reposiTUm)

Firbas, A., & Sorge, M. (2024). On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting. In 35th International Symposium on Algorithms and Computation (ISAAC 2024) (pp. 1–15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2024.30 ( reposiTUm)

Ganian, R., Müller, H., Ordyniak, S., Paesani, G., & Rychlicki, M. (2024). A Tight Subexponential-Time Algorithm for Two-Page Book Embedding. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) (pp. 68:1-68:18). https://doi.org/10.4230/LIPIcs.ICALP.2024.68 ( reposiTUm)

Deligkas, A., Eiben, E., Ganian, R., Kanj, I., & Ramanujan, M. S. (2024). Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) (pp. 53:1-53:18). https://doi.org/10.4230/LIPIcs.ICALP.2024.53 ( reposiTUm)

Ganian, R., Nöllenburg, M., & Röder, S. (2024). Minimizing Switches in Cased Graph Drawings. In S. Felsner & K. Klein (Eds.), 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024) (pp. 1–43). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.GD.2024.43 ( reposiTUm)

Da Lozzo, G., Ganian, R., Gupta, S., Mohar, B., Ordyniak, S., & Zehavi, M. (2024). Exact Algorithms for Clustered Planarity with Linear Saturators. In 35th International Symposium on Algorithms and Computation (ISAAC 2024) (pp. 1–16). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2024.24 ( reposiTUm)

Balabán, J., Ganian, R., & Rocton, M. T. (2024). Twin-Width Meets Feedback Edges and Vertex Integrity. In 19th International Symposium on Parameterized and Exact Computation (IPEC 2024). International Symposium on Parameterized and Exact Computation (IPEC 2024), Egham, United Kingdom of Great Britain and Northern Ireland (the). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2024.3 ( reposiTUm)

Fink, S. D., Pfretzschner, M., Rutter, I., & Sieper, M. D. (2024). Clustered Planarity Variants for Level Graphs. arXiv. https://doi.org/10.34726/8210 ( reposiTUm)