Marek Sokołowski

activity

20212026

most citedAlmost-linear time parameterized algorithm for rankwidth via dynamic rankwidth

1 citations · 4 across the 22 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

cs.DS2022★ 1 cited

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument

Konrad Majewski, Tomáš Masařík, Jana Novotná +4

We revisit recent developments for the Maximum Weight Independent Set problem in graphs excluding a subdivided claw $S_{t, t, t}$ as an induced subgraph [Chudnovsky, Pilipczuk, Pilip…

math.CO2022★ 1 cited

Graphs of bounded twin-width are quasi-polynomially $χ$ -bounded

Michał Pilipczuk, Marek Sokołowski

We prove that for every $t \in N$ there is a constant $γ_{t}$ such that every graph with twin-width at most $t$ and clique number $ω$ has chromatic number bounded by $2^{γ_t…

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument

Graphs of bounded twin-width are quasi-polynomially χ-bounded

Graphs of bounded twin-width are quasi-polynomially $χ$ -bounded