6 papers
Revisiting Diameter in Directed Graphs
Ben Bals, Joakim Blikstad, Daniel Dadush +2
The reachability diameter () of a directed graph is the maximum distance over all pairs where is reachable from . This notion is present in the def…
Graph Discovery and Source Detection in Temporal Graphs
Ben Bals
Researchers, policy makers, and engineers need to make sense of data on spreading processes as diverse as viral infections, water contamination, and misinformation in social networ…
Dynamic Network Discovery via Infection Tracing
Ben Bals, Michelle Döring, Nicolas Klodt +1
Researchers, policy makers, and engineers need to make sense of data from spreading processes as diverse as rumor spreading in social networks, viral infections, and water contamin…
Catch Me If You Can: Finding the Source of Infections in Temporal Networks
Ben Bals, Michelle Döring, Nicolas Klodt +1
Source detection (SD) is the task of finding the origin of a spreading process in a network. Algorithms for SD help us combat diseases, misinformation, pollution, and more, and hav…
How to Reduce Temporal Cliques to Find Sparse Spanners
Sebastian Angrick, Ben Bals, Tobias Friedrich +7
Many real-world networks, such as transportation or trade networks, are dynamic in the sense that the edge set may change over time, but these changes are known in advance. This be…
Towards Explainable Real Estate Valuation via Evolutionary Algorithms
Sebastian Angrick, Ben Bals, Niko Hastrich +6
Human lives are increasingly influenced by algorithms, which therefore need to meet higher standards not only in accuracy but also with respect to explainability. This is especiall…