default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDariusz 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
2020 – today
- 2024
[j52]Shantanu Das, Dariusz Dereniowski
, Przemyslaw Uznanski:
Energy Constrained Depth First Search. Algorithmica 86(12): 3759-3782 (2024)- [i30]Dariusz Dereniowski, Izajasz P. Wrosz:
Searching in trees with monotonic query times. CoRR abs/2401.13747 (2024) - [i29]Dariusz Dereniowski, Przemyslaw Gordinowicz, Karolina Wróbel:
On multidimensional generalization of binary search. CoRR abs/2404.13193 (2024) - [i28]Dariusz Dereniowski, Janusz Dybizbanski, Przemyslaw Karpinski, Michal Zakrzewski, Pawel Zylinski:
Low-degree spanning trees of 2-edge-connected graphs in linear time. CoRR abs/2410.20137 (2024) - 2023
- [j51]Dariusz Dereniowski, Przemyslaw Gordinowicz, Pawel Pralat:
Edge and Pair Queries-Random Graphs and Complexity. Electron. J. Comb. 30(2) (2023) - [j50]Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula:
The complexity of bicriteria tree-depth. Theor. Comput. Sci. 947: 113682 (2023) - 2022
- [c25]Dariusz Dereniowski, Izajasz P. Wrosz:
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. MFCS 2022: 42:1-42:15 - [i27]Dariusz Dereniowski, Przemyslaw Gordinowicz, Pawel Pralat:
Edge and Pair Queries - Random Graphs and Complexity. CoRR abs/2203.06006 (2022) - 2021
- [j49]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. Algorithmica 83(1): 144-176 (2021) - [j48]Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski:
Searching by heterogeneous agents. J. Comput. Syst. Sci. 115: 1-21 (2021) - [j47]Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter:
Gossiping by energy-constrained mobile agents in tree networks. Theor. Comput. Sci. 861: 45-65 (2021) - [j46]Dariusz Dereniowski, Marcin Jurkiewicz:
On the Characteristic Graph of a Discrete Symmetric Channel. IEEE Trans. Inf. Theory 67(6): 3818-3823 (2021) - [c24]Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula:
The Complexity of Bicriteria Tree-Depth. FCT 2021: 100-113 - [c23]Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski:
An Efficient Noisy Binary Search in Graphs via Median Approximation. IWOCA 2021: 265-281 - [i26]Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula:
The Complexity of Bicriteria Tree-Depth. CoRR abs/2101.06645 (2021) - [i25]Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski:
Searching by Heterogeneous Agents. CoRR abs/2105.02609 (2021) - [i24]Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski:
Noisy searching: simple, fast and correct. CoRR abs/2107.05753 (2021) - 2020
- [j45]Dariusz Dereniowski, Wieslaw Kubiak:
Shared processor scheduling of multiprocessor jobs. Eur. J. Oper. Res. 282(2): 464-477 (2020) - [i23]Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski:
An Efficient Noisy Binary Search in Graphs via Median Approximation. CoRR abs/2005.00144 (2020)
2010 – 2019
- 2019
- [j44]Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski:
Clearing directed subgraphs by mobile agents: Variations on covering with paths. J. Comput. Syst. Sci. 102: 57-68 (2019) - [j43]Dariusz Dereniowski, Adam Stanski:
On Tradeoffs Between Width- and Fill-like Graph Parameters. Theory Comput. Syst. 63(3): 450-465 (2019) - [j42]Dariusz Dereniowski, Dorota Osula:
On-line Search in Two-Dimensional Environment. Theory Comput. Syst. 63(8): 1819-1848 (2019) - [j41]Dariusz Dereniowski, Tomas Gavenciak, Jan Kratochvíl:
Cops, a fast robber and defensive domination on interval graphs. Theor. Comput. Sci. 794: 47-58 (2019) - [j40]Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski:
Finding small-width connected path decompositions in polynomial time. Theor. Comput. Sci. 794: 85-100 (2019) - [c22]Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski:
Searching by Heterogeneous Agents. CIAC 2019: 199-211 - [c21]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. ESA 2019: 35:1-35:14 - [c20]Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf:
A Framework for Searching in Graphs in the Presence of Errors. SOSA 2019: 4:1-4:17 - [i22]Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc:
Building a Nest by an Automaton. CoRR abs/1904.10850 (2019) - 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. Sched. 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. Eur. J. Oper. Res. 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]Dariusz Dereniowski, Wieslaw Kubiak:
Shared processor scheduling. CoRR abs/1704.06361 (2017) - [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. Sched. 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]Dariusz Dereniowski, Wieslaw Kubiak:
Shared multi-processor scheduling. CoRR abs/1607.06021 (2016) - [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 Comput. 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 Comput. 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. Discret. Appl. Math. 161(13-14): 1950-1958 (2013) - [j21]Piotr Borowiecki, Dariusz Dereniowski:
On-line ranking of split graphs. Discret. Math. Theor. Comput. Sci. 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 Informatica 49(1): 1-14 (2012) - [j17]Dariusz Dereniowski, Andrzej Pelc:
Drawing maps with advice. J. Parallel Distributed Comput. 72(2): 132-143 (2012) - [j16]Dariusz Dereniowski, Wieslaw Kubiak:
Routing equal-size messages on a slotted ring. J. Sched. 15(4): 473-486 (2012) - [j15]Dariusz Dereniowski:
From Pathwidth to Connected Pathwidth. SIAM J. Discret. 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 A 118(1): 248-256 (2011) - [j12]Dariusz Dereniowski:
Connected searching of weighted trees. Theor. Comput. Sci. 412(41): 5700-5713 (2011) - [c5]Dariusz Dereniowski:
From Pathwidth to Connected Pathwidth. STACS 2011: 416-427 - 2010
- [j11]Dariusz Dereniowski, Wieslaw Kubiak:
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. J. Sched. 13(5): 479-492 (2010) - [j10]Dariusz Dereniowski:
Phutball is PSPACE-hard. Theor. Comput. Sci. 411(44-46): 3971-3978 (2010) - [c4]Dariusz Dereniowski:
Connected Searching of Weighted Trees. MFCS 2010: 330-341 - [c3]Dariusz Dereniowski, Andrzej Pelc:
Drawing Maps with Advice. DISC 2010: 328-342 - [i4]Dariusz Dereniowski:
Connected searching of weighted trees. CoRR abs/1001.4341 (2010) - [i3]Dariusz Dereniowski:
From Pathwidth to Connected Pathwidth. CoRR abs/1007.1269 (2010)
2000 – 2009
- 2009
- [j9]Dariusz Dereniowski:
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs. Discuss. Math. 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]Dariusz Dereniowski:
The Complexity of List Ranking of Trees. Ars Comb. 86 (2008) - [j6]Dariusz Dereniowski:
Edge ranking and searching in partial orders. Discret. Appl. Math. 156(13): 2493-2500 (2008) - [j5]Dariusz Dereniowski, Adam Nadolski:
A Note on Compact and Compact Circular Edge-colorings of Graphs. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [i2]Dariusz Dereniowski:
The Complexity of Node Blocking for Dags. CoRR abs/0802.3513 (2008) - [i1]Dariusz Dereniowski:
Phutball is PSPACE-hard. CoRR abs/0804.1777 (2008) - 2007
- [j4]Dariusz Dereniowski:
Easy and hard instances of arc ranking in directed graphs. Discret. Appl. Math. 155(18): 2601-2611 (2007) - 2006
- [j3]Dariusz Dereniowski:
Edge ranking of weighted trees. Discret. Appl. Math. 154(8): 1198-1209 (2006) - [j2]Dariusz Dereniowski, Marek Kubale:
Efficient Parallel Query Processing by Graph Ranking. Fundam. Informaticae 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
