activity
20082026
most citedPlanar graphs have bounded queue-number

73 citations · 178 across the 49 of their papers we have counts for

collaborators
Showing cs.DSShow all

6 papers · 1 filter

cs.DS2023

Axis-Parallel Right Angle Crossing Graphs

Patrizio Angelini, Michael A. Bekos, Julia Katheder +3

A RAC graph is one admitting a RAC drawing, that is, a polyline drawing in which each crossing occurs at a right angle. Originally motivated by psychological studies on readability…

cs.DS2022

Efficient Recognition of Subgraphs of Planar Cubic Bridgeless Graphs

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which pl…

cs.DS2020★ 1 cited

Four Pages Are Indeed Necessary for Planar Graphs

Michael A. Bekos, Michael Kaufmann, Fabian Klute +3

An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two…

cs.DS2019

Engineering Negative Cycle Canceling for Wind Farm Cabling

Sascha Gritzbach, Torsten Ueckerdt, Dorothea Wagner +2

In a wind farm turbines convert wind energy into electrical energy. The generation of each turbine is transmitted, possibly via other turbines, to a substation that is connected to…

cs.DS2018★ 2 cited

Planar Graphs of Bounded Degree have Constant Queue Number

Michael A. Bekos, Henry Förster, Martin Gronemann +4

A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same que…

cs.DS2013

On Semantic Word Cloud Representation

Lukas Barth, Stephen Kobourov, Sergey Pupyrev +1

We study the problem of computing semantic-preserving word clouds in which semantically related words are close to each other. While several heuristic approaches have been describe…