121 citations · 153 across the 25 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CG2013
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…
cs.DS2013★ 5 cited
Exact and fixed-parameter algorithms for metro-line crossing minimization problems
Yoshio Okamoto, Yuichi Tatsu, Yushi Uno
A metro-line crossing minimization problem is to draw multiple lines on an underlying graph that models stations and rail tracks so that the number of crossings of lines becomes mi…