Consider the following one-player game. Starting with the empty graph on n vertices, in
every step a new edge is drawn uniformly at random and inserted into the current graph …

Consider the following one-player game. Starting with the empty graph on n vertices, in
every step a new edge is drawn uniformly at random and inserted into the current graph …

This is a survey of last year's work on online competitive algorithms. The survey covers only
conference papers, including those from SODA, FOCS, STOC, STACS, COCOON, ISAAC …

Consider the following random process: The vertices of a binomial random graph Gn, p are
revealed one by one, and at each step only the edges induced by the already revealed …

Consider the following one-player game. Starting with the empty graph on $ n $ vertices, in
every step $ r $ new edges are drawn uniformly at random and inserted into the current …

In this article, we compare the offline versions of three Ramsey‐type one‐player games that
have been studied in an online setting in previous work: the online Ramsey game, the …

Consider the following one-player game. The vertices of a random graph on n vertices are
revealed to the player one by one. In each step, also all edges connecting the newly …

The topic of this thesis are Ramsey-type problems in random graphs and hypergraphs.
Ramsey theory has its origins in a famous 1930 paper by Frank P. Ramsey. Loosely …

We study the evolution of random graph processes that are based on the paradigm of the
power of multiple choices. The processes we consider begin with an empty graph on n …

A proper graph coloring is called equitable if the sizes of every two color classes differ by at
most one. We consider the following generalized notion of graph colorings: a vertex coloring …