collaborators

6 papers

cs.DS2026

Monotone Clustered Level Planarity

Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1

We consider the combination of the two constrained planarity problems Level- and Clustered Planarity. Traditionally, level-planar drawings with convex clusters have been studied in…

cs.DS2026

Chunky Chains: Graph Drawings on Small Screens

Tim Hegemann, Dominik Jilg, Marie Diana Sieper +1

We introduce Chunky Chains, a graph drawing style designed for small screens such as smartphones, where vertical scrolling is the dominant means of interaction. A Chunky Chain cons…

cs.CC2026

The Parameterized Complexity of Coloring Mixed Graphs

Antonio Lauerbach, Konstanty Junosza-Szaniawski, Marie Diana Sieper +1

A mixed graph contains (undirected) edges as well as (directed) arcs, thus generalizing undirected and directed graphs. A proper coloring of a mixed graph assigns a positiv…

cs.CG2026

Morphing Graph Drawings in the Presence of Point Obstacles

Oksana Firman, Tim Hegemann, Boris Klemz +4

A crossing-free morph is a continuous deformation between two graph drawings that preserves straight-line pairwise noncrossing edges. Motivated by applications in 3D morphing probl…

cs.CG2025

On Triangular Separation of Bichromatic Point Sets

Helena Bergold, Arun Kumar Das, Robert Lauff +3

We address the problem of computing the minimum number of triangles to separate a set of blue points from a set of red points in . A set of triangles is a \emph{separ…

cs.CC2025

Eliminating Majority Illusions

Foivos Fioravantes, Abhiruk Lahiri, Antonio Lauerbach +3

An opinion illusion refers to a phenomenon in social networks where agents may witness distributions of opinions among their neighbours that do not accurately reflect the true dist…