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