1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
A Levelset Algorithm for 3D-Tarski
Sebastian Haslebacher, Jonas Lill
We present a simple new algorithm for finding a Tarski fixed point of a monotone function . Our algorithm runs in time and makes $O(\log^…
cs.DS2024
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
Jonas Lill, Kalina Petrova, Simon Weber
MaxCut is a classical NP-complete problem and a crucial building block in many combinatorial algorithms. The famous Edwards-Erdős bound states that any connected graph on n vertice…