research
∙
08/01/2023
Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-f Time Barrier
The dynamic set cover problem has been subject to extensive research sin...
share
research
∙
07/05/2023
Density-Sensitive Algorithms for (Δ+ 1)-Edge Coloring
Vizing's theorem asserts the existence of a (Δ+1)-edge coloring for any ...
research
∙
08/19/2021
Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds
In their breakthrough ICALP'15 paper, Bernstein and Stein presented an a...
research
∙
05/14/2021
