Deciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete. - Christian Kudahl (CIAC, 2015)

Adding Isolated Vertices Makes Some Online Algorithms Optimal. - Joan Boyar; Christian Kudahl (IWOCA, 2015)

Advice Complexity for a Class of Online Problems. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Jesper W. Mikkelsen (STACS, 2015)

Advice Complexity of the Online Search Problem. - Jhoirene B. Clemente; Juraj Hromkovic; Dennis Komm; Christian Kudahl (IWOCA, 2016)

Advice Complexity of the Online Induced Subgraph Problem. - Dennis Komm; Rastislav Královic; Richard Královic; Christian Kudahl (MFCS, 2016)

Online Algorithms with Advice: A Survey. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Kim S. Larsen; Jesper W. Mikkelsen (SIGACT News, 2016)

The Advice Complexity of a Class of Hard Online Problems. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Jesper W. Mikkelsen (Theory Comput. Syst., 2017)

Adding isolated vertices makes some greedy online algorithms optimal. - Joan Boyar; Christian Kudahl (Discret. Appl. Math., 2018)

Weighted Online Problems with Advice. - Joan Boyar; Lene M. Favrholdt; Christian Kudahl; Jesper W. Mikkelsen (Theory Comput. Syst., 2018)