4 citations · 4 across the 3 of their papers we have counts for
3 papers
The Eclipse Layout Kernel
Sören Domrös, Reinhard von Hanxleden, Miro Spönemann +2
The Eclipse Layout Kernel (ELK) is a collection of graph drawing algorithms that supports compound graph layout and ports as explicit anchor points of edges. It is available as ope…
A Generalization of the Directed Graph Layering Problem
Ulf Rüegg, Thorsten Ehlers, Miro Spönemann +1
The Directed Layering Problem (DLP) solves a step of the widely used layer-based approach to automatically draw directed acyclic graphs. To cater for cyclic graphs, usually a prepr…
The Open Graph Archive: A Community-Driven Effort
Christian Bachmaier, Franz J. Brandenburg, Philip Effinger +6
In order to evaluate, compare, and tune graph algorithms, experiments on well designed benchmark sets have to be performed. Together with the goal of reproducibility of experimenta…