2024W

• Seminar in Algorithms Graphs and Geometry / 186.862 / SE

• Improving Temporal Treemaps by Minimizing Crossings / Dobler, A., & Nöllenburg, M. (2024). Improving Temporal Treemaps by Minimizing Crossings. Computer Graphics Forum, 43(3), Article e15087. https://doi.org/10.1111/cgf.15087
• Minimizing Corners in Colored Rectilinear Grids / Depian, T., Dobler, A., Wulms, J., & Kern, C. (2024). Minimizing Corners in Colored Rectilinear Grids. In WALCOM: Algorithms and Computation - 18th International Conference and Workshops on Algorithms and Computation, WALCOM 2024, Kanazawa, Japan, March 18–20, 2024, Proceedings (pp. 134–148). Springer, Singapore.
• The Complexity of Cluster Vertex Splitting and Company / Firbas, A., Dobler, A., Holzer, F., Schafellner, J., Sorge, M., Villedieu, A., & Wißmann, M. (2024). The Complexity of Cluster Vertex Splitting and Company. In SOFSEM 2024: Theory and Practice of Computer Science (pp. 226–239). http://hdl.handle.net/20.500.12708/201366
• Hoop Diagrams: A Set Visualization Method / Rodgers, P., Chapman, P., Blake, A., Nöllenburg, M., Wallinger, M., & Dobler, A. (2024). Hoop Diagrams: A Set Visualization Method. In Diagrammatic Representation and Inference (pp. 377–392). Springer, Cham. http://hdl.handle.net/20.500.12708/203881
• PACE Solver Description: Touiouidth / Berthe, G., Codert-Osman, Y., Dobler, A., Morelle, L., Reinald, A., & Rocton, M. (2023). PACE Solver Description: Touiouidth. In N. Misra & M. Wahlström (Eds.), 18th International Symposium on Parameterized and Exact Computation (IPEC 2023) (pp. 38:1-38:4). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2023.38
• LinSets.zip: Compressing Linear Set Diagrams / Wallinger, M., Dobler, A., & Nöllenburg, M. (2023). LinSets.zip: Compressing Linear Set Diagrams. IEEE Transactions on Visualization and Computer Graphics, 29(6), 2875–2887. https://doi.org/10.1109/TVCG.2023.3261934
• Block Crossings in One-Sided Tanglegrams / Dobler, A., & Nöllenburg, M. (2023). Block Crossings in One-Sided Tanglegrams. In P. Morin & S. Suri (Eds.), Algorithms and Data Structures : 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings (pp. 386–400). Springer. https://doi.org/10.1007/978-3-031-38906-1_25
• Crossing Minimization in Time Interval Storylines / Dobler, A., Nöllenburg, M., Stojanovic, D., Villedieu, A., & Wulms, J. (2023). Crossing Minimization in Time Interval Storylines. In 39th European Workshop on Computational Geometry : EuroCG2023 : Book of Abstracts (pp. 36–37).
  Download: PDF (1.35 MB)
• On Computing Optimal Linear Diagrams / Dobler, A., & Nöllenburg, M. (2022). On Computing Optimal Linear Diagrams. In Diagrammatic Representation and Inference (pp. 20–36). Sprnger. https://doi.org/10.1007/978-3-031-15146-0_2
• Turbocharging Heuristics for Weak Coloring Numbers / Dobler, A., Sorge, M., & Villedieu, A. (2022). Turbocharging Heuristics for Weak Coloring Numbers. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.44
  Download: PDF (1.01 MB)
  Projects: HumAlgo (2018–2023) / REVEAL-AI (2020–2024)
• Turbocharging heuristics for weak coloring numbers / Dobler, A. (2021). Turbocharging heuristics for weak coloring numbers [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.91580
  Download: PDF (4.86 MB)