2024W

• Seminar in Algorithms Graphs and Geometry / 186.862 / SE

• Level Planarity Is More Difficult Than We Thought / Fink, S. D., Pfretzschner, M., Rutter, I., & Stumpf, P. (2024). Level Planarity Is More Difficult Than We Thought. arXiv. https://doi.org/10.48550/arXiv.2409.01727
• Clustered Planarity Variants for Level Graphs / Fink, S. D., Pfretzschner, M., Rutter, I., & Sieper, M. D. (2024). Clustered Planarity Variants for Level Graphs. arXiv. https://doi.org/10.34726/8210
  Download: Clustered Planarity Variants for Level Graphs (913 KB)
  Project: Parameterized Graph Drawing (2023–2027)
• Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm / Fink, S. D., & Rutter, I. (2024). Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) (pp. 1–14). SIAM. https://doi.org/10.1137/1.9781611977929.1
• The Parameterized Complexity Of Extending Stack Layouts / Depian, T., Fink, S. D., Ganian, R., & Nöllenburg, M. (2024). The Parameterized Complexity Of Extending Stack Layouts. In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024) (pp. 12:1-12:17). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.GD.2024.12
  Download: The Parameterized Complexity Of Extending Stack Layouts (1.73 MB)