Cholesky Factorization of Matrices in Parallel and Ranking of Graphs. - Dariusz Dereniowski; Marek Kubale (PPAM, 2003)

Parallel Query Processing and Edge Ranking of Graphs. - Dariusz Dereniowski; Marek Kubale (PPAM, 2005)

Edge ranking of weighted trees. - Dariusz Dereniowski (Discret. Appl. Math., 2006)

Efficient Parallel Query Processing by Graph Ranking. - Dariusz Dereniowski; Marek Kubale (Fundam. Informaticae, 2006)

Vertex rankings of chordal graphs and weighted trees. - Dariusz Dereniowski; Adam Nadolski (Inf. Process. Lett., 2006)

Easy and hard instances of arc ranking in directed graphs. - Dariusz Dereniowski (Discret. Appl. Math., 2007)

The Complexity of List Ranking of Trees. - Dariusz Dereniowski (Ars Comb., 2008)

Edge ranking and searching in partial orders. - Dariusz Dereniowski (Discret. Appl. Math., 2008)

A Note on Compact and Compact Circular Edge-colorings of Graphs. - Dariusz Dereniowski; Adam Nadolski (Discret. Math. Theor. Comput. Sci., 2008)

Minimum vertex ranking spanning tree problem for chordal and proper interval graphs. - Dariusz Dereniowski (Discuss. Math. Graph Theory, 2009)

Maximum vertex occupation time and inert fugitive: Recontamination does help. - Dariusz Dereniowski (Inf. Process. Lett., 2009)

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. - Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2010)

Phutball is PSPACE-hard. - Dariusz Dereniowski (Theor. Comput. Sci., 2010)

The complexity of node blocking for dags. - Dariusz Dereniowski (J. Comb. Theory A, 2011)

Connected searching of weighted trees. - Dariusz Dereniowski (Theor. Comput. Sci., 2011)

An efficient algorithm for finding ideal schedules. - Edward G. Coffman Jr.; Dariusz Dereniowski; Wieslaw Kubiak (Acta Informatica, 2012)

Drawing maps with advice. - Dariusz Dereniowski; Andrzej Pelc (J. Parallel Distributed Comput., 2012)

Routing equal-size messages on a slotted ring. - Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2012)

From Pathwidth to Connected Pathwidth. - Dariusz Dereniowski (SIAM J. Discret. Math., 2012)

Approximate search strategies for weighted trees. - Dariusz Dereniowski (Theor. Comput. Sci., 2012)

Zero-Visibility Cops and Robber Game on a Graph. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (FAW-AAIM, 2013)

Minimum length path decompositions - Dariusz Dereniowski; Wieslaw Kubiak; Yori Zwols (CoRR, 2013)

Three-fast-searchable graphs. - Dariusz Dereniowski; Öznur Yasar Diner; Danny Dyer (Discret. Appl. Math., 2013)

On-line ranking of split graphs. - Piotr Borowiecki; Dariusz Dereniowski (Discret. Math. Theor. Comput. Sci., 2013)

Optimal edge-coloring with edge rate constraints. - Dariusz Dereniowski; Wieslaw Kubiak; Bernard Ries; Yori Zwols (Networks, 2013)

On minimum cost edge searching. - Dariusz Dereniowski; Danny Dyer (Theor. Comput. Sci., 2013)

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. - Shantanu Das 001; Dariusz Dereniowski; Adrian Kosowski; Przemyslaw Uznanski (SIROCCO, 2014)

Leader election for anonymous asynchronous agents in arbitrary networks. - Dariusz Dereniowski; Andrzej Pelc (Distributed Comput., 2014)

Brushing with additional cleaning restrictions. - Piotr Borowiecki; Dariusz Dereniowski; Pawel Pralat (Theor. Comput. Sci., 2014)

Collaborative Exploration by Energy-Constrained Mobile Robots. - Shantanu Das 001; Dariusz Dereniowski; Christina Karousatou (SIROCCO, 2015)

Structural Properties of an Open Problem in Preemptive Scheduling. - Bo Chen 002; Ed Coffman; Dariusz Dereniowski; Wieslaw Kubiak (CoRR, 2015)

Distributed graph searching with a sense of direction. - Piotr Borowiecki; Dariusz Dereniowski; Lukasz Kuszner (Distributed Comput., 2015)

Fast collaborative graph exploration. - Dariusz Dereniowski; Yann Disser; Adrian Kosowski; Dominik Pajak; Przemyslaw Uznanski (Inf. Comput., 2015)

Zero-visibility cops and robber and the pathwidth of a graph. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (J. Comb. Optim., 2015)

The complexity of minimum-length path decompositions. - Dariusz Dereniowski; Wieslaw Kubiak; Yori Zwols (J. Comput. Syst. Sci., 2015)

The complexity of zero-visibility cops and robber. - Dariusz Dereniowski; Danny Dyer; Ryan M. Tifenbach; Boting Yang (Theor. Comput. Sci., 2015)

Rendezvous of heterogeneous mobile agents in edge-weighted networks. - Dariusz Dereniowski; Ralf Klasing; Adrian Kosowski; Lukasz Kuszner (Theor. Comput. Sci., 2015)

Distinguishing views in symmetric networks: A tight lower bound. - Dariusz Dereniowski; Adrian Kosowski; Dominik Pajak (Theor. Comput. Sci., 2015)

The searchlight problem for road networks. - Dariusz Dereniowski; Hirotaka Ono 001; Ichiro Suzuki; Lukasz Wrona; Masafumi Yamashita; Pawel Zylinski (Theor. Comput. Sci., 2015)

Distributed Evacuation in Graphs with Multiple Exits. - Piotr Borowiecki; Shantanu Das 001; Dariusz Dereniowski; Lukasz Kuszner (SIROCCO, 2016)

Distributed Searching of Partial Grids. - Dariusz Dereniowski; Dorota Urbanska (CoRR, 2016)

Bounds on the cover time of parallel rotor walks. - Dariusz Dereniowski; Adrian Kosowski; Dominik Pajak; Przemyslaw Uznanski (J. Comput. Syst. Sci., 2016)

Normal-form preemption sequences for an open problem in scheduling theory. - Bo Chen 002; Ed Coffman; Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2016)

Topology recognition and leader election in colored networks. - Dariusz Dereniowski; Andrzej Pelc (Theor. Comput. Sci., 2016)

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. - Evangelos Bampas; Shantanu Das 001; Dariusz Dereniowski; Christina Karousatou (ALGOSENSORS, 2017)

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). - Dariusz Dereniowski; Andrzej Lingas; Mia Persson; Dorota Urbanska; Pawel Zylinski (FCT, 2017)

Approximation Strategies for Generalized Binary Search in Weighted Trees. - Dariusz Dereniowski; Adrian Kosowski; Przemyslaw Uznanski; Mengchuan Zou (ICALP, 2017)

Shared multi-processor scheduling. - Dariusz Dereniowski; Wieslaw Kubiak (Eur. J. Oper. Res., 2017)

Collision-free network exploration. - Jurek Czyzowicz; Dariusz Dereniowski; Leszek Gasieniec; Ralf Klasing; Adrian Kosowski; Dominik Pajak (J. Comput. Syst. Sci., 2017)

Brief Announcement: Energy Constrained Depth First Search. - Shantanu Das 001; Dariusz Dereniowski; Przemyslaw Uznanski (ICALP, 2018)

Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. - Shantanu Das 001; Dariusz Dereniowski; Christina Karousatou (Theory Comput. Syst., 2018)

Shared processor scheduling. - Dariusz Dereniowski; Wieslaw Kubiak (J. Sched., 2018)

A Framework for Searching in Graphs in the Presence of Errors. - Dariusz Dereniowski; Stefan Tiegel; Przemyslaw Uznanski; Daniel Wolleb-Graf (SOSA, 2019)

Clearing directed subgraphs by mobile agents: Variations on covering with paths. - Dariusz Dereniowski; Andrzej Lingas; Dorota Osula; Mia Persson; Pawel Zylinski (J. Comput. Syst. Sci., 2019)

On-line Search in Two-Dimensional Environment. - Dariusz Dereniowski; Dorota Osula (Theory Comput. Syst., 2019)

On Tradeoffs Between Width- and Fill-like Graph Parameters. - Dariusz Dereniowski; Adam Stanski (Theory Comput. Syst., 2019)

Cops, a fast robber and defensive domination on interval graphs. - Dariusz Dereniowski; Tomas Gavenciak; Jan Kratochvíl (Theor. Comput. Sci., 2019)

Finding small-width connected path decompositions in polynomial time. - Dariusz Dereniowski; Dorota Osula; Pawel Rzazewski (Theor. Comput. Sci., 2019)

Shared processor scheduling of multiprocessor jobs. - Dariusz Dereniowski; Wieslaw Kubiak (Eur. J. Oper. Res., 2020)

An Efficient Noisy Binary Search in Graphs via Median Approximation. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (IWOCA, 2021)

Building a Nest by an Automaton. - Jurek Czyzowicz; Dariusz Dereniowski; Andrzej Pelc (Algorithmica, 2021)

Noisy searching: simple, fast and correct. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (CoRR, 2021)

Searching by heterogeneous agents. - Dariusz Dereniowski; Lukasz Kuszner; Robert Ostrowski (J. Comput. Syst. Sci., 2021)

Gossiping by energy-constrained mobile agents in tree networks. - Jurek Czyzowicz; Dariusz Dereniowski; Robert Ostrowski; Wojciech Rytter (Theor. Comput. Sci., 2021)

On the Characteristic Graph of a Discrete Symmetric Channel. - Dariusz Dereniowski; Marcin Jurkiewicz (IEEE Trans. Inf. Theory, 2021)

Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. - Dariusz Dereniowski; Izajasz P. Wrosz (MFCS, 2022)

Edge and Pair Queries-Random Graphs and Complexity. - Dariusz Dereniowski; Przemyslaw Gordinowicz; Pawel Pralat (Electron. J. Comb., 2023)

The complexity of bicriteria tree-depth. - Piotr Borowiecki; Dariusz Dereniowski; Dorota Osula (Theor. Comput. Sci., 2023)

Searching in trees with monotonic query times. - Dariusz Dereniowski; Izajasz P. Wrosz (CoRR, 2024)

On multidimensional generalization of binary search. - Dariusz Dereniowski; Przemyslaw Gordinowicz; Karolina Wróbel (CoRR, 2024)

Low-degree spanning trees of 2-edge-connected graphs in linear time. - Dariusz Dereniowski; Janusz Dybizbanski; Przemyslaw Karpinski; Michal Zakrzewski; Pawel Zylinski (CoRR, 2024)

Energy Constrained Depth First Search. - Shantanu Das 001; Dariusz Dereniowski; Przemyslaw Uznanski (Algorithmica, 2024)

Noisy (Binary) Searching: Simple, Fast and Correct. - Dariusz Dereniowski; Aleksander Lukasiewicz; Przemyslaw Uznanski (STACS, 2025)

Discrete evacuation in graphs with multiple exits. - Piotr Borowiecki; Shantanu Das 001; Dariusz Dereniowski; Lukasz Kuszner (Theor. Comput. Sci., 2025)

A framework for distributed discrete evacuation strategies. - Piotr Borowiecki; Dariusz Dereniowski; Lukasz Kuszner (CoRR, 2025)