{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:43:10Z","timestamp":1725900190375},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_17","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"176-187","source":"Crossref","is-referenced-by-count":11,"title":["Evaluation of ILP-Based Approaches for Partitioning into Colorful Components"],"prefix":"10.1007","author":[{"given":"Sharon","family":"Bruckner","sequence":"first","affiliation":[]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1142\/S1793830910000449","volume":"2","author":"M.V. Ashley","year":"2010","unstructured":"Ashley, M.V., Berger-Wolf, T.Y., Chaovalitwongse, W., DasGupta, B., Khokhar, A., Sheikh, S.: An implicit cover problem in wild population study. Discrete Mathematics, Algorithms and Applications\u00a02(1), 21\u201331 (2010)","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"issue":"1-3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2007.02.026","volume":"377","author":"A. Avidor","year":"2007","unstructured":"Avidor, A., Langberg, M.: The multi-multiway cut problem. Theoretical Computer Science\u00a0377(1-3), 35\u201342 (2007)","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","unstructured":"Bolikowski, \u0141.: Scale-free topology of the interlanguage links in Wikipedia. Technical Report arXiv:0904.0564v2, arXiv (2009)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-31265-6_5","volume-title":"Combinatorial Pattern Matching","author":"S. Bruckner","year":"2012","unstructured":"Bruckner, S., H\u00fcffner, F., Komusiewicz, C., Niedermeier, R., Thiel, S., Uhlmann, J.: Partitioning into colorful components by minimum edge deletions. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 56\u201369. Springer, Heidelberg (2012)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S. B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. Algorithmica\u00a060(2), 316\u2013334 (2011)","journal-title":"Algorithmica"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, K., Karp, R.M., Moreno-Centeno, E., Vempala, S.: Algorithms for implicit hitting set problems. In: Proc. 22nd SODA, pp. 614\u2013629. SIAM (2011)","DOI":"10.1137\/1.9781611973082.48"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/net.3230210106","volume":"21","author":"S. Chopra","year":"1991","unstructured":"Chopra, S., Rao, M.R.: On the multiway cut polyhedron. Networks\u00a021(1), 51\u201389 (1991)","journal-title":"Networks"},{"issue":"8","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1093\/bioinformatics\/btq082","volume":"26","author":"E. Corel","year":"2010","unstructured":"Corel, E., Pitschi, F., Morgenstern, B.: A min-cut algorithm for the consistency problem in multiple sequence alignment. Bioinformatics\u00a026(8), 1015\u20131021 (2010)","journal-title":"Bioinformatics"},{"issue":"1-3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Mathematical Programming\u00a045(1-3), 59\u201396 (1989)","journal-title":"Mathematical Programming"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"G\u00f6rke, R., Schumm, A., Wagner, D.: Experiments on density-constrained graph clustering. In: Proc. 2012 ALENEX, pp. 1\u201315. SIAM (2012)","DOI":"10.1137\/1.9781611972924.1"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jcss.2010.06.009","volume":"77","author":"R.M. Karp","year":"2011","unstructured":"Karp, R.M.: Heuristic algorithms in computational molecular biology. Journal of Computer and System Sciences\u00a077(1), 122\u2013128 (2011)","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Lee, T., Wang, Z., Wang, H., Hwang, S.: Web scale taxonomy cleansing. In: Proceedings of the VLDB Endowment, vol.\u00a04, pp. 1295\u20131306 (2011)","DOI":"10.14778\/3402755.3402763"},{"key":"17_CR13","unstructured":"de Melo, G., Weikum, G.: Untangling the cross-lingual link structure of Wikipedia. In: Proc. 48th ACL, pp. 844\u2013853. ACM (2010)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"de Melo, G., Weikum, G.: MENTA: inducing multilingual taxonomies from Wikipedia. In: Proc. 19th CIKM, pp. 1099\u20131108. ACM (2010)","DOI":"10.1145\/1871437.1871577"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Moreno-Centeno, E., Karp, R.M.: The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment. Operations Research (to appear, 2013)","DOI":"10.1287\/opre.1120.1139"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.10004","volume":"38","author":"M. Oosten","year":"2001","unstructured":"Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: The clique partitioning problem: Facets and patching facets. Networks\u00a038(4), 209\u2013226 (2001)","journal-title":"Networks"},{"key":"17_CR17","first-page":"175","volume":"4","author":"S. R\u00e9gnier","year":"1965","unstructured":"R\u00e9gnier, S.: Sur quelques aspects math\u00e9matiques des probl\u00e8mes de classification automatique. I.C.C. Bulletin\u00a04, 175\u2013191 (1965)","journal-title":"I.C.C. Bulletin"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T13:08:41Z","timestamp":1595768921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}