| Finding small-width connected path decompositions in polynomial time D Dereniowski, D Osula, P Rzążewski Theoretical Computer Science 794, 85-100, 2019 | 6 | 2019 |
| On the connected and weakly convex domination numbers M Dettlaff, M Lemańska, D Osula, MJ Souto-Salorio arXiv preprint arXiv:1902.07505, 2019 | 3 | 2019 |
| The complexity of bicriteria tree-depth P Borowiecki, D Dereniowski, D Osula Theoretical Computer Science 947, 113682, 2023 | 2 | 2023 |
| Minimizing the Cost of Team Exploration D Osula SOFSEM 2019: Theory and Practice of Computer Science: 45th International …, 2019 | 2 | 2019 |
| Clearing directed subgraphs by mobile agents: Variations on covering with paths D Dereniowski, A Lingas, D Osula, M Persson, P Żyliński Journal of Computer and System Sciences 102, 57-68, 2019 | 1 | 2019 |
| Decontaminating arbitrary graphs by mobile agents: A survey D Urbańska Utilitas Mathematica 112, 1-29, 2019 | 1 | 2019 |
| On-line Search in Two-Dimensional Environment D Dereniowski, D Urbańska International Workshop on Approximation and Online Algorithms, 223-237, 2017 | 1 | 2017 |
| Twin domination number of Tournaments D Osula, R Zuazua arXiv preprint arXiv:1702.00646, 2017 | 1 | 2017 |
| Distributed searching of partial grids D Dereniowski, D Urbańska arXiv preprint arXiv:1610.01458, 2016 | 1 | 2016 |
| On the connected and weakly convex domination numbers M Lemańska, M Dettlaff, D Osula, MJS Salorio Journal of Combinatorial Mathematics and Combinatorial Computing 115, 227-243, 2020 | | 2020 |
| Multi-agent graph searching and exploration algorithms D Osula | | 2020 |
| On-line Search in Two-Dimensional Environment D Dereniowski, D Osula Theory of Computing Systems 63, 1819-1848, 2019 | | 2019 |
| The Snow Team Problem: (Clearing Directed Subgraphs by Mobile Agents) D Dereniowski, A Lingas, M Persson, D Urbańska, P Żyliński International Symposium on Fundamentals of Computation Theory, 190-203, 2017 | | 2017 |
| Realizacja zadań w grafie przez grupę mobilnych jednostek D Osula Młodzi Naukowcy, 2017 | | 2017 |
| ON THE CONNECTED AND WEAKLY CONVEX DOMINATION NUMBERS OF A GRAPH M Dettlaff, M Lemanska, D Urbanska The 6th Gda «sk Workshop on Graph Theory, 66, 0 | | |
Dariusz DereniowskiGdańsk University of TechnologyVerified email at eti.pg.edu.pl
