activity
20222026
most citedBlock Crossings in One-Sided Tanglegrams

1 citations · 2 across the 14 of their papers we have counts for

collaborators

18 papers

cs.CG2026

On the Complexity of Extending Storylines

Alexander Dobler, Siddharth Gupta, Philipp Kindermann +2

Storyline layouts visualize temporal interactions by drawing each character as an x-monotone curve and enforcing that the participants of every meeting form a contiguous vertical g…

cs.DS2025

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth

Sergio Cabello, Alexander Dobler, Gašper Fijavž +2

A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to o…

cs.DS2025

Optimizing Wiggle in Storylines

Alexander Dobler, Tim Hegemann, Martin Nöllenburg +1

A storyline visualization shows interactions between characters over time. Each character is represented by an x-monotone curve. Time is mapped to the x-axis, and groups of charact…

cs.CC2025

Geometry Matters in Planar Storyplans

Alexander Dobler, Maximilian Holzmüller, Martin Nöllenburg

A storyplan visualizes a graph as a sequence of frames , each of which is a drawing of the induced subgraph of a vertex subset $V_i \s…

cs.DS2025

On Minimizing Wiggle in Stacked Area Charts

Alexander Dobler, Martin Nöllenburg

Stacked area charts are a widely used visualization technique for numerical time series. The x-axis represents time, and the time series are displayed as horizontal, variable-heigh…

cs.DS2025

Layered Graph Drawing with Few Gaps and Few Crossings

Alexander Dobler, Jakob Roithinger

We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms deter…

cs.CG2024

Representing Hypergraphs by Point-Line Incidences

Alexander Dobler, Stephen Kobourov, Debajyoti Mondal +1

We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, w…

cs.DS2024

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings

Alexander Dobler, Michael Jünger, Paul J. Jünger +3

Storyline drawings are a popular visualization of interactions of a set of characters over time, e.g., to show participants of scenes in a book or movie. Characters are represented…

cs.GR2024

Hoop Diagrams: A Set Visualization Method

Peter Rodgers, Peter Chapman, Andrew Blake +3

We introduce Hoop Diagrams, a new visualization technique for set data. Hoop Diagrams are a circular visualization with hoops representing sets and sectors representing set interse…

cs.DM2024

Graph drawing applications in combinatorial theory of maturity models

Špela Kajzer, Alexander Dobler, Janja Jerebic +3

In this paper, we introduce tiled graphs as models of learning and maturing processes. We show how tiled graphs can combine graphs of learning spaces or antimatroids (partial hyper…

cs.CG2023

Minimizing Corners in Colored Rectilinear Grids

Thomas Depian, Alexander Dobler, Christoph Kern +1

Given a rectilinear grid , in which cells are either assigned a single color, out of possible colors, or remain white, can we color white grid cells of to minimize the t…

cs.DS2023★ 1 cited

The Complexity of Cluster Vertex Splitting and Company

Alexander Firbas, Alexander Dobler, Fabian Holzer +4

Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may loo…

cs.CC2023

A Note on the Complexity of One-Sided Crossing Minimization of Trees

Alexander Dobler

In 2011, Harrigan and Healy published a polynomial-time algorithm for one-sided crossing minimization for trees. We point out a counterexample to that algorithm, and show that one-…

cs.DS2023★ 1 cited

Block Crossings in One-Sided Tanglegrams

Alexander Dobler, Martin Nöllenburg

Tanglegrams are drawings of two rooted binary phylogenetic trees and a matching between their leaf sets. The trees are drawn crossing-free on opposite sides with their leaf sets fa…

cs.CG2023

Crossing Minimization in Time Interval Storylines

Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic +2

Storyline visualizations are a popular way of visualizing characters and their interactions over time: Characters are drawn as x-monotone curves and interactions are visualized thr…

cs.GR2023

LinSets.zip: Compressing Linear Set Diagrams

Markus Wallinger, Alexander Dobler, Martin Nöllenburg

Linear diagrams are used to visualize set systems by depicting set memberships as horizontal line segments in a matrix, where each set is represented as a row and each element as a…

cs.CG2022

On Computing Optimal Linear Diagrams

Alexander Dobler, Martin Nöllenburg

Linear diagrams are an effective way to visualize set-based data by representing elements as columns and sets as rows with one or more horizontal line segments, whose vertical over…

cs.DS2022

Turbocharging Heuristics for Weak Coloring Numbers

Alexander Dobler, Manuel Sorge, Anaïs Villedieu

Bounded expansion and nowhere-dense classes of graphs capture the theoretical tractability for several important algorithmic problems. These classes of graphs can be characterized…