112 citations · 298 across the 40 of their papers we have counts for
6 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…
Drawing Permutations with Few Corners
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of st…
Metro-Line Crossing Minimization: Hardness, Approximations, and Tractable Cases
Martin Fink, Sergey Pupyrev
Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawin…
Happy Edges: Threshold-Coloring of Regular Lattices
Md. Jawaherul Alam, Stephen G. Kobourov, Sergey Pupyrev +1
We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\em near} and {\em far} sets and an integer threshold $t…
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…
Threshold-Coloring and Unit-Cube Contact Representation of Graphs
Md. Jawaherul Alam, Steven Chaplick, Gašper Fijavž +3
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs…