38 citations · 77 across the 28 of their papers we have counts for
3 papers · 2 filters
Upward Point-Set Embeddability
Markus Geyer, Michael Kaufmann, Tamara Mchedlidze +1
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph has an upward planar embedding into a point set $S…
The Straight-Line RAC Drawing Problem is NP-Hard
Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis
Recent cognitive experiments have shown that the negative impact of an edge crossing on the human understanding of a graph drawing, tends to be eliminated in the case where the cro…
Maximizing the Total Resolution of Graphs
Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis
A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles f…