@InProceedings{bredereck_et_al:LIPIcs.IPEC.2016.10,
author = {Bredereck, Robert and Froese, Vincent and Koseler, Marcel and Millani, Marcelo Garlet and Nichterlein, Andr\'{e} and Niedermeier, Rolf},
title = {{A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.10},
URN = {urn:nbn:de:0030-drops-69353},
doi = {10.4230/LIPIcs.IPEC.2016.10},
annote = {Keywords: NP-hard graph problem, graph realizability, graph modification, arc insertion, fixed-parameter tractability, kernelization}
}