27 citations · 82 across the 20 of their papers we have counts for
6 papers · 1 filter
Dynamic algorithms for k-center on graphs
Emilio Cruciani, Sebastian Forster, Gramoz Goranci +2
In this paper we give the first efficient algorithms for the -center problem on dynamic graphs undergoing edge updates. In this problem, the goal is to partition the input into…
On Dynamic Graph Algorithms with Predictions
Jan van den Brand, Sebastian Forster, Yasamin Nazari +1
We study dynamic algorithms in the model of algorithms with predictions. We assume the algorithm is given imperfect predictions regarding future updates, and we ask how such predic…
Fast 2-Approximate All-Pairs Shortest Paths
Michal Dory, Sebastian Forster, Yael Kirkpatrick +3
In this paper, we revisit the classic approximate All-Pairs Shortest Paths (APSP) problem in undirected graphs. For unweighted graphs, we provide an algorithm for -approximate A…
Fast Algorithms for Energy Games in Special Cases
Sebastian Forster, Antonis Skarlatos, Tijn de Vos
In this paper, we study algorithms for special cases of energy games, a class of turn-based games on graphs that show up in the quantitative analysis of reactive systems. In an ene…
The Laplacian Paradigm in Deterministic Congested Clique
Sebatian Forster, Tijn de Vos
In this paper, we bring the techniques of the Laplacian paradigm to the congested clique, while further restricting ourselves to deterministic algorithms. In particular, we show ho…
Bootstrapping Dynamic Distance Oracles
Sebastian Forster, Gramoz Goranci, Yasamin Nazari +1
Designing approximate all-pairs distance oracles in the fully dynamic setting is one of the central problems in dynamic graph algorithms. Despite extensive research on this topic,…