Dariusz Dereniowski

According to our database1, Dariusz Dereniowski
  • authored at least 68 papers between 2003 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Collision-free network exploration.
J. Comput. Syst. Sci., 2017

Shared multi-processor scheduling.
European Journal of Operational Research, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.
CoRR, 2017

Shared processor scheduling.
CoRR, 2017

Approximation Strategies for Generalized Binary Search in Weighted Trees.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents).
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Topology recognition and leader election in colored networks.
Theor. Comput. Sci., 2016

Normal-form preemption sequences for an open problem in scheduling theory.
J. Scheduling, 2016

Bounds on the cover time of parallel rotor walks.
J. Comput. Syst. Sci., 2016

Distributed Searching of Partial Grids.
CoRR, 2016

Topology Recognition and Leader Election in Colored Networks.
CoRR, 2016

Shared multi-processor scheduling.
CoRR, 2016

Distributed Evacuation in Graphs with Multiple Exits.
Proceedings of the Structural Information and Communication Complexity, 2016

2015
The searchlight problem for road networks.
Theor. Comput. Sci., 2015

Distinguishing views in symmetric networks: A tight lower bound.
Theor. Comput. Sci., 2015

Rendezvous of heterogeneous mobile agents in edge-weighted networks.
Theor. Comput. Sci., 2015

The complexity of zero-visibility cops and robber.
Theor. Comput. Sci., 2015

The complexity of minimum-length path decompositions.
J. Comput. Syst. Sci., 2015

Zero-visibility cops and robber and the pathwidth of a graph.
J. Comb. Optim., 2015

Fast collaborative graph exploration.
Inf. Comput., 2015

Distributed graph searching with a sense of direction.
Distributed Computing, 2015

Structural Properties of an Open Problem in Preemptive Scheduling.
CoRR, 2015

Collaborative Exploration by Energy-Constrained Mobile Robots.
Proceedings of the Structural Information and Communication Complexity, 2015

2014
Brushing with additional cleaning restrictions.
Theor. Comput. Sci., 2014

Leader election for anonymous asynchronous agents in arbitrary networks.
Distributed Computing, 2014

Distinguishing Views in Symmetric Networks: A Tight Lower Bound.
CoRR, 2014

Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks.
CoRR, 2014

Rendezvous of Distance-aware Mobile Agents in Unknown Graphs.
CoRR, 2014

Bounds on the Cover Time of Parallel Rotor Walks.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks.
Proceedings of the Structural Information and Communication Complexity, 2014

Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs.
Proceedings of the Structural Information and Communication Complexity, 2014

Collision-Free Network Exploration.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

The Complexity of Zero-Visibility Cops and Robber.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013
On minimum cost edge searching.
Theor. Comput. Sci., 2013

Optimal edge-coloring with edge rate constraints.
Networks, 2013

On-line ranking of split graphs.
Discrete Mathematics & Theoretical Computer Science, 2013

Three-fast-searchable graphs.
Discrete Applied Mathematics, 2013

Minimum length path decompositions
CoRR, 2013

Fast Collaborative Graph Exploration.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Zero-Visibility Cops and Robber Game on a Graph.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
Approximate search strategies for weighted trees.
Theor. Comput. Sci., 2012

From Pathwidth to Connected Pathwidth.
SIAM J. Discrete Math., 2012

Routing equal-size messages on a slotted ring.
J. Scheduling, 2012

Drawing maps with advice.
J. Parallel Distrib. Comput., 2012

Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks
CoRR, 2012

An efficient algorithm for finding ideal schedules.
Acta Inf., 2012

2011
Connected searching of weighted trees.
Theor. Comput. Sci., 2011

The complexity of node blocking for dags.
J. Comb. Theory, Ser. A, 2011

From Pathwidth to Connected Pathwidth.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010
Phutball is PSPACE-hard.
Theor. Comput. Sci., 2010

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines.
J. Scheduling, 2010

From Pathwidth to Connected Pathwidth
CoRR, 2010

Connected searching of weighted trees
CoRR, 2010

Drawing Maps with Advice.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Connected Searching of Weighted Trees.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
Maximum vertex occupation time and inert fugitive: Recontamination does help.
Inf. Process. Lett., 2009

Minimum vertex ranking spanning tree problem for chordal and proper interval graphs.
Discussiones Mathematicae Graph Theory, 2009

2008
A Note on Compact and Compact Circular Edge-colorings of Graphs.
Discrete Mathematics & Theoretical Computer Science, 2008

Edge ranking and searching in partial orders.
Discrete Applied Mathematics, 2008

Phutball is PSPACE-hard
CoRR, 2008

The Complexity of Node Blocking for Dags
CoRR, 2008

The Complexity of List Ranking of Trees.
Ars Comb., 2008

2007
Easy and hard instances of arc ranking in directed graphs.
Discrete Applied Mathematics, 2007

2006
Vertex rankings of chordal graphs and weighted trees.
Inf. Process. Lett., 2006

Efficient Parallel Query Processing by Graph Ranking.
Fundam. Inform., 2006

Edge ranking of weighted trees.
Discrete Applied Mathematics, 2006

2005
Parallel Query Processing and Edge Ranking of Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2005

2003
Cholesky Factorization of Matrices in Parallel and Ranking of Graphs.
Proceedings of the Parallel Processing and Applied Mathematics, 2003


  Loading...