1. Computing the domination number of grid graphs;Alanko;Electron. J. Comb.,2011
2. On the power of advice and randomization for the disjoint path allocation problem;Barhum,2014
3. Call admission problems on trees with advice;Böckenhauer,2019
4. Online coloring of bipartite graphs with and without advice;Bianchi,2012
5. The string guessing problem as a method to prove lower bounds on the advice complexity;Böckenhauer,2013