Dennis Komm, Rastislav Královic, Richard Královic, Christian Kudahl. Advice Complexity of the Online Induced Subgraph Problem. In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, editors, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. Volume 58 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{KommKKK16,
title = {Advice Complexity of the Online Induced Subgraph Problem},
author = {Dennis Komm and Rastislav Královic and Richard Královic and Christian Kudahl},
year = {2016},
doi = {10.4230/LIPIcs.MFCS.2016.59},
url = {http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.59},
researchr = {https://researchr.org/publication/KommKKK16},
cites = {0},
citedby = {0},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland},
editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
volume = {58},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-016-3},
}