In online scenarios requests arrive over time, and each request must be serviced in an
irrevocable manner before the next request arrives. Online algorithms with advice is an area …

Exploring unknown environments is a fundamental task in many domains, eg, robot
navigation, network security, and internet search. We initiate the study of a learning …

Web crawlers visit internet applications, collect data, and learn about new web pages from
visited pages. Web crawlers have a long and interesting history. Early web crawlers …

Online algorithms with advice is an area of research where one attempts to measure how
much knowledge of the future is necessary to achieve a given competitive ratio. The lower …

We introduce the study of search problems, in a setting in which the searcher has some
information, or hint concerning the hiding target. In particular, we focus on one of the …

We consider the online bin packing problem under the advice complexity model where the
“online constraint” is relaxed and an algorithm receives partial information about the future …

This paper deals with online graph exploration problems by multiple searchers. The
information on the graph is given online. As the exploration proceeds, searchers gain more …

We study the online graph exploration problem proposed by Kalyanasundaram and Pruhs
(1994) and prove a constant competitive ratio on minor-free graphs. This result …

The node searching problem (aka treasure hunt) is a fundamental task performed by mobile
agents in a network and can be viewed as an online version of the shortest path problem: an …

We consider the problem of graph searching with prediction recently introduced by Banerjee
et al.(2023). In this problem, an agent starting at some vertex r has to traverse a (potentially …