Michael Hoffmann

activity

20242026

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.CG2026

Weighted Book Thickness

Henry Förster, Michael Hoffmann, Stephen Kobourov +3

We introduce and study the weighted book thickness of graphs. A $k$ -page book embedding of a graph $G = (V, E)$ is defined by a spanning cycle $C$ for $V$ (which does not need to be p…

math.CO2026

A Gray code for arborescences of tournaments

Marthe Bonamy, Michael Hoffmann, Clément Legrand-Duchesne +1

We consider the following question of Knuth: given a directed graph $G$ and a root $r$ , can the arborescences of $G$ rooted in $r$ be listed such that any two consecutive arboresce…