{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:17Z","timestamp":1725525317807},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_23","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"262-273","source":"Crossref","is-referenced-by-count":1,"title":["Core and Conditional Core Path of Specified Length in Special Classes of Graphs"],"prefix":"10.1007","author":[{"given":"S.","family":"Balasubramanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Harini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-63307-3_47","volume-title":"Algorithms and Data Structures","author":"S. Alstrup","year":"1997","unstructured":"Alstrup, S., Lauridsen, P.W., Sommerlund, P., Thorup, M.: Finding cores of limited length. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol.\u00a01272, pp. 45\u201354. Springer, Heidelberg (1997)"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-006-0162-0","volume":"150","author":"R. Becker","year":"2007","unstructured":"Becker, R., Lari, I., Scozzari, A., Storchi, G.: The location of median paths on grid graphs. Annals of Operations Research\u00a0150(1), 65\u201378 (2007)","journal-title":"Annals of Operations Research"},{"issue":"1-2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0166-218X(01)00254-2","volume":"118","author":"R.I. Becker","year":"2002","unstructured":"Becker, R.I., Chang, Y.I., Lari, I., Scozzari, A., Storchi, G.: Finding the l-core of a tree. Discrete Appl. Math.\u00a0118(1-2), 25\u201342 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"23_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(95)00084-P","volume":"55","author":"L. Chen","year":"1995","unstructured":"Chen, L.: Solving the shortest-paths problem on bipartite permutation graphs efficiently. Inf. Process. Lett.\u00a055(5), 259\u2013264 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"23_CR5","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/net.3230230605","volume":"23","author":"S.L. Hakimi","year":"1993","unstructured":"Hakimi, S.L., Schmeichel, E.F., Labb\u2019e, M.: On locating path- or tree-shaped facilities on networks. networks\u00a023(6), 543\u2013555 (1993)","journal-title":"networks"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"A. Brandstadt","year":"1987","unstructured":"Brandstadt, A., Spinrad, J., Stewart, L.: Bipartite Permutation Graphs. Discrete Applied Mathematics\u00a018, 279\u2013292 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/net.3230150304","volume":"15","author":"E. Minieka","year":"1985","unstructured":"Minieka, E.: The optimal location of a path or a tree in a tree network. Networks\u00a015, 309\u2013321 (1985)","journal-title":"Networks"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","volume":"4","author":"E. Minieka","year":"1983","unstructured":"Minieka, E., Patel, N.H.: On finding the core of a tree with a specified length. J. Algorithms\u00a04(4), 345\u2013352 (1983)","journal-title":"J. Algorithms"},{"issue":"3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"C.A. Morgan","year":"1980","unstructured":"Morgan, C.A., Slater, P.J.: A linear algorithm for a core of a tree. J. Algorithms\u00a01(3), 247\u2013258 (1980)","journal-title":"J. Algorithms"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1006\/jagm.1996.0022","volume":"20","author":"S. Peng","year":"1996","unstructured":"Peng, S., Lo, W.-T.: Efficient algorithms for finding a core of a tree with a specified length. J. Algorithms\u00a020(3), 445\u2013458 (1996)","journal-title":"J. Algorithms"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jalgor.2005.01.005","volume":"56","author":"A. Tamir","year":"2005","unstructured":"Tamir, A., Puerto, J., Mesa, J.A., Rodr\u00edguez-Ch\u00eda, A.M.: Conditional location of path and tree shaped facilities on trees. J. Algorithms\u00a056(1), 50\u201375 (2005)","journal-title":"J. Algorithms"},{"issue":"5","key":"23_CR12","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1142\/S0129054107005054","volume":"18","author":"R. Uehara","year":"2007","unstructured":"Uehara, R., Uno, Y.: On computing longest paths in small graph classes. Int. J. Found. Comput. Sci.\u00a018(5), 911\u2013930 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/3-540-45655-4_53","volume-title":"Computing and Combinatorics","author":"B.-F. Wang","year":"2002","unstructured":"Wang, B.-F., Ku, S.-C., Hsieh, Y.-H.: The conditional location of a median path. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 494\u2013503. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T07:41:48Z","timestamp":1551771708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}