{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:05Z","timestamp":1725664685579},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:57:13Z","timestamp":1330279033000},"page":"191-200","source":"Crossref","is-referenced-by-count":2,"title":["Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs"],"prefix":"10.1007","author":[{"given":"Hristo N.","family":"Djidjev","sequence":"first","affiliation":[]},{"given":"Grammati E.","family":"Pantziou","sequence":"additional","affiliation":[]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"H. Bondlaender, \u201cDynamic Algorithms for Graphs with Treewidth 2\u201d, Proc. 19th WG'93, LNCS 790, pp.112\u2013124, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57899-4_45"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri and C. Zaroliagis, \u201cShortest Path Queries in Digraphs of Small Treewidth\u201d, Proc. 22nd ICALP, LNCS, Springer-Verlag, 1995, to appear.","DOI":"10.1007\/3-540-60084-1_78"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"H. Djidjev, G. Pantziou and C. Zaroliagis, \u201cOn-line and Dynamic Algorithms for Shortest Path Problems\u201d, Proc. 12th STACS, LNCS 900, pp.193\u2013204, Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_73"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0304-3975(93)90328-Q","volume":"116","author":"E. Feuerstein","year":"1993","unstructured":"E. Feuerstein and A.M. Spaccamela, \u201cDynamic Algorithms for Shortest Paths in Planar Graphs\u201d, Theor. Computer Science, 116 (1993), pp.359\u2013371.","journal-title":"Theor. Computer Science"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, \u201cUsing Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems\u201d, Proc. 30th Annual IEEE Symp. on FOCS, 1989.","DOI":"10.1109\/SFCS.1989.63517"},{"issue":"No.1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"G.N. Frederickson","year":"1991","unstructured":"G.N. Frederickson, \u201cPlanar Graph Decomposition and All Pairs Shortest Paths\u201d, J. ACM, Vol.38, No.1, January 1991, pp.162\u2013204.","journal-title":"J. ACM"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(81)90120-4","volume":"13","author":"R. Hassin","year":"1981","unstructured":"R. Hassin, \u201cMaximum flow in (s,t)-planar networks\u201d, Inform. Proc. Lett., 13(1981), p.107.","journal-title":"Inform. Proc. Lett."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"G. Miller and J. Naor, \u201cFlows in planar graphs with multiple sources and sinks\u201d, Proc. 30th IEEE Symp. on FOCS, 1989, pp.112\u2013117.","DOI":"10.1109\/SFCS.1989.63464"},{"issue":"6","key":"14_CR9","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin, \u201cOn Finding Lowest Common Ancestors: Simplification and Parallelization\u201d, SIAM J. Computing, 17(6), pp.1253\u20131262, 1988.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:41Z","timestamp":1605646601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}