works on

From the 1 of 9 linked papers with an AI index.

collaborators

9 papers

cs.CG2026

Minimum-Width Drawing of Trees with Sized Vertices

Markus Wallinger, Oscar Navarro, Stephen G. Kobourov

The paper studies how to reorder the children of each node in a rooted tree with given vertex sizes to minimize the width of a layered drawing, proving the problem NP‑complete and…

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

Using Reinforcement Learning to Optimize the Global and Local Crossing Number

Timo Brand, Henry Förster, Henry Förster +5

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

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

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