{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:20:32Z","timestamp":1777645232976,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.3233\/fi-2015-1192","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T01:33:05Z","timestamp":1575336785000},"page":"517-548","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of Optimal Parallel Cooperative Path-Finding"],"prefix":"10.1177","volume":"137","author":[{"given":"Pavel","family":"Surynek","sequence":"first","affiliation":[{"name":"Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic. pavel.surynek@mff.cuni.cz"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2015-1192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:31:43Z","timestamp":1777444303000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/FI-2015-1192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.3233\/fi-2015-1192","relation":{},"ISSN":["0169-2968"],"issn-type":[{"value":"0169-2968","type":"print"}],"subject":[],"published":{"date-parts":[[2015]]}}}