{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:38:39Z","timestamp":1648993119131},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0020-0190(93)90227-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"71-75","source":"Crossref","is-referenced-by-count":0,"title":["Shortest path computations in source-deplanarized graphs"],"prefix":"10.1016","volume":"47","author":[{"given":"Greg N.","family":"Frederickson","sequence":"first","affiliation":[]},{"given":"Susanne E.","family":"Hambrusch","sequence":"additional","affiliation":[]},{"given":"Hung-Yi","family":"Tu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90227-Z_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(93)90227-Z_BIB2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-55121-2_18","article-title":"Dynamic algorithms for shortest paths in planar graphs","volume":"570","author":"Feuerstein","year":"1991"},{"issue":"6","key":"10.1016\/0020-0190(93)90227-Z_BIB3","first-page":"1022","article-title":"Fast algorithms for shortest paths in planar graphs, with applications","volume":"16","author":"Frederickson","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0020-0190(93)90227-Z_BIB4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0020-0190(93)90227-Z_BIB5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0925-7721(92)90002-A","article-title":"A framework for 1-D compaction with forbidden region avoidance","volume":"1","author":"Hambrusch","year":"1992","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"10.1016\/0020-0190(93)90227-Z_BIB6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0196-6774(88)90008-9","article-title":"A mixed-integer linear programming problem which is efficiently solvable","volume":"9","author":"Leiserson","year":"1988","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390227Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390227Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:44Z","timestamp":1555129664000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390227Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002001909390227Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90227-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}