Skip to content

Author

Karol Węgrzycki

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#edge computing Preprint Nov 2026

Counting over Unbreakable Decompositions: A Single-Exponential Parameterized Algorithm for Minimum Bisection

The dynamic program can be implemented on top of an unbreakable decomposition using algebraic techniques and compute in time a tree decomposition with adhesions of size at most $2k$ whose bags are $(3k,k)$-edge-unbreakable inside their own subtrees.

Aditya Anand, Evangelos Kipouridis, Karol Węgrzycki · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.