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 …

Graph coloring is a fundamental graph problem that is widely applied in a variety of
applications. The aim of graph coloring is to minimize the number of colors used to color the …

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 …

In this work, we give a unifying view of locality in four settings: distributed algorithms,
sequential greedy algorithms, dynamic algorithms, and online algorithms. We introduce a …

We resolve a number of long-standing open problems in online graph coloring. More
specifically, we develop tight lower bounds on the performance of online algorithms for …

Coloring is a notoriously hard problem, and even more so in the online setting, where each
arriving vertex has to be colored immediately and irrevocably. Already on trees, which are …

This paper deals with the problem of finding matchings in bipartite regular graphs in the
online model with randomized adversary. We determine the competitive ratio for 2-regular …

This paper deals with the problem of finding matchings in bipartite regular graphs in the
online model with randomized adversary. We determine the competitive ratio for 2-regular …

We consider the problem of finding a maximum-size matching in a fully online setting, where
the vertices of a bipartite graph are given one after the other in discrete time steps, together …

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 …