
Noisy searching: simple, fast and correct
This work revisits the multiplicative weights update technique (MWU) whi...
read it

Searching by Heterogeneous Agents
In this work we introduce and study a pursuitevasion game in which the ...
read it

The Complexity of Bicriteria TreeDepth
This work considers the following extension of the treedepth problem: f...
read it

An Efficient Noisy Binary Search in Graphs via Median Approximation
Consider a generalization of the classical binary search problem in line...
read it

Building a Nest by an Automaton
A robot modeled as a deterministic finite automaton has to build a struc...
read it

Shared Processor Scheduling of Multiprocessor Jobs
We study shared processor scheduling of multiprocessor weighted jobs whe...
read it

A Framework for Searching in Graphs in the Presence of Errors
We consider two types of searching models, where the goal is to design a...
read it

On tradeoffs between width and filllike graph parameters
In this work we consider two twocriteria optimization problems: given a...
read it

The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
We study several problems of clearing subgraphs by mobile agents in digr...
read it

Energy Constrained Depth First Search
Depth first search is a natural algorithmic technique for constructing a...
read it
Dariusz Dereniowski
is this you? claim profile