1 citations · 1 across the 11 of their papers we have counts for
Showing 2025 · cs.DSShow all
3 papers · 2 filters
cs.DS2025
A Faster Algorithm for Independent Cut
Vsevolod Chernyshev, Johannes Rauch, Dieter Rautenbach +1
The previously fastest algorithm for deciding the existence of an independent cut had a runtime of , where is the order of the input graph. We improve…
cs.DS2025
GridOT -- a discrete optimal transport solver on grids
Johannes Rauch, Leo Zanotti
We provide an improved implementation of Schmitzer's sparse multi-scale algorithm for discrete optimal transport on grids. We report roughly 2-4 times faster runtimes on the DOTmar…
cs.DS2025
Cutwidth and Crossings
Johannes Rauch, Dieter Rautenbach
We provide theoretical insights around the cutwidth of a graph and the One-Sided Crossing Minimization (OSCM) problem. OSCM was posed in the Parameterized Algorithms and Computatio…