| Cholesky factorization of matrices in parallel and ranking of graphs D Dereniowski, M Kubale International conference on parallel processing and applied mathematics, 985-992, 2003 | 118 | 2003 |
| Fast collaborative graph exploration D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański Information and Computation 243, 37-49, 2015 | 108 | 2015 |
| Collaborative exploration of trees by energy-constrained mobile robots S Das, D Dereniowski, C Karousatou Theory of Computing Systems 62 (5), 1223-1240, 2018 | 53* | 2018 |
| Drawing maps with advice D Dereniowski, A Pelc Journal of Parallel and Distributed Computing 72 (2), 132-143, 2012 | 52 | 2012 |
| From pathwidth to connected pathwidth D Dereniowski SIAM Journal on Discrete Mathematics 26 (4), 1709-1732, 2012 | 52 | 2012 |
| Zero-visibility cops and robber and the pathwidth of a graph D Dereniowski, D Dyer, RM Tifenbach, B Yang Journal of Combinatorial Optimization 29 (3), 541-564, 2015 | 49* | 2015 |
| Edge ranking and searching in partial orders D Dereniowski Discrete Applied Mathematics 156 (13), 2493-2500, 2008 | 46 | 2008 |
| Vertex rankings of chordal graphs and weighted trees D Dereniowski, A Nadolski Information processing letters 98 (3), 96-100, 2006 | 43 | 2006 |
| The complexity of zero-visibility cops and robber D Dereniowski, D Dyer, RM Tifenbach, B Yang Theoretical Computer Science 607, 135-148, 2015 | 37 | 2015 |
| Connected searching of weighted trees D Dereniowski Theoretical Computer Science 412 (41), 5700-5713, 2011 | 36 | 2011 |
| Edge ranking of weighted trees D Dereniowski Discrete Applied Mathematics 154 (8), 1198-1209, 2006 | 32 | 2006 |
| Bounds on the cover time of parallel rotor walks D Dereniowski, A Kosowski, D Pająk, P Uznański Journal of Computer and System Sciences 82 (5), 802-816, 2016 | 30 | 2016 |
| A framework for searching in graphs in the presence of errors D Dereniowski, S Tiegel, P Uznanski, D Wolleb-Graf 2nd Symposium on Simplicity in Algorithms (SOSA 2019), 4: 1-4: 17, 2019 | 29 | 2019 |
| Leader election for anonymous asynchronous agents in arbitrary networks D Dereniowski, A Pelc Distributed Computing 27 (1), 21-38, 2014 | 26 | 2014 |
| Efficient parallel query processing by graph ranking D Dereniowski, M Kubale Fundamenta Informaticae 69 (3), 273-285, 2006 | 24 | 2006 |
| Approximation strategies for generalized binary search in weighted trees D Dereniowski, A Kosowski, P Uznanski, M Zou 44th International Colloquium on Automata, Languages, and Programming, ICALP …, 2017 | 23 | 2017 |
| Discrete evacuation in graphs with multiple exits P Borowiecki, S Das, D Dereniowski, Ł Kuszner Theoretical Computer Science 1035, 115141, 2025 | 18* | 2025 |
| Collision-free network exploration J Czyzowicz, D Dereniowski, L Gąsieniec, R Klasing, A Kosowski, ... Journal of Computer and System Sciences 86, 70-81, 2017 | 17 | 2017 |
| The complexity of minimum-length path decompositions D Dereniowski, W Kubiak, Y Zwols Journal of Computer and System Sciences 81 (8), 1715-1747, 2015 | 16 | 2015 |
| Approximate search strategies for weighted trees D Dereniowski Theoretical Computer Science 463, 96-113, 2012 | 16 | 2012 |
Przemysław UznańskiPathwayVerified email at pathway.com
