{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:16:03Z","timestamp":1743124563864,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"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-662-53536-3_2","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"13-24","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Association via Dissociation"],"prefix":"10.1007","author":[{"given":"Jie","family":"You","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yixin","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), (Article 23) 1\u201327 (2008). doi:\n10.1145\/1411509.1411513\n\n. A preliminary version appeared in STOC 2005","DOI":"10.1145\/1411509.1411513"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1), 89\u2013113 (2004). doi:\n10.1023\/B:MACH.0000033116.57574.95\n\n. A preliminary version appeared in FOCS 2002","journal-title":"Mach. Learn."},{"issue":"3\/4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol. 6(3\/4), 281\u2013297 (1999). doi:\n10.1089\/106652799318274","journal-title":"J. Comput. Biol."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00224-015-9631-7","volume":"58","author":"A Boral","year":"2016","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion. Theory Comput. Syst. 58(2), 357\u2013376 (2016). doi:\n10.1007\/s00224-015-9631-7","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1007\/s00453-015-0011-0","volume":"74","author":"H Bruhn","year":"2016","unstructured":"Bruhn, H., Chopin, M., Joos, F., Schaudt, O.: Structural parameterizations for boxicity. Algorithmica 74(4), 1453\u20131472 (2016). doi:\n10.1007\/s00453-015-0011-0\n\n. A preliminary version appeared in WG 2014","journal-title":"Algorithmica"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996). doi:\n10.1016\/0020-0190(96)00050-6","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/s00453-011-9595-1","volume":"64","author":"Y Cao","year":"2012","unstructured":"Cao, Y., Chen, J.: Cluster editing: kernelization based on edge cuts. Algorithmica 64(1), 152\u2013169 (2012). doi:\n10.1007\/s00453-011-9595-1","journal-title":"Algorithmica"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005). doi:\n10.1016\/j.jcss.2004.10.012\n\n. A preliminary version appeared in FOCS 2003","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00224-013-9499-3","volume":"55","author":"M Chopin","year":"2014","unstructured":"Chopin, M., Nichterlein, A., Niedermeier, R., Weller, M.: Constant thresholds can make target set selection tractable. Theory Comput. Syst. 55(1), 61\u201383 (2014). doi:\n10.1007\/s00224-013-9499-3","journal-title":"Theory Comput. Syst."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-642-32589-2_32","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Doucha","year":"2012","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-33461-5_20","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Fiorini","year":"2016","unstructured":"Fiorini, S., Joret, G., Schaudt, O.: Improved approximation algorithms for hitting 3-vertex paths. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 238\u2013249. Springer, Heidelberg (2016). doi:\n10.1007\/978-3-319-33461-5_20"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Mathematica Academiae Scientiarum Hungaricae 18, 25\u201366 (1967). (Trans: Maffray, F., Preissmann, M.: Perfect Graphs. In: Ram\u00edrez-Alfons\u00edn, J.L., Reed, B.A. (eds.), pp. 25\u201366. Wiley (2001). doi:\n10.1007\/BF02020961","DOI":"10.1007\/BF02020961"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib, M., Paul, C.: A survey of the algorithmic aspects of modular decomposition. Comput. Sci. Rev. 4(1), 41\u201359 (2010). doi:\n10.1016\/j.cosrev.2010.01.001","journal-title":"Comput. Sci. Rev."},{"issue":"1\u20132","key":"2_CR14","first-page":"87","volume":"14","author":"P Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord. J. Comput. 14(1\u20132), 87\u2013108 (2007)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196\u2013217 (2010). doi:\n10.1007\/s00224-008-9150-x","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980). doi:\n10.1016\/0022-0000(80)90060-4\n\n. Preliminary versions independently presented in STOC 1978","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2015.01.049","volume":"573","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Wang, J., You, J., Chen, J., Cao, Y.: Edge deletion problems: branching facilitated by modular decomposition. Theoret. Comput. Sci. 573, 63\u201370 (2015). doi:\n10.1016\/j.tcs.2015.01.049","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-56939-1_60","volume-title":"Automata, Languages, Programming (ICALP)","author":"C Lund","year":"1993","unstructured":"Lund, C., Yannakakis, M.: The approximation of maximum subgraph problems. In: Lingas, A., Karlsson, R.G., Carlsson, S. (eds.) Automata, Languages, Programming (ICALP). LNCS, vol. 700, pp. 40\u201351. Springer, Heidelberg (1993). doi:\n10.1007\/3-540-56939-1_60"},{"issue":"1\u20133","key":"2_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"RM McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition, transitive orientation. Discrete Math. 201(1\u20133), 189\u2013241 (1999). doi:\n10.1016\/S0012-365X(98)00319-7\n\n. Preliminary versions appeared in SODA 1994 and SODA 1997","journal-title":"Discrete Math."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0012-365X(73)90100-3","volume":"6","author":"DP Sumner","year":"1973","unstructured":"Sumner, D.P.: Graphs indecomposable with respect to the X-join. Discrete Math. 6(3), 281\u2013298 (1973). doi:\n10.1016\/0012-365X(73)90100-3","journal-title":"Discrete Math."},{"issue":"14","key":"2_CR21","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.ipl.2011.04.009","volume":"111","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A factor 2 approximation algorithm for the vertex cover \n            $$\\text{ P }_3$$\n           problem. Inf. Process. Lett. 111(14), 683\u2013686 (2011). doi:\n10.1016\/j.ipl.2011.04.009","journal-title":"Inf. Process. Lett."},{"issue":"50","key":"2_CR22","doi-asserted-by":"publisher","first-page":"7044","DOI":"10.1016\/j.tcs.2011.09.013","volume":"412","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A primal-dual approximation algorithm for the vertex cover \n            $$\\text{ P }_3$$\n           problem. Theoret. Comput. Sci. 412(50), 7044\u20137048 (2011). doi:\n10.1016\/j.tcs.2011.09.013","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1090\/S0002-9939-1962-0172273-0","volume":"13","author":"ES Wolk","year":"1962","unstructured":"Wolk, E.S.: The comparability graph of a tree. Proc. Am. Math. Soc. 13, 789\u2013795 (1962). doi:\n10.1090\/S0002-9939-1962-0172273-0","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"2_CR24","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0166-218X(96)00094-7","volume":"69","author":"J-H Yan","year":"1996","unstructured":"Yan, J.-H., Chen, J.-J., Chang, G.J.: Quasi-threshold graphs. Discrete Appl. Math. 69(3), 247\u2013255 (1996). doi:\n10.1016\/0166-218X(96)00094-7","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-deletion problems on bipartite graphs. SIAM J. Comput. 10(2), 310\u2013327 (1981). doi:\n10.1137\/0210022","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53536-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T05:02:24Z","timestamp":1496811744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}