Dariusz Dereniowski
Person information
- affiliation: Gdansk University of Technology, Poland
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
- [c20]Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf:
A Framework for Searching in Graphs in the Presence of Errors. SOSA@SODA 2019: 4:1-4:17 - 2018
- [j39]Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. Theory Comput. Syst. 62(5): 1223-1240 (2018) - [j38]Dariusz Dereniowski, Wieslaw Kubiak:
Shared processor scheduling. J. Scheduling 21(6): 583-593 (2018) - [c19]Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Brief Announcement: Energy Constrained Depth First Search. ICALP 2018: 165:1-165:5 - [i21]Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski:
Finding small-width connected path decompositions in polynomial time. CoRR abs/1802.05501 (2018) - [i20]Dariusz Dereniowski, Adam Stanski:
On tradeoffs between width- and fill-like graph parameters. CoRR abs/1802.09620 (2018) - [i19]Dariusz Dereniowski, Daniel Graf, Stefan Tiegel, Przemyslaw Uznanski:
A Framework for Searching in Graphs in the Presence of Errors. CoRR abs/1804.02075 (2018) - [i18]Dariusz Dereniowski, Wieslaw Kubiak:
Shared Processor Scheduling of Multiprocessor Jobs. CoRR abs/1807.08011 (2018) - 2017
- [j37]Dariusz Dereniowski, Wieslaw Kubiak:
Shared multi-processor scheduling. European Journal of Operational Research 261(2): 503-514 (2017) - [j36]Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Collision-free network exploration. J. Comput. Syst. Sci. 86: 70-81 (2017) - [c18]Evangelos Bampas, Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. ALGOSENSORS 2017: 1-12 - [c17]Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski:
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT 2017: 190-203 - [c16]Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou:
Approximation Strategies for Generalized Binary Search in Weighted Trees. ICALP 2017: 84:1-84:14 - [c15]Dariusz Dereniowski, Dorota Urbanska:
On-line Search in Two-Dimensional Environment. WAOA 2017: 223-237 - [i17]Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou:
Approximation Strategies for Generalized Binary Search in Weighted Trees. CoRR abs/1702.08207 (2017) - [i16]
- [i15]Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski:
Energy Constrained Depth First Search. CoRR abs/1709.10146 (2017) - [i14]Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski:
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR abs/1712.00316 (2017) - 2016
- [j35]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Bounds on the cover time of parallel rotor walks. J. Comput. Syst. Sci. 82(5): 802-816 (2016) - [j34]Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
Normal-form preemption sequences for an open problem in scheduling theory. J. Scheduling 19(6): 701-728 (2016) - [j33]Dariusz Dereniowski, Andrzej Pelc:
Topology recognition and leader election in colored networks. Theor. Comput. Sci. 621: 92-102 (2016) - [c14]Piotr Borowiecki, Shantanu Das, Dariusz Dereniowski, Lukasz Kuszner:
Distributed Evacuation in Graphs with Multiple Exits. SIROCCO 2016: 228-241 - [i13]Dariusz Dereniowski, Andrzej Pelc:
Topology Recognition and Leader Election in Colored Networks. CoRR abs/1601.07790 (2016) - [i12]
- [i11]Dariusz Dereniowski, Dorota Urbanska:
Distributed Searching of Partial Grids. CoRR abs/1610.01458 (2016) - 2015
- [j32]Piotr Borowiecki, Dariusz Dereniowski, Lukasz Kuszner:
Distributed graph searching with a sense of direction. Distributed Computing 28(3): 155-170 (2015) - [j31]Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast collaborative graph exploration. Inf. Comput. 243: 37-49 (2015) - [j30]Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
Zero-visibility cops and robber and the pathwidth of a graph. J. Comb. Optim. 29(3): 541-564 (2015) - [j29]Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols:
The complexity of minimum-length path decompositions. J. Comput. Syst. Sci. 81(8): 1715-1747 (2015) - [j28]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak:
Distinguishing views in symmetric networks: A tight lower bound. Theor. Comput. Sci. 582: 27-34 (2015) - [j27]Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski:
The searchlight problem for road networks. Theor. Comput. Sci. 591: 28-59 (2015) - [j26]Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
The complexity of zero-visibility cops and robber. Theor. Comput. Sci. 607: 135-148 (2015) - [j25]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theor. Comput. Sci. 608: 219-230 (2015) - [c13]Shantanu Das, Dariusz Dereniowski, Christina Karousatou:
Collaborative Exploration by Energy-Constrained Mobile Robots. SIROCCO 2015: 357-369 - [i10]Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak:
Structural Properties of an Open Problem in Preemptive Scheduling. CoRR abs/1502.04600 (2015) - 2014
- [j24]Dariusz Dereniowski, Andrzej Pelc:
Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Computing 27(1): 21-38 (2014) - [j23]Piotr Borowiecki, Dariusz Dereniowski, Pawel Pralat:
Brushing with additional cleaning restrictions. Theor. Comput. Sci. 557: 76-86 (2014) - [c12]Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
The Complexity of Zero-Visibility Cops and Robber. FAW 2014: 60-70 - [c11]Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak:
Collision-Free Network Exploration. LATIN 2014: 342-354 - [c10]Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. SIROCCO 2014: 295-310 - [c9]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. SIROCCO 2014: 311-326 - [c8]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Bounds on the Cover Time of Parallel Rotor Walks. STACS 2014: 263-275 - [i9]Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner:
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks. CoRR abs/1406.2008 (2014) - [i8]Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski:
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs. CoRR abs/1406.2795 (2014) - [i7]Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak:
Distinguishing Views in Symmetric Networks: A Tight Lower Bound. CoRR abs/1407.2511 (2014) - 2013
- [j22]Dariusz Dereniowski, Öznur Yasar Diner, Danny Dyer:
Three-fast-searchable graphs. Discrete Applied Mathematics 161(13-14): 1950-1958 (2013) - [j21]Piotr Borowiecki, Dariusz Dereniowski:
On-line ranking of split graphs. Discrete Mathematics & Theoretical Computer Science 15(2): 195-214 (2013) - [j20]Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols:
Optimal edge-coloring with edge rate constraints. Networks 62(3): 165-182 (2013) - [j19]Dariusz Dereniowski, Danny Dyer:
On minimum cost edge searching. Theor. Comput. Sci. 495: 37-49 (2013) - [c7]Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang:
Zero-Visibility Cops and Robber Game on a Graph. FAW-AAIM 2013: 175-186 - [c6]Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Fast Collaborative Graph Exploration. ICALP (2) 2013: 520-532 - [i6]Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols:
Minimum length path decompositions. CoRR abs/1302.2788 (2013) - 2012
- [j18]Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak:
An efficient algorithm for finding ideal schedules. Acta Inf. 49(1): 1-14 (2012) - [j17]Dariusz Dereniowski, Andrzej Pelc:
Drawing maps with advice. J. Parallel Distrib. Comput. 72(2): 132-143 (2012) - [j16]Dariusz Dereniowski, Wieslaw Kubiak:
Routing equal-size messages on a slotted ring. J. Scheduling 15(4): 473-486 (2012) - [j15]Dariusz Dereniowski:
From Pathwidth to Connected Pathwidth. SIAM J. Discrete Math. 26(4): 1709-1732 (2012) - [j14]Dariusz Dereniowski:
Approximate search strategies for weighted trees. Theor. Comput. Sci. 463: 96-113 (2012) - [i5]Dariusz Dereniowski, Andrzej Pelc:
Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks. CoRR abs/1205.6249 (2012) - 2011
- [j13]Dariusz Dereniowski:
The complexity of node blocking for dags. J. Comb. Theory, Ser. A 118(1): 248-256 (2011) - [j12]Dariusz Dereniowski:
Connected searching of weighted trees. Theor. Comput. Sci. 412(41): 5700-5713 (2011) - [c5]
- 2010
- [j11]Dariusz Dereniowski, Wieslaw Kubiak:
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. J. Scheduling 13(5): 479-492 (2010) - [j10]
- [c4]
- [c3]
- [i4]
- [i3]
2000 – 2009
- 2009
- [j9]Dariusz Dereniowski:
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs. Discussiones Mathematicae Graph Theory 29(2): 253-261 (2009) - [j8]Dariusz Dereniowski:
Maximum vertex occupation time and inert fugitive: Recontamination does help. Inf. Process. Lett. 109(9): 422-426 (2009) - 2008
- [j7]
- [j6]Dariusz Dereniowski:
Edge ranking and searching in partial orders. Discrete Applied Mathematics 156(13): 2493-2500 (2008) - [j5]Dariusz Dereniowski, Adam Nadolski:
A Note on Compact and Compact Circular Edge-colorings of Graphs. Discrete Mathematics & Theoretical Computer Science 10(3) (2008) - [i2]
- [i1]
- 2007
- [j4]Dariusz Dereniowski:
Easy and hard instances of arc ranking in directed graphs. Discrete Applied Mathematics 155(18): 2601-2611 (2007) - 2006
- [j3]Dariusz Dereniowski:
Edge ranking of weighted trees. Discrete Applied Mathematics 154(8): 1198-1209 (2006) - [j2]Dariusz Dereniowski, Marek Kubale:
Efficient Parallel Query Processing by Graph Ranking. Fundam. Inform. 69(3): 273-285 (2006) - [j1]Dariusz Dereniowski, Adam Nadolski:
Vertex rankings of chordal graphs and weighted trees. Inf. Process. Lett. 98(3): 96-100 (2006) - 2005
- [c2]Dariusz Dereniowski, Marek Kubale:
Parallel Query Processing and Edge Ranking of Graphs. PPAM 2005: 463-469 - 2003
- [c1]Dariusz Dereniowski, Marek Kubale:
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs. PPAM 2003: 985-992
Coauthor Index
last updated on 2019-01-11 22:21 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint