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 2024Show all

3 papers · 1 filter

math.CO2024

Half-integral Erdős-Pósa property for non-null $S$ - $T$ paths

Vera Chekan, Colin Geniet, Meike Hatzel +4

For a group $Γ$ , a $Γ$ -labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $Γ$ so that opposite orientations of the same edge are…

cs.DS2024★ 1 cited

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth

Tuukka Korhonen, Marek Sokołowski

We give an algorithm that given a graph $G$ with $n$ vertices and $m$ edges and an integer $k$ , in time $O_{k} (n^{1 + o (1)}) + O (m)$ either outputs a rank decomposition of $G$ of width…

cs.LO2024

Elementary first-order model checking for sparse graphs

Jakub Gajarský, Michał Pilipczuk, Marek Sokołowski +2

It is known that for subgraph-closed graph classes the first-order model checking problem is fixed-parameter tractable if and only if the class is nowhere dense [Grohe, Kreutzer, S…

Half-integral Erdős-Pósa property for non-null S-T paths

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth

Elementary first-order model checking for sparse graphs

Half-integral Erdős-Pósa property for non-null $S$ - $T$ paths