Alexander Dobler

Address:
Alexander Dobler
Technische Universität Wien
Institute of Logic and Computation
Favoritenstraße 9–11, E192-01
1040 Wien
Austria

Room: HA0416
Phone: +43(1)58801–192123
Email: adobler@ac.tuwien.ac.at
Web: http://www.ac.tuwien.ac.at/people/adobler/

11 results
2025
[11]On Minimizing Wiggle in Stacked Area Charts
,
Algorithms and Data Structures (WADS'25) (Pat Morin, Eunjin Oh, eds.), 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Note: To appear.
[bibtex]
[10]Representing Hypergraphs by Point-Line Incidences
, , ,
Theory and Practice of Computer Science (SOFSEM'25) (Rastislav Královic, Vera Kurková, eds.), volume 15538 of LNCS, pages 241–254, 2025, Springer.
[bibtex] [doi]
2024
[9]Improving Temporal Treemaps by Minimizing Crossings
,
Comput. Graph. Forum, volume 43, number 3, pages e15087, 2024.
[bibtex] [doi]
[8]Hoop Diagrams: A Set Visualization Method
, , , , ,
Diagrammatic Representation and Inference (DIAGRAMS'24), volume 14981 of LNCS, pages 377-392, 2024, Springer.
[bibtex] [doi]
[7]Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
, , , , ,
Graph Drawing and Network Visualization (GD'24) (Stefan Felsner, Karsten Klein, eds.), volume 320 of LIPIcs, pages 31:1–31:19, 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [pdf] [doi]
[6]Minimizing Corners in Colored Rectilinear Grids
, , ,
Algorithms and Computation (WALCOM'24) (Ryuhei Uehara, Katsuhisa Yamanaka, Hsu-Chun Yen, eds.), volume 14549 of LNCS, pages 134–148, 2024, Springer.
[bibtex] [doi]
2023
[5]LinSets.zip: Compressing Linear Set Diagrams
, ,
IEEE Trans. Visualization and Computer Graphics, volume 29, number 6, pages 2875–2887, 2023.
[bibtex] [doi]
[4]Crossing Minimization in Time Interval Storylines
, , , ,
European Workshop on Computational Geometry (EuroCG'23) (Clemens Huemer, Carlos Seara, eds.), pages 36:1–36:7, 2023.
[bibtex] [pdf]
[3]Block Crossings in One-Sided Tanglegrams
,
Algorithms and Data Structures (WADS'23) (Pat Morin, Subhash Suri, eds.), volume 14079 of LNCS, pages 386–400, 2023, Springer.
[bibtex] [pdf] [doi]
2022
[2]Turbocharging Heuristics for Weak Coloring Numbers
, ,
European Symposium on Algorithms (ESA 2022) (Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, Grzegorz Herman, eds.), volume 244 of LIPIcs, pages 44:1–44:18, 2022, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
[bibtex] [doi]
[1]On Computing Optimal Linear Diagrams
,
Diagrammatic Representation and Inference (DIAGRAMS'22) (Valeria Giardino, Sven Linker, Richard Burns, Francesco Bellucci, Jean-Michel Boucheix, Petrucio Viana, eds.), volume 13462 of LNAI, pages 20–36, 2022, Springer.
[bibtex] [pdf] [doi]