{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T11:48:31Z","timestamp":1751456911996,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_16","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"216-229","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem"],"prefix":"10.1007","author":[{"given":"\u00c9tienne","family":"Birmel\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"de Montgolfier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e9o","family":"Planche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1137\/S0097539796303421","volume":"28","author":"D Aingworth","year":"1999","unstructured":"Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167\u20131181 (1999). http:\/\/dx.doi.org\/10.1137\/S0097539796303421","journal-title":"SIAM J. Comput."},{"issue":"7\u20138","key":"16_CR2","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1016\/j.disc.2005.11.035","volume":"307","author":"G Bacs\u00f3","year":"2007","unstructured":"Bacs\u00f3, G., Tuza, Z., Voigt, M.: Characterization of graphs dominated by induced paths. Discret. Math. 307(7\u20138), 822\u2013826 (2007). http:\/\/dx.doi.org\/10.1016\/j.disc.2005.11.035","journal-title":"Discret. Math."},{"issue":"4","key":"16_CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.10098","volume":"42","author":"DG Corneil","year":"2003","unstructured":"Corneil, D.G., Dragan, F.F., K\u00f6hler, E.: On the power of BFS to determine a graph\u2019s diameter. Networks 42(4), 209\u2013222 (2003). http:\/\/dx.doi.org\/10.1002\/net.10098","journal-title":"Networks"},{"issue":"5","key":"16_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0020-0190(95)00021-4","volume":"54","author":"DG Corneil","year":"1995","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: A linear time algorithm to compute a dominating path in an at-free graph. Inf. Process. Lett. 54(5), 253\u2013257 (1995). http:\/\/dx.doi.org\/10.1016\/0020-0190(95)00021-4","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"16_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"DG Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discret. Math. 10(3), 399\u2013430 (1997). http:\/\/dx.doi.org\/10.1137\/S0895480193250125","journal-title":"SIAM J. Discret. Math."},{"issue":"4","key":"16_CR6","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1137\/S0097539795282377","volume":"28","author":"DG Corneil","year":"1999","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput. 28(4), 1284\u20131297 (1999). http:\/\/dx.doi.org\/10.1137\/S0097539795282377","journal-title":"SIAM J. Comput."},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/3-540-60618-1_87","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"JS Deogun","year":"1995","unstructured":"Deogun, J.S., Kratsch, D.: Diametral path graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 344\u2013357. Springer, Heidelberg (1995). doi: 10.1007\/3-540-60618-1_87"},{"issue":"3","key":"16_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1137\/S0895480100367111","volume":"15","author":"JS Deogun","year":"2002","unstructured":"Deogun, J.S., Kratsch, D.: Dominating pair graphs. SIAM J. Discret. Math. 15(3), 353\u2013366 (2002). http:\/\/dx.doi.org\/10.1137\/S0895480100367111","journal-title":"SIAM J. Discret. Math."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-319-21840-3_23","volume-title":"Algorithms and Data Structures","author":"FF Dragan","year":"2015","unstructured":"Dragan, F.F., Leitert, A.: On the minimum eccentricity shortest path problem. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 276\u2013288. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21840-3_23"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"C Lekkerkerker","year":"1962","unstructured":"Lekkerkerker, C., Boland, J.: Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51, 45\u201364 (1962)","journal-title":"Fund. Math."},{"issue":"1","key":"16_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Comb. Theory Ser. B 35(1), 39\u201361 (1983). http:\/\/dx.doi.org\/10.1016\/0095-8956(83)90079-5","journal-title":"J. Comb. Theory Ser. B"},{"key":"16_CR12","unstructured":"V\u00f6lkel, F., Bapteste, E., Habib, M., Lopez, P., Vigliotti, C.: Read networks and k-laminar graphs. CoRR abs\/1603.01179 (2016). arXiv:1603.01179"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/3-540-62592-5_79","volume-title":"Algorithms and Complexity","author":"K Yamazaki","year":"1997","unstructured":"Yamazaki, K., Bodlaender, H.L., Fluiter, B., Thilikos, D.M.: Isomorphism for graphs of bounded distance width. In: Bongiovanni, G., Bovet, D.P., Battista, G. (eds.) CIAC 1997. LNCS, vol. 1203, pp. 276\u2013287. Springer, Heidelberg (1997). doi: 10.1007\/3-540-62592-5_79"},{"issue":"1","key":"16_CR14","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TPAMI.2007.250598","volume":"29","author":"S Yan","year":"2007","unstructured":"Yan, S., Xu, D., Zhang, B., Zhang, H., Yang, Q., Lin, S.: Graph embedding and extensions: a general framework for dimensionality reduction. IEEE Trans. Pattern Anal. Mach. Intell. 29(1), 40\u201351 (2007). http:\/\/dx.doi.org\/10.1109\/TPAMI.2007.250598","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48749-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T00:40:39Z","timestamp":1568508039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}