Dariusz Dereniowski

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 50

Top Venues

CoRR

Theor. Comput. Sci.

J. Comput. Syst. Sci.

SIROCCO

Publications

Dariusz Dereniowski, Przemyslaw Gordinowicz, Karolina Wróbel
On multidimensional generalization of binary search. CoRR (2024)
Dariusz Dereniowski, Izajasz P. Wrosz
Searching in trees with monotonic query times. CoRR (2024)
Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
The complexity of bicriteria tree-depth. Theor. Comput. Sci. 947 (2023)
Dariusz Dereniowski, Przemyslaw Gordinowicz, Pawel Pralat
Edge and Pair Queries-Random Graphs and Complexity. Electron. J. Comb. 30 (2) (2023)
Dariusz Dereniowski, Przemyslaw Gordinowicz, Pawel Pralat
Edge and Pair Queries - Random Graphs and Complexity. CoRR (2022)
Dariusz Dereniowski, Izajasz P. Wrosz
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. MFCS (2022)
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Building a Nest by an Automaton. Algorithmica 83 (1) (2021)
Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski
Searching by Heterogeneous Agents. CoRR (2021)
Dariusz Dereniowski, Marcin Jurkiewicz
On the Characteristic Graph of a Discrete Symmetric Channel. IEEE Trans. Inf. Theory 67 (6) (2021)
Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski
An Efficient Noisy Binary Search in Graphs via Median Approximation. IWOCA (2021)
Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
The Complexity of Bicriteria Tree-Depth. CoRR (2021)
Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter
Gossiping by energy-constrained mobile agents in tree networks. Theor. Comput. Sci. 861 (2021)
Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski
Searching by heterogeneous agents. J. Comput. Syst. Sci. 115 (2021)
Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
The Complexity of Bicriteria Tree-Depth. FCT (2021)
Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski
Noisy searching: simple, fast and correct. CoRR (2021)
Dariusz Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uznanski
An Efficient Noisy Binary Search in Graphs via Median Approximation. CoRR (2020)
Dariusz Dereniowski, Wieslaw Kubiak
Shared processor scheduling of multiprocessor jobs. Eur. J. Oper. Res. 282 (2) (2020)
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Building a Nest by an Automaton. CoRR (2019)
Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski
Searching by Heterogeneous Agents. CIAC (2019)
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 (2019)
Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, Daniel Wolleb-Graf
A Framework for Searching in Graphs in the Presence of Errors. SOSA (2019)
Jurek Czyzowicz, Dariusz Dereniowski, Andrzej Pelc
Building a Nest by an Automaton. ESA (2019)
Dariusz Dereniowski, Adam Stanski
On Tradeoffs Between Width- and Fill-like Graph Parameters. Theory Comput. Syst. 63 (3) (2019)
Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski
Finding small-width connected path decompositions in polynomial time. Theor. Comput. Sci. 794 (2019)
Dariusz Dereniowski, Dorota Osula
On-line Search in Two-Dimensional Environment. Theory Comput. Syst. 63 (8) (2019)
Dariusz Dereniowski, Tomas Gavenciak, Jan Kratochvíl
Cops, a fast robber and defensive domination on interval graphs. Theor. Comput. Sci. 794 (2019)
Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski
Brief Announcement: Energy Constrained Depth First Search. ICALP (2018)
Dariusz Dereniowski, Dorota Osula, Pawel Rzazewski
Finding small-width connected path decompositions in polynomial time. CoRR (2018)
Dariusz Dereniowski, Wieslaw Kubiak
Shared processor scheduling. J. Sched. 21 (6) (2018)
Dariusz Dereniowski, Wieslaw Kubiak
Shared Processor Scheduling of Multiprocessor Jobs. CoRR (2018)
Dariusz Dereniowski, Daniel Graf, Stefan Tiegel, Przemyslaw Uznanski
A Framework for Searching in Graphs in the Presence of Errors. CoRR (2018)
Dariusz Dereniowski, Adam Stanski
On tradeoffs between width- and fill-like graph parameters. CoRR (2018)
Shantanu Das, Dariusz Dereniowski, Christina Karousatou
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots. Theory Comput. Syst. 62 (5) (2018)
Dariusz Dereniowski, Wieslaw Kubiak
Shared processor scheduling. CoRR (2017)
Evangelos Bampas, Shantanu Das, Dariusz Dereniowski, Christina Karousatou
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots. ALGOSENSORS (2017)
Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents). FCT (2017)
Dariusz Dereniowski, Wieslaw Kubiak
Shared multi-processor scheduling. Eur. J. Oper. Res. 261 (2) (2017)
Shantanu Das, Dariusz Dereniowski, Przemyslaw Uznanski
Energy Constrained Depth First Search. CoRR (2017)
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak
Collision-free network exploration. J. Comput. Syst. Sci. 86 (2017)
Dariusz Dereniowski, Dorota Urbanska
On-line Search in Two-Dimensional Environment. WAOA (2017)
Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou
Approximation Strategies for Generalized Binary Search in Weighted Trees. ICALP (2017)
Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski
The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents). CoRR (2017)
Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou
Approximation Strategies for Generalized Binary Search in Weighted Trees. CoRR (2017)
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Bounds on the cover time of parallel rotor walks. J. Comput. Syst. Sci. 82 (5) (2016)
Dariusz Dereniowski, Wieslaw Kubiak
Shared multi-processor scheduling. CoRR (2016)
Dariusz Dereniowski, Andrzej Pelc
Topology Recognition and Leader Election in Colored Networks. CoRR (2016)
Dariusz Dereniowski, Dorota Urbanska
Distributed Searching of Partial Grids. CoRR (2016)
Dariusz Dereniowski, Andrzej Pelc
Topology recognition and leader election in colored networks. Theor. Comput. Sci. 621 (2016)
Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak
Normal-form preemption sequences for an open problem in scheduling theory. J. Sched. 19 (6) (2016)
Piotr Borowiecki, Shantanu Das, Dariusz Dereniowski, Lukasz Kuszner
Distributed Evacuation in Graphs with Multiple Exits. SIROCCO (2016)
Dariusz Dereniowski, Hirotaka Ono, Ichiro Suzuki, Lukasz Wrona, Masafumi Yamashita, Pawel Zylinski
The searchlight problem for road networks. Theor. Comput. Sci. 591 (2015)
Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
The complexity of minimum-length path decompositions. J. Comput. Syst. Sci. 81 (8) (2015)
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak
Distinguishing views in symmetric networks: A tight lower bound. Theor. Comput. Sci. 582 (2015)
Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
The complexity of zero-visibility cops and robber. Theor. Comput. Sci. 607 (2015)
Shantanu Das, Dariusz Dereniowski, Christina Karousatou
Collaborative Exploration by Energy-Constrained Mobile Robots. SIROCCO (2015)
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
Rendezvous of heterogeneous mobile agents in edge-weighted networks. Theor. Comput. Sci. 608 (2015)
Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak
Structural Properties of an Open Problem in Preemptive Scheduling. CoRR (2015)
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Fast collaborative graph exploration. Inf. Comput. 243 (2015)
Piotr Borowiecki, Dariusz Dereniowski, Lukasz Kuszner
Distributed graph searching with a sense of direction. Distributed Comput. 28 (3) (2015)
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) (2015)
Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski
Rendezvous of Distance-aware Mobile Agents in Unknown Graphs. CoRR (2014)
Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
The Complexity of Zero-Visibility Cops and Robber. FAW (2014)
Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs. SIROCCO (2014)
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak
Distinguishing Views in Symmetric Networks: A Tight Lower Bound. CoRR (2014)
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks. SIROCCO (2014)
Dariusz Dereniowski, Ralf Klasing, Adrian Kosowski, Lukasz Kuszner
Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks. CoRR (2014)
Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Bounds on the Cover Time of Parallel Rotor Walks. STACS (2014)
Dariusz Dereniowski, Andrzej Pelc
Leader election for anonymous asynchronous agents in arbitrary networks. Distributed Comput. 27 (1) (2014)
Piotr Borowiecki, Dariusz Dereniowski, Pawel Pralat
Brushing with additional cleaning restrictions. Theor. Comput. Sci. 557 (2014)
Jurek Czyzowicz, Dariusz Dereniowski, Leszek Gasieniec, Ralf Klasing, Adrian Kosowski, Dominik Pajak
Collision-Free Network Exploration. LATIN (2014)
Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols
Optimal edge-coloring with edge rate constraints. Networks 62 (3) (2013)
Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
Minimum length path decompositions CoRR (2013)
Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski
Fast Collaborative Graph Exploration. ICALP (2) (2013)
Dariusz Dereniowski, Danny Dyer
On minimum cost edge searching. Theor. Comput. Sci. 495 (2013)
Dariusz Dereniowski, Öznur Yasar Diner, Danny Dyer
Three-fast-searchable graphs. Discret. Appl. Math. 161 (13-14) (2013)
Dariusz Dereniowski, Danny Dyer, Ryan M. Tifenbach, Boting Yang
Zero-Visibility Cops and Robber Game on a Graph. FAW-AAIM (2013)
Piotr Borowiecki, Dariusz Dereniowski
On-line ranking of split graphs. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Dariusz Dereniowski
Approximate search strategies for weighted trees. Theor. Comput. Sci. 463 (2012)
Dariusz Dereniowski, Andrzej Pelc
Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks CoRR (2012)
Dariusz Dereniowski
From Pathwidth to Connected Pathwidth. SIAM J. Discret. Math. 26 (4) (2012)
Dariusz Dereniowski, Wieslaw Kubiak
Routing equal-size messages on a slotted ring. J. Sched. 15 (4) (2012)
Dariusz Dereniowski, Andrzej Pelc
Drawing maps with advice. J. Parallel Distributed Comput. 72 (2) (2012)
Edward G. Coffman Jr., Dariusz Dereniowski, Wieslaw Kubiak
An efficient algorithm for finding ideal schedules. Acta Informatica 49 (1) (2012)
Dariusz Dereniowski
Connected searching of weighted trees. Theor. Comput. Sci. 412 (41) (2011)
Dariusz Dereniowski
The complexity of node blocking for dags. J. Comb. Theory, Ser. A 118 (1) (2011)
Dariusz Dereniowski
From Pathwidth to Connected Pathwidth. STACS (2011)
Dariusz Dereniowski
From Pathwidth to Connected Pathwidth CoRR (2010)
Dariusz Dereniowski
Connected searching of weighted trees CoRR (2010)
Dariusz Dereniowski, Andrzej Pelc
Drawing Maps with Advice. DISC (2010)
Dariusz Dereniowski
Phutball is PSPACE-hard. Theor. Comput. Sci. 411 (44-46) (2010)
Dariusz Dereniowski, Wieslaw Kubiak
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines. J. Sched. 13 (5) (2010)
Dariusz Dereniowski
Connected Searching of Weighted Trees. MFCS (2010)
Dariusz Dereniowski
Maximum vertex occupation time and inert fugitive: Recontamination does help. Inf. Process. Lett. 109 (9) (2009)
Dariusz Dereniowski
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs. Discuss. Math. Graph Theory 29 (2) (2009)
Dariusz Dereniowski
The Complexity of List Ranking of Trees. Ars Comb. 86 (2008)
Dariusz Dereniowski
Phutball is PSPACE-hard CoRR (2008)
Dariusz Dereniowski, Adam Nadolski
A Note on Compact and Compact Circular Edge-colorings of Graphs. Discret. Math. Theor. Comput. Sci. 10 (3) (2008)
Dariusz Dereniowski
The Complexity of Node Blocking for Dags CoRR (2008)
Dariusz Dereniowski
Edge ranking and searching in partial orders. Discret. Appl. Math. 156 (13) (2008)
Dariusz Dereniowski
Easy and hard instances of arc ranking in directed graphs. Discret. Appl. Math. 155 (18) (2007)

Dariusz Dereniowski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dariusz Dereniowski