{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:40:01Z","timestamp":1743068401540,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_10","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T10:50:06Z","timestamp":1470307806000},"page":"122-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Farthest-Point Queries in Two-terminal\u00a0Series-parallel Networks"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Grimm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.tcs.2007.02.033","volume":"378","author":"B Ben-Moshe","year":"2007","unstructured":"Ben-Moshe, B., Bhattacharya, B., Shi, Q., Tamir, A.: Efficient algorithms for center problems in cactus networks. Theoret. Comput. Sci. 378(3), 237\u2013252 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"MW Bern","year":"1987","unstructured":"Bern, M.W., Lawler, E.L., Wong, A.L.: Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms 8(2), 216\u2013235 (1987)","journal-title":"J. Algorithms"},{"issue":"1","key":"10_CR4","first-page":"182","volume":"4","author":"P Bose","year":"2013","unstructured":"Bose, P., Dannies, K., De Carufel, J.L., Doell, C., Grimm, C., Maheshwari, A., Schirra, S., Smid, M.: Network farthest-point diagrams. J. Comput. Geom. 4(1), 182\u2013211 (2013)","journal-title":"J. Comput. Geom."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.7155\/jgaa.00345","volume":"19","author":"P Bose","year":"2015","unstructured":"Bose, P., De Carufel, J.L., Grimm, C., Maheshwari, A., Smid, M.: Optimal data structures for farthest-point queries in cactus networks. J. Graph Algorithms Appl. 19(1), 11\u201341 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"10_CR6","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1999)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional cascading: I. A data structuring technique. Algorithmica 1(2), 133\u2013162 (1986)","journal-title":"Algorithmica"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10(2), 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1002\/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L","volume":"36","author":"M Erwig","year":"2000","unstructured":"Erwig, M.: The graph Voronoi diagram with applications. Networks 36(3), 156\u2013163 (2000)","journal-title":"Networks"},{"key":"10_CR10","unstructured":"Grimm, C.: Efficient farthest-point queries in two-terminal series-parallel networks. CoRR abs\/1503.01706 (2015). \n                      http:\/\/arxiv.org\/abs\/1503.01706"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1145\/828.322439","volume":"31","author":"Y Gurevich","year":"1984","unstructured":"Gurevich, Y., Stockmeyer, L.J., Vishkin, U.: Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. J. ACM 31(3), 459\u2013473 (1984)","journal-title":"J. ACM"},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1287\/ijoc.4.4.412","volume":"4","author":"SL Hakimi","year":"1992","unstructured":"Hakimi, S.L., Labb\u00e9, M., Schmeichel, E.: The Voronoi partition of a network and its implications in location theory. ORSA J. Comput. 4(4), 412\u2013417 (1992)","journal-title":"ORSA J. Comput."},{"issue":"2\u20133","key":"10_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(91)90043-V","volume":"30","author":"P Hansen","year":"1991","unstructured":"Hansen, P., Labb\u00e9, M., Nicolas, B.: The continuous center set of a network. Discrete Appl. Math. 30(2\u20133), 181\u2013195 (1991)","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"10_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0166-218X(94)90022-1","volume":"54","author":"NM Korneyenko","year":"1994","unstructured":"Korneyenko, N.M.: Combinatorial algorithms on a class of graphs. Discrete Appl. Math. 54(2\u20133), 215\u2013217 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"9","key":"10_CR15","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1080\/13658810701587891","volume":"22","author":"A Okabe","year":"2008","unstructured":"Okabe, A., Satoh, T., Furuta, T., Suzuki, A., Okano, K.: Generalized network Voronoi diagrams: concepts, computational methods, and applications. Int. J. Geogr. Inf. Sci. 22(9), 965\u2013994 (2008)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3), 623\u2013641 (1982)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:50:50Z","timestamp":1558313450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}