pdf-format: |
|
@InProceedings{bredereck_et_al:LIPIcs:2017:6935, author = {Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and Andr{\'e} Nichterlein and Rolf Niedermeier}, 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 = {Jiong Guo and Danny Hermelin}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6935}, 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} }
Keywords: | NP-hard graph problem, graph realizability, graph modification, arc insertion, fixed-parameter tractability, kernelization | |
Seminar: | 11th International Symposium on Parameterized and Exact Computation (IPEC 2016) | |
Issue date: | 2017 | |
Date of publication: | 09.02.2017 |