{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:32Z","timestamp":1759638992279},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_6","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T01:44:33Z","timestamp":1338169473000},"page":"51-62","source":"Crossref","is-referenced-by-count":2,"title":["How to Attack the NP-Complete Dag Realization Problem in Practice"],"prefix":"10.1007","author":[{"given":"Annabell","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Nichterlein, A.: Realizing degree sequences for directed acyclic graphs is hard. CoRR abs\/1110.1510v1 (2011)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-22953-4_23","volume-title":"Fundamentals of Computation Theory","author":"A. Berger","year":"2011","unstructured":"Berger, A., M\u00fcller-Hannemann, M.: Dag Realizations of Directed Degree Sequences. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 264\u2013275. Springer, Heidelberg (2011); full version available as Technical Report 2011\/5, Martin-Luther-Universit\u00e4t Halle-Wittenberg, Department of Computer Science"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0012-365X(73)90037-X","volume":"6","author":"D.J. Kleitman","year":"1973","unstructured":"Kleitman, D.J., Wang, D.L.: Algorithms for constructing graphs and digraphs with given valences and factors. Discrete Mathematics\u00a06, 79\u201388 (1973)","journal-title":"Discrete Mathematics"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W. Tutte","year":"1952","unstructured":"Tutte, W.: The factors of graphs. Canadian J. of Mathematics\u00a04, 314\u2013328 (1952)","journal-title":"Canadian J. of Mathematics"},{"key":"6_CR5","unstructured":"Berger, A.: Directed degree sequences. PhD thesis, Department of Computer Science, Martin-Luther-Universit\u00e4t Halle-Wittenberg, urn:nbn:de:gbv:3:4-6768 (2011)"},{"key":"6_CR6","unstructured":"Batagelj, V.: Pajek datasets: Food webs (2004), \n                    \n                      http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/bio\/foodweb\/foodweb.htm"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/364520.364540","volume":"7","author":"R. Durstenfeld","year":"1964","unstructured":"Durstenfeld, R.: Algorithm 235: Random permutation. Commun. ACM\u00a07, 420 (1964)","journal-title":"Commun. ACM"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08, 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM\u00a051, 671\u2013697 (2004)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:03:32Z","timestamp":1558314212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}