activity
20202026
most citedMetroSets: Visualizing Sets as Metro Maps

36 citations · 49 across the 16 of their papers we have counts for

collaborators

20 papers

cs.CG2026

Minimum-Width Drawing of Trees with Sized Vertices

Markus Wallinger, Oscar Navarro, Stephen G. Kobourov

Trees arise in many applications and computing nice tree layouts is a classical problem in information visualization. In many practical settings, vertices need to be represented as…

cs.HC2026

A Task Taxonomy for Edge and Trail Bundling

Markus Wallinger, Stephen G. Kobourov

Edge bundling reduces visual clutter by aggregating similar edges, yet practitioners lack a structured vocabulary for reasoning about the tasks that bundled visualizations support.…

cs.HC2026

Clarity and Computational Efficiency of Orbital Boundary Labeling

Markus Wallinger, Annika Bonerath, Soeren Terziadis +2

Circular interfaces such as those found on smartwatches, automotive dashboards, cockpit instruments, or in radial visualizations pose unique challenges for placing readable labels.…

cs.HC2025

ReTrace: Interactive Visualizations for Reasoning Traces of Large Reasoning Models

Ludwig Felder, Jacob Miller, Markus Wallinger +2

Recent advances in Large Language Models have led to Large Reasoning Models, which produce step-by-step reasoning traces. These traces offer insight into how models think and their…

cs.CG2025

Using Reinforcement Learning to Optimize the Global and Local Crossing Number

Timo Brand, Henry Förster, Stephen Kobourov +4

Graph drawing concerns the algorithmic visualization of graphs. A good drawing of a graph is easy to read and facilitates solving tasks on the graph. Several properties have been i…

cs.HC2025

Exploring MLLMs Perception of Network Visualization Principles

Jacob Miller, Markus Wallinger, Ludwig Felder +5

In this paper, we test whether Multimodal Large Language Models (MLLMs) can match human-subject performance in tasks involving the perception of properties in network layouts. Spec…

cs.GR2025

StorySets: Ordering Curves and Dimensions for Visualizing Uncertain Sets and Multi-Dimensional Discrete Data

Markus Wallinger, Annika Bonerath, Wouter Meulemans +3

We propose a method for visualizing uncertain set systems, which differs from previous set visualization approaches that are based on certainty (an element either belongs to a set…

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.CG2024

Boundary Labeling in a Circular Orbit

Annika Bonerath, Martin Nöllenburg, Soeren Terziadis +2

Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresp…

cs.CG2024★ 1 cited

Constrained Boundary Labeling

Thomas Depian, Martin Nöllenburg, Soeren Terziadis +1

Boundary labeling is a technique in computational geometry used to label sets of features in an illustration. It involves placing labels along an axis-parallel bounding box and con…

cs.CG2023

Computing Hive Plots: A Combinatorial Framework

Martin Nöllenburg, Markus Wallinger

Hive plots are a graph visualization style placing vertices on a set of radial axes emanating from a common center and drawing edges as smooth curves connecting their respective en…

cs.CC2023

Network Navigation with Online Delays is PSPACE-complete

Thomas Depian, Christoph Kern, Sebastian Röder +2

In public transport networks disruptions may occur and lead to travel delays. It is thus interesting to determine whether a traveler can be resilient to delays that occur unexpecte…

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.CG2023

Splitting Vertices in 2-Layer Graph Drawings

Reyan Ahmed, Patrizio Angelini, Michael A. Bekos +8

Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two…

cs.GR2022

MosaicSets: Embedding Set Systems into Grid Graphs

Peter Rottmann, Markus Wallinger, Annika Bonerath +3

Visualizing sets of elements and their relations is an important research area in information visualization. In this paper, we present MosaicSets: a novel approach to create Euler-…

cs.DM2022★ 1 cited

Finding a Battleship of Uncertain Shape

Eva-Maria Hainzl, Maarten Löffler, Daniel Perz +2

Motivated by a game of Battleship, we consider the problem of efficiently hitting a ship of an uncertain shape within a large playing board. Formally, we fix a dimension $d\in\{1,2…

cs.MA2022

Multidimensional Manhattan Preferences

Jiehua Chen, Martin Nöllenburg, Sofia Simola +2

A preference profile (i.e., a collection of linear preference orders of the voters over a set of alternatives) with alternatives and voters is -Manhattan (resp. -Eucl…

cs.GR2021★ 1 cited

Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach

Markus Wallinger, Daniel Archambault, David Auber +2

Edge bundling techniques cluster edges with similar attributes (i.e. similarity in direction and proximity) together to reduce the visual clutter. All edge bundling techniques to d…

cs.HC2021★ 10 cited

On the Readability of Abstract Set Visualizations

Markus Wallinger, Ben Jacobsen, Stephen Kobourov +1

Set systems are used to model data that naturally arises in many contexts: social networks have communities, musicians have genres, and patients have symptoms. Visualizations that…

cs.GR2020★ 36 cited

MetroSets: Visualizing Sets as Metro Maps

Ben Jacobsen, Markus Wallinger, Stephen Kobourov +1

We propose MetroSets, a new, flexible online tool for visualizing set systems using the metro map metaphor. We model a given set system as a hypergraph $\mathcal{H} = (V, \mathcal{…