{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:54:05Z","timestamp":1758819245450},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,5]],"date-time":"2014-08-05T00:00:00Z","timestamp":1407196800000},"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":["Algorithmica"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s00453-014-9920-6","type":"journal-article","created":{"date-parts":[[2014,8,4]],"date-time":"2014-08-04T21:37:15Z","timestamp":1407188235000},"page":"566-580","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Multi-parameter Analysis for Local Graph Partitioning Problems: Using Greediness for Parameterization"],"prefix":"10.1007","volume":"71","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9meric","family":"Tourniaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,5]]},"reference":[{"key":"9920_CR1","first-page":"17","volume-title":"Proceedings of Conference on Integer Programming and Combinatorial Optimization, IPCO\u201999, volume 1610 of Lecture Notes in Computer Science","author":"AA Ageev","year":"1999","unstructured":"Ageev, A.A., Sviridenko, M.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) Proceedings of Conference on Integer Programming and Combinatorial Optimization, IPCO\u201999, volume 1610 of Lecture Notes in Computer Science, pp. 17\u201330. Springer, Berlin (1999)"},{"issue":"4","key":"9920_CR2","doi-asserted-by":"crossref","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. Assoc. Comput. Mach. 42(4), 844\u2013856 (1995)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9920_CR3","doi-asserted-by":"crossref","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. Comput. J. 51, 102\u2013121 (2008)","journal-title":"Comput. J."},{"key":"9920_CR4","first-page":"239","volume-title":"Proceedings of International Workshop on Parameterized and Exact Computation, IWPEC\u201906, volume 4169 of Lecture Notes in Computer Science","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.) Proceedings of International Workshop on Parameterized and Exact Computation, IWPEC\u201906, volume 4169 of Lecture Notes in Computer Science, pp. 239\u2013250. Springer, Berlin (2006)"},{"issue":"40\u201342","key":"9920_CR5","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"9920_CR6","doi-asserted-by":"crossref","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. Inf. Comput. 85, 12\u201375 (1990)","journal-title":"Inf. Comput."},{"key":"9920_CR7","doi-asserted-by":"crossref","unstructured":"Cygan, M., Lokshtanov, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Minimum bisection is fixed parameter tractable. In: Proceedings of ACM Symposium on Theory of Computing, STOC\u201914, pp. 323\u2013332. ACM, New York (2014)","DOI":"10.1145\/2591796.2591852"},{"key":"9920_CR8","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$$ k -cut and related problems. In: Electronic Notes in Theoretical Computer Science, vol. 78, pp. 205\u2013218. Elsevier, Amsterdam (2003)","DOI":"10.1016\/S1571-0661(04)81014-4"},{"issue":"3","key":"9920_CR9","doi-asserted-by":"crossref","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. 127(3), 643\u2013649 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9920_CR10","doi-asserted-by":"crossref","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 41(2), 174\u2013211 (2001)","journal-title":"J. Algorithms"},{"key":"9920_CR11","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. CORR, abs\/1304.6189 (2013)","DOI":"10.1007\/978-3-642-40313-2_38"},{"key":"9920_CR12","doi-asserted-by":"crossref","unstructured":"Kloks, T.: Treewidth, Computations and Approximations, volume 842 of Lecture Notes in Computer Science. Springer, Berlin (1994)","DOI":"10.1007\/BFb0045375"},{"key":"9920_CR13","doi-asserted-by":"crossref","unstructured":"Komusiewicz, C., Sorge, M.: Finding dense subgraphs of sparse graphs. In: Thilikos, D.M., Woeginger, G.J. (eds.) Proceedings of International Symposium on Parameterized and Exact Computation, IPEC\u201912, volume 7535 of Lecture Notes in Computer Science, pp. 242\u2013251. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-33293-7_23"},{"key":"9920_CR14","volume-title":"Elements of the Theory of Computation","author":"HR Lewis","year":"1981","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation. Prentice-Hall, Prentice (1981)"},{"key":"9920_CR15","unstructured":"Maneth, S.: Logic and Automata. Lecture 3: Expressiveness of MSO Graph Properties. Logic Summer School (2006)"},{"issue":"1","key":"9920_CR16","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"key":"9920_CR17","doi-asserted-by":"crossref","unstructured":"Shachnai, H., Zehavi, M.: Parameterized algorithms for graph partitioning problems. CoRR, abs\/1403.0099 (2014)","DOI":"10.1007\/978-3-319-12340-0_32"},{"key":"9920_CR18","doi-asserted-by":"crossref","unstructured":"Szeider, S.: Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2) (2011). doi: 10.1145\/1877714.1877718","DOI":"10.1145\/1877714.1877718"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9920-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9920-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9920-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T14:57:23Z","timestamp":1565708243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9920-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9920"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9920-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,5]]}}}