{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:14:17Z","timestamp":1737695657636,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"},{"type":"electronic","value":"9783540748397"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74839-7_21","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"214-225","source":"Crossref","is-referenced-by-count":0,"title":["Segmenting Strings Homogeneously Via Trees"],"prefix":"10.1007","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Bennett, K.P.: Decision tree construction via linear programming. In: 4th Midwest AI and Cognitive Science Soc. Conf., pp. 97\u2013101 (1992)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"K.P. Bennett","year":"1992","unstructured":"Bennett, K.P., Mangasarian, O.L.: Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software\u00a01, 23\u201334 (1992)","journal-title":"Optimization Methods and Software"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01299449","volume":"2","author":"K.P. Bennett","year":"1993","unstructured":"Bennett, K.P., Mangasarian, O.L.: Bilinear separation of two sets in n-space. Computational Optimization and Applications\u00a02, 207\u2013227 (1993)","journal-title":"Computational Optimization and Applications"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/10556789408805554","volume":"3","author":"K.P. Bennett","year":"1993","unstructured":"Bennett, K.P., Mangasarian, O.L.: Multicategory separation via linear programming. Optimization Methods and Software\u00a03, 27\u201339 (1993)","journal-title":"Optimization Methods and Software"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/11847250_22","volume-title":"Parameterized and Exact Computation","author":"L. Cai","year":"2006","unstructured":"Cai, L., Chan, S.M., Chan, S.O.: Random separation: A new metod for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 239\u2013250. Springer, Heidelberg (2006)"},{"key":"21_CR6","unstructured":"Dor, D.: Selection algorithms, PhD thesis, Tel-Aviv Univ. (1995)"},{"key":"21_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/B:JIIS.0000039534.65423.00","volume":"23","author":"P. Fragkou","year":"2004","unstructured":"Fragkou, P., Petridis, V., Kehagias, A.: A dynamic programming algorithm for linear text segmentation. J. Intell. Inf. Syst.\u00a023, 179\u2013197 (2004)","journal-title":"J. Intell. Inf. Syst."},{"key":"21_CR9","series-title":"Lecture Notes in Artificial Intelligence","first-page":"106","volume-title":"Advances in Data Mining","author":"N. Haiminen","year":"2004","unstructured":"Haiminen, N., Gionis, A.: Unimodal segmentation of sequences. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol.\u00a03275, pp. 106\u2013113. Springer, Heidelberg (2004)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Himberg, J., Korpiaho, K., Mannila, H., Tikanm\u00e4ki, J., Toivonen, H.: Time series segmentation for context recognition in mobile devices. In: 1st IEEE Int. Conf. on Data Mining ICDM 2001, pp. 203\u2013210 (2001)","DOI":"10.1109\/ICDM.2001.989520"},{"key":"21_CR11","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Pearson\/Addison-Wesley (2006)"},{"key":"21_CR12","series-title":"Oxford Lecture Series in Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications. Oxford Univ. Press, Oxford (2006)"}],"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-540-74839-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:16:30Z","timestamp":1737620190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748380","9783540748397"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}