2 citations · 3 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020
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…
cs.DS2019★ 1 cited
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…
cs.DS2018
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…