LINORD

$F^2$Stories: A Modular Framework for Multi-Objective Optimization of Storylines with a Focus on Fairness
IEEE Trans. Vis. Comput. Graph., volume 32, number 1, pages 747-757, 2026.
PDF Cite Project DOI
Block Crossings in One-Sided Tanglegrams
Algorithmica, volume 88, pages 20:1-20:30, 2026.
Cite Project DOI
Clarity and Computational Efficiency of Orbital Boundary Labeling
Pacific Visualization Symposium (PacificVis'26), 2026.
Note: To appear.
Cite Project
Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies
Pacific Visualization Symposium (PacificVis'26), 2026.
Note: To appear.
Cite Project
A note on the complexity of one-sided crossing minimization of trees
Information Processing Letters, volume 190, pages 106575, 2025.
Cite Project DOI
Constrained Boundary Labeling
Comput. Geom. Theory Appl., volume 129, pages 102191, 2025.
Cite Project DOI
Geometry Matters in Planar Storyplans
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 27:1-27:9, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Cite Project DOI
On Minimizing Wiggle in Stacked Area Charts
Algorithms and Data Structures (WADS'25) (Morin, Pat and Oh, Eunjin), volume 349 of LIPIcs, pages 22:1-22:14, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Cite Project DOI
Optimizing Staircase Motifs in Biofabric Network Layouts
Comput. Graph. Forum, pages e70139, 2025.
Cite Project DOI
Optimizing Wiggle in Storylines
Graph Drawing and Network Visualization (GD'25) (Dujmović, Vida and Montecchiani, Fabrizio), volume 357 of LIPIcs, pages 39:1-39:17, 2025, Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
Cite Project DOI