We study the online problem of evacuating k robots on m concurrent rays to a single
unknown exit. All k robots start on the same point s, not necessarily on the junction j of the m …

We study the classic problem in which a Searcher must locate a hidden point, also called the
Hider in a network, starting from a root point. The network may be either bounded or …

We study the general setting of weighted search in which a number of weighted targets are
hidden in a star-like environment, and a mobile searcher must locate a subset of targets with …

In search problems, a mobile searcher seeks to locate a target that hides in some unknown
position of the environment. Such problems are typically considered to be of an on-line …

We introduce and study the general setting of weighted search in which a number of targets,
each with a certain weight, are hidden in a star-like environment that consists of $ m …

This Habilitation thesis explores aspects of computation in a status of uncertainty. First, we
study online problems, in which the input is not known in advance, and the algorithm must …