36 citations · 216 across the 70 of their papers we have counts for
7 papers · 1 filter
Semantic Word Cloud Representations: Hardness and Approximation Algorithms
Lukas Barth, Sara Irina Fabrikant, Stephen Kobourov +7
We study a geometric representation problem, where we are given a set of axis-aligned rectangles with fixed dimensions and a graph with vertex set . The task is to…
Trajectory-Based Dynamic Map Labeling
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling…
Strict Confluent Drawing
David Eppstein, Danny Holten, Maarten Löffler +3
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctio…
Many-to-One Boundary Labeling with Backbones
Michael A. Bekos, Sabine Cornelsen, Martin Fink +5
In this paper we study \emph{many-to-one boundary labeling with backbone leaders}. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-e…
Drawing Planar Graphs with a Prescribed Inner Face
Tamara Mchedlidze, Martin Nöllenburg, Ignaz Rutter
Given a plane graph (i.e., a planar graph with a fixed planar embedding) and a simple cycle in whose vertices are mapped to a convex polygon, we consider the question w…
Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings
Therese Biedl, Thomas Bläsius, Benjamin Niedermann +3
We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based repre…