21 citations · 120 across the 54 of their papers we have counts for
8 papers · 1 filter
Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter +1
We explore the machine-minimizing job scheduling problem, which has a rich history in the line of research, under an online setting. We consider systems with arbitrary job arrival…
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…
Graphs with Plane Outside-Obstacle Representations
Alexander Koch, Marcus Krug, Ignaz Rutter
An \emph{obstacle representation} of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the co…
Multi-Sided Boundary Labeling
Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter +3
In the Boundary Labeling problem, we are given a set of points, referred to as sites, inside an axis-parallel rectangle , and a set of pairwise disjoint rectangular labe…