Simon Meierhans

activity

20182026

most citedContent Adaptive Optimization for Neural Image Compression

21 citations · 33 across the 12 of their papers we have counts for

collaborators

Showing 2023 · cs.DSShow all

2 papers · 2 filters

cs.DS2023

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$ - $t$ Shortest Path, and Minimum-Cost Flow

Li Chen, Rasmus Kyng, Yang P. Liu +2

We give the first almost-linear time algorithms for several problems in incremental graphs including cycle detection, strongly connected component maintenance, $s$ - $t$ shortest pat…

cs.DS2023★ 1 cited

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications

Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg

We present a general toolbox, based on new vertex sparsifiers, for designing data structures to maintain shortest paths in dynamic graphs. In an $m$ -edge graph undergoing edge inse…

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications

Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, $s$ - $t$ Shortest Path, and Minimum-Cost Flow