73 citations · 178 across the 49 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…
Online and size anti-Ramsey numbers
Maria Axenovich, Kolja Knauer, Judith Stumpp +1
A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges in a graph any of whose proper edge colorings contains a totally multico…
Making Octants Colorful and Related Covering Decomposition Problems
Jean Cardinal, Kolja Knauer, Piotr Micek +1
We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k,…
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…
Twins in graphs
Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt
A basic pigeonhole principle insures an existence of two objects of the same type if the number of objects is larger than the number of types. Can such a principle be extended to a…
Equilateral L-Contact Graphs
Steven Chaplick, Stephen Kobourov, Torsten Ueckerdt
We consider {\em L-graphs}, that is contact graphs of axis-aligned L-shapes in the plane, all with the same rotation. We provide several characterizations of L-graphs, drawing conn…