Dariusz Dereniowski

From MaRDI portal
(Redirected from Person:248952)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Low-degree spanning trees of 2-edge-connected graphs in linear time
Journal of Combinatorial Optimization
2025-11-26Paper
Energy constrained depth first search
Algorithmica
2024-12-03Paper
A framework for searching in graphs in the presence of errors2024-08-26Paper
Constant-factor approximation algorithm for binary search in trees with monotonic query times2024-08-06Paper
Edge and pair queries-random graphs and complexity
The Electronic Journal of Combinatorics
2023-06-15Paper
The complexity of bicriteria tree-depth
Theoretical Computer Science
2023-02-01Paper
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
Algorithms for Sensor Systems
2022-12-09Paper
The complexity of bicriteria tree-depth
Fundamentals of Computation Theory
2022-05-20Paper
scientific article; zbMATH DE number 7525472 (Why is no real title available?)2022-05-11Paper
An efficient noisy binary search in graphs via Median approximation
(available as arXiv preprint)
2022-03-22Paper
Brief announcement: Energy constrained depth first search
(available as arXiv preprint)
2021-07-28Paper
On the Characteristic Graph of a Discrete Symmetric Channel
IEEE Transactions on Information Theory
2021-07-23Paper
Gossiping by energy-constrained mobile agents in tree networks
Theoretical Computer Science
2021-03-09Paper
Building a nest by an automaton
Algorithmica
2021-02-01Paper
Searching by heterogeneous agents
Journal of Computer and System Sciences
2020-10-23Paper
Approximation strategies for generalized binary search in weighted trees
(available as arXiv preprint)
2020-05-27Paper
Searching by heterogeneous agents
Lecture Notes in Computer Science
2020-02-06Paper
Shared processor scheduling of multiprocessor jobs
European Journal of Operational Research
2020-01-08Paper
On-line search in two-dimensional environment
Theory of Computing Systems
2019-12-19Paper
Finding small-width connected path decompositions in polynomial time
Theoretical Computer Science
2019-10-16Paper
Cops, a fast robber and defensive domination on interval graphs
Theoretical Computer Science
2019-10-16Paper
Shared processor scheduling
Journal of Scheduling
2019-08-08Paper
On tradeoffs between width- and fill-like graph parameters
Theory of Computing Systems
2019-06-27Paper
Clearing directed subgraphs by mobile agents. Variations on covering with paths
Journal of Computer and System Sciences
2019-05-03Paper
Collaborative exploration of trees by energy-constrained mobile robots
Theory of Computing Systems
2018-07-23Paper
On-line search in two-dimensional environment
Approximation and Online Algorithms
2018-06-22Paper
Shared multi-processor scheduling
European Journal of Operational Research
2018-05-29Paper
Normal-form preemption sequences for an open problem in scheduling theory
Journal of Scheduling
2018-02-28Paper
The snow team problem (clearing directed subgraphs by mobile agents)
(available as arXiv preprint)
2017-11-22Paper
Collision-free network exploration
Journal of Computer and System Sciences
2017-05-26Paper
Bounds on the cover time of parallel rotor walks2017-03-03Paper
Distributed Evacuation in Graphs with Multiple Exits
Structural Information and Communication Complexity
2016-12-01Paper
Brushing with additional cleaning restrictions
Theoretical Computer Science
2016-06-27Paper
Optimal edge-coloring with edge rate constraints
Networks
2016-06-10Paper
Bounds on the cover time of parallel rotor walks
Journal of Computer and System Sciences
2016-04-18Paper
Topology recognition and leader election in colored networks
Theoretical Computer Science
2016-02-26Paper
Collaborative Exploration by Energy-Constrained Mobile Robots
Structural Information and Communication Complexity
2016-01-08Paper
Rendezvous of heterogeneous mobile agents in edge-weighted networks
Theoretical Computer Science
2015-12-11Paper
The complexity of zero-visibility cops and robber
Theoretical Computer Science
2015-12-08Paper
The complexity of minimum-length path decompositions
Journal of Computer and System Sciences
2015-08-31Paper
Distributed graph searching with a sense of direction
Distributed Computing
2015-07-22Paper
The searchlight problem for road networks
Theoretical Computer Science
2015-07-13Paper
Fast collaborative graph exploration
Information and Computation
2015-06-09Paper
Zero-visibility cops and robber and the pathwidth of a graph
Journal of Combinatorial Optimization
2015-05-11Paper
Distinguishing views in symmetric networks: a tight lower bound
Theoretical Computer Science
2015-04-29Paper
The complexity of zero-visibility cops and robber
Frontiers in Algorithmics
2014-09-02Paper
Rendezvous of heterogeneous mobile agents in edge-weighted networks
Structural Information and Communication Complexity
2014-08-07Paper
Rendezvous of distance-aware mobile agents in unknown graphs
Structural Information and Communication Complexity
2014-08-07Paper
Leader election for anonymous asynchronous agents in arbitrary networks
Distributed Computing
2014-07-11Paper
Three-fast-searchable graphs
Discrete Applied Mathematics
2014-04-22Paper
Zero-visibility cops and robber game on a graph
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
2014-04-03Paper
Collision-free network exploration
LATIN 2014: Theoretical Informatics
2014-03-31Paper
On-line ranking of split graphs2014-02-14Paper
Routing equal-size messages on a slotted ring
Journal of Scheduling
2014-02-05Paper
On minimum cost edge searching
Theoretical Computer Science
2014-01-10Paper
Fast collaborative graph exploration
Automata, Languages, and Programming
2013-08-07Paper
From pathwidth to connected pathwidth
SIAM Journal on Discrete Mathematics
2013-04-09Paper
Approximate search strategies for weighted trees
Theoretical Computer Science
2013-01-07Paper
Drawing maps with advice
Journal of Parallel and Distributed Computing
2012-07-13Paper
Phutball is PSPACE-hard
Theoretical Computer Science
2012-04-03Paper
An efficient algorithm for finding ideal schedules
Acta Informatica
2012-03-23Paper
From pathwidth to connected pathwidth2012-01-23Paper
From pathwidth to connected pathwidth
(available as arXiv preprint)
2012-01-23Paper
Connected searching of weighted trees
Theoretical Computer Science
2011-10-10Paper
scientific article; zbMATH DE number 5844196 (Why is no real title available?)2011-02-02Paper
The complexity of node blocking for dags
Journal of Combinatorial Theory. Series A
2011-01-07Paper
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
Journal of Scheduling
2010-11-03Paper
Drawing maps with advice
Lecture Notes in Computer Science
2010-09-10Paper
Connected searching of weighted trees
Mathematical Foundations of Computer Science 2010
2010-09-03Paper
Maximum vertex occupation time and inert fugitive: Recontamination does help
Information Processing Letters
2010-08-16Paper
A note on compact and compact circular edge-colorings of graphs2010-07-27Paper
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
Discussiones Mathematicae Graph Theory
2010-05-14Paper
Vertex rankings of chordal graphs and weighted trees
Information Processing Letters
2010-01-18Paper
Edge ranking and searching in partial orders
Discrete Applied Mathematics
2008-11-19Paper
Easy and hard instances of arc ranking in directed graphs
Discrete Applied Mathematics
2007-11-30Paper
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science
2007-09-25Paper
Parallel Processing and Applied Mathematics
Lecture Notes in Computer Science
2007-05-02Paper
Edge ranking of weighted trees
Discrete Applied Mathematics
2006-06-30Paper
scientific article; zbMATH DE number 5033869 (Why is no real title available?)2006-06-19Paper
On multidimensional generalization of binary search
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Dariusz Dereniowski