{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:07:50Z","timestamp":1725757670349},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038971"},{"type":"electronic","value":"9783319038988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03898-8_7","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T02:57:26Z","timestamp":1384829846000},"page":"66-77","source":"Crossref","is-referenced-by-count":3,"title":["Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization"],"prefix":"10.1007","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[]},{"given":"\u00c9meric","family":"Tourniaire","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1093\/comjnl\/bxm086","volume":"51","author":"L. Cai","year":"2008","unstructured":"Cai, L.: Parameter complexity of cardinality constrained optimization problems. The Computer Journal\u00a051, 102\u2013121 (2008)","journal-title":"The Computer Journal"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Estivill-Castro, V., Fellows, M.R., Prieto, E., Rosamond, F.A.: Cutting up is hard to do: the parameterized complexity of k-cut and related problems. Electronic Notes in Theoretical Computer Science, vol.\u00a078, pp. 205\u2013218. Elsevier (2003)","DOI":"10.1016\/S1571-0661(04)81014-4"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Korhonen, J.H.: On the parameterized complexity of cutting a few vertices from a graph. Technical report, CoRR, abs\/1304.6189 (2013)","DOI":"10.1007\/978-3-642-40313-2_38"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal\u00a051, 60\u201378 (2008)","journal-title":"The Computer Journal"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/S0166-218X(02)00394-3","volume":"127","author":"U. Feige","year":"2003","unstructured":"Feige, U., Krauthgamer, R., Nissim, K.: On cutting a few vertices from a graph. Discrete Appl. Math.\u00a0127, 643\u2013649 (2003)","journal-title":"Discrete Appl. Math."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"A.A. Ageev","year":"1999","unstructured":"Ageev, A.A., Sviridenko, M.I.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol.\u00a01610, pp. 17\u201330. Springer, Heidelberg (1999)"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U. Feige","year":"2001","unstructured":"Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms\u00a041, 174\u2013211 (2001)","journal-title":"J. Algorithms"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"7_CR9","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the theory of computation. Prentice-Hall (1981)"},{"key":"7_CR10","unstructured":"Maneth, S.: Logic and automata. Lecture 3: Expressiveness of MSO graph properties. Logic Summer School (2006)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-540-85238-4_49","volume-title":"Mathematical Foundations of Computer Science 2008","author":"S. Szeider","year":"2008","unstructured":"Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 601\u2013612. Springer, Heidelberg (2008)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Bonnet, E., Escoffier, B., Paschos, V.T., Tourniaire, E.: Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization. CoRR abs\/1306.2217 (2013)","DOI":"10.1007\/978-3-319-03898-8_7"},{"key":"7_CR13","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 method 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":"7_CR14","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J.\u00a0Assoc. Comput. Mach.\u00a042, 844\u2013856 (1995)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-36065-7_12","volume-title":"WALCOM: Algorithms and Computation","author":"N. Bourgeois","year":"2013","unstructured":"Bourgeois, N., Giannakos, A., Lucarelli, G., Milis, I., Paschos, V.T.: Exact and approximation algorithms for densest \n                        k\n                        -subgraph. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol.\u00a07748, pp. 114\u2013125. Springer, Heidelberg (2013)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","author":"T. Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth. LNCS, vol.\u00a0842. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03898-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:50:58Z","timestamp":1558680658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03898-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038971","9783319038988"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03898-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}