84 citations · 95 across the 10 of their papers we have counts for
4 papers · 1 filter
Zipping Segment Trees
Lukas Barth, Dorothea Wagner
Stabbing queries in sets of intervals are usually answered using segment trees. A dynamic variant of segment trees has been presented by van Kreveld and Overmars, which uses red-bl…
Engineering Top-Down Weight-Balanced Trees
Lukas Barth, Dorothea Wagner
Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees, for example regarding the required work to balance…
Multilevel Planarity
Lukas Barth, Guido Brückner, Paul Jungeblut +1
In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let be a directed gr…
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…