{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:40Z","timestamp":1725551080605},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003311"},{"type":"electronic","value":"9783540363798"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","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":[[2002]]},"DOI":"10.1007\/3-540-36379-3_30","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T17:12:05Z","timestamp":1269882725000},"page":"345-354","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Forest Wrapping Problem on Outerplanar Graphs"],"prefix":"10.1007","author":[{"given":"Isabella","family":"Lari","sequence":"first","affiliation":[]},{"given":"Federica","family":"Ricca","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Scozzari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"M.X. Goemans, D.P. Williamson, \u201cA General Approximation Technique for Constrained Forest Problems\u201d, SIAM J. of Computing\n                        24, 296\u2013317 (1995).","journal-title":"SIAM J. of Computing"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01908717","volume":"7","author":"P. Hansen","year":"1990","unstructured":"P. Hansen, B. Jaumard, K. Musitu, \u201cWeight Constrained Maximum Split Clustering\u201d, J. of Classification\n                        7, 217\u2013240 (1990).","journal-title":"J. of Classification"},{"key":"30_CR3","unstructured":"P. Hansen, B. Jaumard, B. Simeone and V. Doring, \u201cMaximum Split Clustering Under Connectivity Constraints\u201d, Les Cahiers du GERARD report G-93-06, (1993)."},{"key":"30_CR4","unstructured":"I. Lari, \u201cConnected Maximum Split Clustering of Ladder Graphs\u201d, Proceedings of Gellschaft fur Klassifikation e. V. 24th Annual Conference-Passau 2000."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R.E. Tarjan, and E.L. Lawler \u201cThe recognition of Series Parallel Digraphs\u201d, SIAM J. on Comp.\n                        11, 298\u2013313 (1982).","journal-title":"SIAM J. on Comp."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J.A. Wald","year":"1983","unstructured":"J.A. Wald, C.J. Colbourn, \u201cSteiner Trees, Partial 2-Trees, and Minimum IFI Networks\u201d, Networks\n                        13, 159\u2013167 (1983).","journal-title":"Networks"}],"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\/3-540-36379-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:58:36Z","timestamp":1558263516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36379-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003311","9783540363798"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-36379-3_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}