28 citations · 34 across the 12 of their papers we have counts for
12 papers
Clarity and Computational Efficiency of Orbital Boundary Labeling
Markus Wallinger, Annika Bonerath, Soeren Terziadis +2
Circular interfaces such as those found on smartwatches, automotive dashboards, cockpit instruments, or in radial visualizations pose unique challenges for placing readable labels.…
Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista +2
We introduce a quantum dynamic programming framework that allows us to directly extend to the quantum realm a large body of classical dynamic programming algorithms. The correspond…
Grandchildren-weight-balanced binary search trees
Vincent Jugé
We revisit weight-balanced trees, also known as trees of bounded balance. This class of binary search trees was invented by Nievergelt and Reingold in 1972. Such trees are obtained…
Visualizing Extensions of Argumentation Frameworks as Layered Graphs
Martin Nöllenburg, Christian Pirker, Anna Rapberger +2
The visualization of argumentation frameworks (AFs) is crucial for enabling a wide applicability of argumentative tools. However, their visualization is often considered only as an…
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
Sujoy Bhore, Giordano Da Lozzo, Fabrizio Montecchiani +1
A long-standing conjecture by Heath, Pemmaraju, and Trenk states that the upward book thickness of outerplanar DAGs is bounded above by a constant. In this paper, we show that the…
Parameterized Algorithms for Queue Layouts
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani +1
An -queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, such that no two independent edges of the same queue nes…