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]
Abstract is missing.