Dorota Osula
From MaRDI portal
Person:1741491
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| The complexity of bicriteria tree-depth Theoretical Computer Science | 2023-02-01 | Paper |
| The complexity of bicriteria tree-depth Fundamentals of Computation Theory | 2022-05-20 | Paper |
| On the connected and weakly convex domination numbers (available as arXiv preprint) | 2021-06-23 | Paper |
| Decontaminating arbitrary graphs by mobile agents: a survey | 2020-11-12 | Paper |
| Minimizing the cost of team exploration (available as arXiv preprint) | 2020-10-22 | Paper |
| On-line search in two-dimensional environment Theory of Computing Systems | 2019-12-19 | Paper |
| Finding small-width connected path decompositions in polynomial time Theoretical Computer Science | 2019-10-16 | Paper |
| Clearing directed subgraphs by mobile agents. Variations on covering with paths Journal of Computer and System Sciences | 2019-05-03 | Paper |
| Twin domination number of Tournaments | 2017-02-02 | Paper |
Research outcomes over time
This page was built for person: Dorota Osula
