1. Online coloring of bipartite graphs with and without advice;Bianchi,2012
2. Approximations for λ-colorings of graphs;Bodlaender;Comput. J.,2004
3. On the advice complexity of the knapsack problem;Böckenhauer,2012
4. On the advice complexity of the k-server problem;Böckenhauer,2011
5. On the advice complexity of online problems;Böckenhauer,2009