Dorota Osula

activity

20172021

most citedFinding small-width connected path decompositions in polynomial time

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

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.DM2017

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…

math.CO2017

Twin domination number of Tournaments

Dorota Osula, Rita Zuazua

Let $D = (V, A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v \in V - S$ , there exists vertices $u_{1}, u_{2} \in S$ such that $(v, u_{1})$ and…