7 papers
Weighted Book Thickness
Henry Förster, Michael Hoffmann, Stephen Kobourov +3
We introduce and study the weighted book thickness of graphs. A -page book embedding of a graph is defined by a spanning cycle for (which does not need to be p…
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…
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…
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
Sabine Cornelsen, Henry Förster, Siddharth Gupta +2
A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line)…
Visualization Biases MLLM's Decision Making in Network Data Tasks
Timo Brand, Henry Förster, Stephen G. Kobourov +1
We evaluate how visualizations can influence the judgment of MLLMs about the presence or absence of bridges in a network. We show that the inclusion of visualization improves confi…
Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
Henry Förster, Stephen Kobourov, Jacob Miller +1
A strengthened version of Harborth's well-known conjecture -- known as Kleber's conjecture -- states that every planar graph admits a planar straight-line drawing where every edge…