1 citations · 2 across the 14 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
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…
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…
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…
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…
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…