{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:28Z","timestamp":1759638748166},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,3,21]],"date-time":"2012-03-21T00:00:00Z","timestamp":1332288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00037-012-0038-4","type":"journal-article","created":{"date-parts":[[2012,3,20]],"date-time":"2012-03-20T10:30:08Z","timestamp":1332239408000},"page":"511-513","source":"Crossref","is-referenced-by-count":1,"title":["Length 3 Edge-Disjoint Paths Is NP-Hard"],"prefix":"10.1007","volume":"21","author":[{"given":"Hannah","family":"Alpert","sequence":"first","affiliation":[]},{"given":"Jennifer","family":"Iglesias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,21]]},"reference":[{"key":"38_CR1","unstructured":"Hannah Alpert & Jennifer Iglesias (2012). Length 3 Edge-Disjoint Paths and Partial Orientation. http:\/\/arxiv.org\/abs\/1201.6578v1 ."},{"issue":"3-4","key":"38_CR2","first-page":"131","volume":"12","author":"Bley Andreas","year":"2003","unstructured":"Andreas Bley (2003) On the complexity of vertex-disjoint length-restricted path problems. Comput. Complexity 12(3-4): 131\u2013149 ISSN 1016-3328. doi: 10.1007\/s00037-003-0179-6","journal-title":"Comput. Complexity"},{"issue":"1","key":"38_CR3","first-page":"35","volume":"1","author":"P\u00e1lv\u00f6lgyi D\u00f6m\u00f6t\u00f6r","year":"2009","unstructured":"D\u00f6m\u00f6t\u00f6r P\u00e1lv\u00f6lgyi (2009) Deciding soccer scores and partial orientations of graphs. Acta Univ. Sapientiae Math 1(1): 35\u201342. ISSN 1844-6094.","journal-title":"Acta Univ. Sapientiae Math"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0038-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-012-0038-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-012-0038-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:01:58Z","timestamp":1558537318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-012-0038-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,21]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["38"],"URL":"https:\/\/doi.org\/10.1007\/s00037-012-0038-4","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,21]]}}}