13 citations · 27 across the 20 of their papers we have counts for
9 papers · 1 filter
Induced packing treewidth
Amir Nikabadi, Paweł Rzążewski
In this paper, we introduce a framework that aims to unify classes defined by forbidden induced subgraphs or induced minors with classes defined by the existence of certain structu…
Induced Erdős--Pósa property for long holes, long thetas, and beyond
Jadwiga Czyżewska, Tomáš Masařík, Marcin Pilipczuk +2
The induced Erdős--Pósa property in graphs relates the maximum number of pairwise anti-adjacent copies of an object with the minimum number of neighborhoods required to hit all cop…
Hitting all longest paths in -free graphs and -graphs
Paloma T. de Lima, Amir Nikabadi, Paweł Rzążewski
The \textit{longest path transversal number} of a connected graph , denoted by , is the minimum size of a set of vertices of that intersects all longest paths in …
List coloring ordered graphs with forbidden induced subgraphs
Marta Piecyk, Paweł Rzążewski
In the List -Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of . We need to decide if admits a proper co…
Kernelization for list -coloring for graphs with small vertex cover
Marta Piecyk, Astrid Pieterse, Paweł Rzążewski +1
For a fixed graph , in the List -Coloring problem, we are given a graph along with list for every , and we have to determine if there ex…
On coarse tree decompositions and coarse balanced separators
Tara Abrishami, Jadwiga Czyżewska, Kacper Kluk +3
It is known that there is a linear dependence between the treewidth of a graph and its balanced separator number: the smallest integer such that for every weighing of the verti…