{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:53:20Z","timestamp":1743036800127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031609237"},{"type":"electronic","value":"9783031609244"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60924-4_17","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:38:27Z","timestamp":1716349107000},"page":"220-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fixed-Parameter Algorithms for\u00a0Cardinality-Constrained Graph Partitioning Problems on\u00a0Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Suguru","family":"Yamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6943-856X","authenticated-orcid":false,"given":"Tesshu","family":"Hanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"17_CR1","unstructured":"Betzler, N.: Steiner tree problems in the analysis of biological networks. Master\u2019s thesis, Universit\u00e4t T\u00fcbingen (2006)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c$${}^{\\text{ k }}$$ n 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/s00453-014-9920-6","volume":"71","author":"E Bonnet","year":"2015","unstructured":"Bonnet, E., Escoffier, B., Paschos, V.T., Tourniaire, E.: Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization. Algorithmica 71(3), 566\u2013580 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1093\/comjnl\/bxm086","volume":"51","author":"L Cai","year":"2008","unstructured":"Cai, L.: Parameterized complexity of cardinality constrained optimization problems. Comput. J. 51(1), 102\u2013121 (2008)","journal-title":"Comput. J."},{"key":"17_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015)"},{"issue":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1007\/s00453-020-00789-1","volume":"83","author":"GL Duarte","year":"2021","unstructured":"Duarte, G.L., et al.: Computing the largest bond and the maximum connected cut of a graph. Algorithmica 83(5), 1421\u20131458 (2021)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jda.2009.01.005","volume":"8","author":"B Escoffier","year":"2010","unstructured":"Escoffier, B., Gourv\u00e8s, L., Monnot, J.: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs. J. Discrete Algorithms 8(1), 36\u201349 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR8","unstructured":"Fomin, F.V., Golovach, P.A., Inamdar, T., Koana, T.: FPT approximation and subexponential algorithms for covering few or many edges. In: Leroux, J., Lombardy, S., Peleg, D. (eds.) 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, volume 272 of LIPIcs, pp. 1\u20138. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, (2023)"},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1137\/19M1262504","volume":"51","author":"FV Fomin","year":"2022","unstructured":"Fomin, F.V., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. SIAM J. Comput. 51(6), 1866\u20131930 (2022)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2886094","volume":"63","author":"FV Fomin","year":"2016","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S.: Efficient computation of representative families with applications in parameterized and exact algorithms. J. ACM 63(4), 1\u201360 (2016)","journal-title":"J. ACM"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP complete. SIAM J. Appl. Math. 32, 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2020.01.016","volume":"814","author":"MT Hajiaghayi","year":"2020","unstructured":"Hajiaghayi, M.T., Kortsarz, G., MacDavid, R., Purohit, M., Sarpatwar, K.: Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. 814, 74\u201385 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR13","first-page":"155","volume":"9","author":"JM Keil","year":"1991","unstructured":"Keil, J.M., Brecht, T.B.: The complexity of clustering in planar graphs. J. Comb. Math. Comb. Comput. 9, 155\u2013159 (1991)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"17_CR14","unstructured":"Koana, T., Komusiewicz, C., Nichterlein, A., Sommer, F.: Covering many (or few) edges with $$k$$ vertices in sparse graphs. In: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), volume 219 of LIPIcs, pp. 1\u2013 18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.dam.2015.04.029","volume":"193","author":"C Komusiewicz","year":"2015","unstructured":"Komusiewicz, C., Sorge, M.: An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems. Discret. Appl. Math. 193, 145\u2013161 (2015)","journal-title":"Discret. Appl. Math."},{"issue":"5","key":"17_CR16","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: $$k$$-degenerate graphs. Can. J. Math. 22(5), 1082\u20131096 (1970)","journal-title":"Can. J. Math."},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"DW Matula","year":"1983","unstructured":"Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30(3), 417\u2013427 (1983)","journal-title":"J. ACM"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-031-09574-0_18","volume-title":"Computer Science - Theory and Applications","author":"F Panolan","year":"2022","unstructured":"Panolan, F., Yaghoubizade, H.: Partial vertex cover on graphs of bounded degeneracy. In: Kulikov, A.S., Raskhodnikova, S. (eds.) Computer Science - Theory and Applications. Lecture Notes in Computer Science, vol. 13296, pp. 289\u2013301. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09574-0_18"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s00224-016-9706-0","volume":"61","author":"H Shachnai","year":"2017","unstructured":"Shachnai, H., Zehavi, M.: Parameterized algorithms for graph partitioning problems. Theory Comput. Syst. 61(3), 721\u2013738 (2017)","journal-title":"Theory Comput. Syst."},{"key":"17_CR20","unstructured":"Yamada, S., Hanaka, T.: A subexponential-time algorithm for connected graph partitioning problems [Translated from Japanese]. In: Summer LA Symposium 2023, July 3 \u2013 July 5, Hokkaido, Japan, Proceedings, pp. 14S\u20131 \u2013 14S-3 (2023). (in Japanese)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60924-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:39:27Z","timestamp":1716349167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60924-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031609237","9783031609244"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60924-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"La Laguna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}