research
∙
07/15/2022
Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
We study the parameterized problem of satisfying “almost all” constraint...
share
research
∙
02/20/2020
On quasipolynomial multicut-mimicking networks and kernelization of multiway cut problems
We show the existence of an exact mimicking network of k^O(log k) edges ...
research
∙
10/16/2018
Multi-budgeted directed cuts
We study multi-budgeted variants of the classic minimum cut problem and ...
research
∙
04/27/2018
