{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T08:37:27Z","timestamp":1715589447154},"publisher-location":"Philadelphia, PA","reference-count":0,"publisher":"Society for Industrial and Applied Mathematics","isbn-type":[{"value":"9781611977066","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1137\/1.9781611977066.1","type":"book-chapter","created":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T19:00:02Z","timestamp":1641322802000},"page":"1-11","source":"Crossref","is-referenced-by-count":1,"title":["A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs"],"prefix":"10.1137","author":[{"given":"Debarati","family":"Das","sequence":"first","affiliation":[]},{"given":"Evangelos","family":"Kipouridis","sequence":"additional","affiliation":[]},{"given":"Maximilian Probst","family":"Gutenberg","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Wulff-Nilsen","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2022,1,4]]},"container-title":["Symposium on Simplicity in Algorithms (SOSA)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/1.9781611977066.1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T19:54:56Z","timestamp":1646250896000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/1.9781611977066.1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"ISBN":["9781611977066"],"references-count":0,"alternative-id":["10.1137\/1.9781611977066.1","10.1137\/1.9781611977066"],"URL":"https:\/\/doi.org\/10.1137\/1.9781611977066.1","relation":{},"subject":[],"published":{"date-parts":[[2022,1]]}}}