4 citations · 4 across the 5 of their papers we have counts for
5 papers
The Complexity of Bicriteria Tree-Depth
Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph . We introduce a bicriteria generalization in which additionally the…
On the connected and weakly convex domination numbers
Magda Dettlaff, Magdalena Lemańska, Dorota Osula +1
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and w…
Finding small-width connected path decompositions in polynomial time
Dariusz Dereniowski, Dorota Osula, Paweł Rzążewski
A connected path decomposition of a simple graph is a path decomposition such that the subgraph of induced by is connected for ea…
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula +2
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initia…
Twin domination number of Tournaments
Dorota Osula, Rita Zuazua
Let be a digraph. A subset of is called a twin dominating set of if for every vertex , there exists vertices such that and…