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 bib Project DOI
Block Crossings in One-Sided Tanglegrams
Algorithmica, volume 88, pages 20:1-20:30, 2026.
bib Project DOI
Clarity and Computational Efficiency of Orbital Boundary Labeling
Pacific Visualization Symposium (PacificVis'26), pages 1-10, 2026.
bib Project DOI
Minimizing Visual Clutter in Temporal Treemaps to Enable Comparison of Evolving Hierarchies
Pacific Visualization Symposium (PacificVis'26), pages 22-32, 2026.
bib Project DOI
Representing Hypergraphs by Point-Line Incidences
Discret. Math. Theor. Comput. Sci., volume 28, number 3, pages #3:1-24, 2026.
PDF bib Project DOI
The Story(line) So Far: A Survey on Storyline Visualization
Comput. Graph. Forum, volume 45, number 3, 2026.
bib Project DOI
A note on the complexity of one-sided crossing minimization of trees
Information Processing Letters, volume 190, pages 106575, 2025.
bib Project DOI
Constrained Boundary Labeling
Comput. Geom. Theory Appl., volume 129, pages 102191, 2025.
bib 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.
bib 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.
bib Project DOI