{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:16:35Z","timestamp":1725570995888},"publisher-location":"Berlin, Heidelberg","reference-count":0,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153273"},{"type":"electronic","value":"9783642153280"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-15328-0_5","type":"book-chapter","created":{"date-parts":[[2010,12,9]],"date-time":"2010-12-09T16:20:35Z","timestamp":1291911635000},"page":"39-45","source":"Crossref","is-referenced-by-count":0,"title":["Topological Sorting - How Should I Begin to Complete My To Do List?"],"prefix":"10.1007","author":[{"given":"Hagen","family":"H\u00f6pfner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","container-title":["Algorithms Unplugged"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15328-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:50:46Z","timestamp":1619787046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15328-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642153273","9783642153280"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15328-0_5","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}