Sepp Hartung, André Nichterlein. NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. In S. Barry Cooper, Anuj Dawar, Benedikt Löwe, editors, How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Volume 7318 of Lecture Notes in Computer Science, pages 283-292, Springer, 2012. [doi]
@inproceedings{HartungN12,
title = {NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs},
author = {Sepp Hartung and André Nichterlein},
year = {2012},
doi = {10.1007/978-3-642-30870-3_29},
url = {http://dx.doi.org/10.1007/978-3-642-30870-3_29},
researchr = {https://researchr.org/publication/HartungN12},
cites = {0},
citedby = {0},
pages = {283-292},
booktitle = {How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings},
editor = {S. Barry Cooper and Anuj Dawar and Benedikt Löwe},
volume = {7318},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-30869-7},
}