Cops and Robbers is a well-studied pursuit-evasion game in which a set o...
The online knapsack problem is a classic problem in the field of online
...
In online interval scheduling, the input is an online sequence of interv...
We study the nascent setting of online computation with imperfect advice...
In the online (time-series) search problem, a player is presented with a...
Several well-studied online resource allocation problems can be formulat...
We study the fault-tolerant variant of the online bin packing problem.
S...
Bin packing is a classic optimization problem with a wide range of
appli...
Contract scheduling is a general technique that allows to design a syste...
Every processor with multiple cores sharing a cache needs to implement a...
In the bounded delay buffer management problem unit size packets arrive
...
Graph burning is a simple model for the spread of social influence in
ne...
The advice model of online computation captures the setting in which the...
The bin covering problem asks for covering a maximum number of bins with...
Numerous approaches study the vulnerability of networks against social
c...