27 citations · 47 across the 9 of their papers we have counts for
11 papers
Stop Simulating! Efficient Computation of Tournament Winning Probabilities
Ulrik Brandes, Gordana Marmulla, Ivana Smokovic
In the run-up to any major sports tournament, winning probabilities of participants are publicized for engagement and betting purposes. These are generally based on simulating the…
Motif-Based Visual Analysis of Dynamic Networks
Eren Cakmak, Johannes Fuchs, Dominik Jäckle +3
Many data analysis problems rely on dynamic networks, such as social or communication network analyses. Providing a scalable overview of long sequences of such dynamic networks rem…
GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks
Kenza Amara, Rex Ying, Zitao Zhang +5
As one of the most popular machine learning models today, graph neural networks (GNNs) have attracted intense interest recently, and so does their explainability. Users are increas…
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes +2
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine…
Stochastic Gradient Descent Works Really Well for Stress Minimization
Katharina Börsig, Ulrik Brandes, Barna Pasztor
Stress minimization is among the best studied force-directed graph layout methods because it reliably yields high-quality layouts. It thus comes as a surprise that a novel approach…
Erratum: Fast and Simple Horizontal Coordinate Assignment
Ulrik Brandes, Julian Walter, Johannes Zink
We point out two flaws in the algorithm of Brandes and Köpf (Proc. GD 2001), which is often used for the horizontal coordinate assignment in Sugiyama's framework for layered layout…