Obserwuj
Dariusz Dereniowski
Dariusz Dereniowski
Gdańsk University of Technology
Zweryfikowany adres z eti.pg.edu.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Cholesky factorization of matrices in parallel and ranking of graphs
D Dereniowski, M Kubale
Parallel Processing and Applied Mathematics: 5th International Conference …, 2004
902004
Fast collaborative graph exploration
D Dereniowski, Y Disser, A Kosowski, D Pająk, P Uznański
Information and Computation 243, 37-49, 2015
672015
Drawing maps with advice
D Dereniowski, A Pelc
Journal of Parallel and Distributed Computing 72 (2), 132-143, 2012
442012
Collaborative exploration of trees by energy-constrained mobile robots
S Das, D Dereniowski, C Karousatou
Theory of Computing Systems 62, 1223-1240, 2018
42*2018
Edge ranking and searching in partial orders
D Dereniowski
Discrete Applied Mathematics 156 (13), 2493-2500, 2008
332008
From pathwidth to connected pathwidth
D Dereniowski
SIAM Journal on Discrete Mathematics 26 (4), 1709-1732, 2012
322012
Zero-visibility cops and robber and the pathwidth of a graph
D Dereniowski, D Dyer, RM Tifenbach, B Yang
Journal of Combinatorial Optimization 29, 541-564, 2015
31*2015
Connected searching of weighted trees
D Dereniowski
Theoretical Computer Science 412 (41), 5700-5713, 2011
312011
Vertex rankings of chordal graphs and weighted trees
D Dereniowski, A Nadolski
Information Processing Letters 98 (3), 96-100, 2006
312006
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
282016
Leader election for anonymous asynchronous agents in arbitrary networks
D Dereniowski, A Pelc
Distributed Computing 27, 21-38, 2014
252014
Edge ranking of weighted trees
D Dereniowski
Discrete Applied Mathematics 154 (8), 1198-1209, 2006
242006
The complexity of zero-visibility cops and robber
D Dereniowski, D Dyer, RM Tifenbach, B Yang
Theoretical Computer Science 607, 135-148, 2015
232015
Approximation strategies for generalized binary search in weighted trees
D Dereniowski, A Kosowski, P Uznanski, M Zou
arXiv preprint arXiv:1702.08207, 2017
162017
The complexity of minimum-length path decompositions
D Dereniowski, W Kubiak, Y Zwols
Journal of Computer and System Sciences 81 (8), 1715-1747, 2015
162015
Efficient parallel query processing by graph ranking
D Dereniowski, M Kubale
Fundamenta Informaticae 69 (3), 273-285, 2006
15*2006
A framework for searching in graphs in the presence of errors
D Dereniowski, S Tiegel, P Uznański, D Wolleb-Graf
arXiv preprint arXiv:1804.02075, 2018
142018
Rendezvous of distance-aware mobile agents in unknown graphs
S Das, D Dereniowski, A Kosowski, P Uznański
Structural Information and Communication Complexity: 21st International …, 2014
132014
Approximate search strategies for weighted trees
D Dereniowski
Theoretical Computer Science 463, 96-113, 2012
122012
Rank Coloring of Graphs.
D Dereniowski
122004
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20