{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T09:18:45Z","timestamp":1759742325613,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"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-981-97-0566-5_30","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"421-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Complexity of\u00a0List $$\\mathcal H$$-Packing for\u00a0Sparse Graph Classes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2815-5699","authenticated-orcid":false,"given":"Tatsuya","family":"Gima","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3244-6915","authenticated-orcid":false,"given":"Yasuaki","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0087-853X","authenticated-orcid":false,"given":"Yota","family":"Otachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomohito","family":"Shirai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5212-0202","authenticated-orcid":false,"given":"Akira","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuma","family":"Tamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-031-27051-2_25","volume-title":"the 17th International Conference and Workshops (WALCOM 2023)","author":"NR Aravind","year":"2023","unstructured":"Aravind, N.R., Saxena, R.: Parameterized complexity of path set packing. In: Lin, C.-C., Lin, B.M.T., Liotta, G. (eds.) the 17th International Conference and Workshops (WALCOM 2023), pp. 291\u2013302. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27051-2_25"},{"key":"30_CR2","doi-asserted-by":"publisher","unstructured":"Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. In: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp. 148\u2013157 (1993). https:\/\/doi.org\/10.1109\/SFCS.1993.366872","DOI":"10.1109\/SFCS.1993.366872"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0196-6774(90)90001-U","volume":"11","author":"F Berman","year":"1990","unstructured":"Berman, F., Johnson, D., Leighton, T., Shor, P.W., Snyder, L.: Generalized planar matching. J. Algorithms 11(2), 153\u2013184 (1990). https:\/\/doi.org\/10.1016\/0196-6774(90)90001-U","journal-title":"J. Algorithms"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1), 1\u201345 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(97)00228-4","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"30_CR5","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"KMJD Bontridder","year":"2003","unstructured":"Bontridder, K.M.J.D., et al.: Approximation algorithms for the test cover problem. Math. Program. 98(1\u20133), 477\u2013491 (2003). https:\/\/doi.org\/10.1007\/s10107-003-0414-6","journal-title":"Math. Program."},{"issue":"4","key":"30_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0020-0190(02)00274-0","volume":"84","author":"A Caprara","year":"2002","unstructured":"Caprara, A., Rizzi, R.: Packing triangles in bounded degree graphs. Inf. Process. Lett. 84(4), 175\u2013180 (2002). https:\/\/doi.org\/10.1016\/S0020-0190(02)00274-0","journal-title":"Inf. Process. Lett."},{"key":"30_CR7","first-page":"103","volume":"52","author":"F Chung","year":"1981","unstructured":"Chung, F., Graham, R.: Recent results in graph decompositions. London Math. Soc. Lecture Note Ser. 52, 103\u2013123 (1981)","journal-title":"London Math. Soc. Lecture Note Ser."},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0166-218X(92)00153-D","volume":"50","author":"DG Corneil","year":"1994","unstructured":"Corneil, D.G., Masuyama, S., Hakimi, S.L.: Edge-disjoint packings of graphs. Discret. Appl. Math. 50(2), 135\u2013148 (1994). https:\/\/doi.org\/10.1016\/0166-218X(92)00153-D","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"M Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.: On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. 10(2), 139\u2013153 (1985). https:\/\/doi.org\/10.1016\/0166-218X(85)90008-3","journal-title":"Discret. Appl. Math."},{"key":"30_CR10","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a Symposium on the Complexity of Computer Computations, held March 20\u201322, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"30_CR11","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM J. Comput. 12(3), 601\u2013609 (1983). https:\/\/doi.org\/10.1137\/0212040","journal-title":"SIAM J. Comput."},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Kosowski, A., Malafiejski, M., Zylinski, P.: Parallel processing subsystems with redundancy in a distributed environment. In: Wyrzykowski, R., Dongarra, J.J., Meyer, N., Wasniewski, J. (eds.) Parallel Processing and Applied Mathematics, 6th International Conference, PPAM 2005. LNCS, vol. 3911, pp. 1002\u20131009. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11752578_121","DOI":"10.1007\/11752578_121"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11424758_68","volume-title":"Computational Science and Its Applications - ICCSA 2005","author":"M Ma\u0142afiejski","year":"2005","unstructured":"Ma\u0142afiejski, M., \u017byli\u0144ski, P.: Weakly cooperative guards in grids. In: Gervasi, O., et al. (eds.) Computational Science and Its Applications - ICCSA 2005, pp. 647\u2013656. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11424758_68"},{"key":"30_CR14","doi-asserted-by":"publisher","unstructured":"Minty, G.J.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory, Ser. B 28(3), 284\u2013304 (1980). https:\/\/doi.org\/10.1016\/0095-8956(80)90074-X","DOI":"10.1016\/0095-8956(80)90074-X"},{"issue":"2","key":"30_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0166-218X(92)90041-8","volume":"35","author":"OJ Murphy","year":"1992","unstructured":"Murphy, O.J.: Computing independent sets in graphs with large girth. Discret. Appl. Math. 35(2), 167\u2013170 (1992). https:\/\/doi.org\/10.1016\/0166-218X(92)90041-8","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"30_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de recherche d\u2019un stable de cardinalite maximum dans un graphe sans etoile. Discret. Math. 29(1), 53\u201376 (1980). https:\/\/doi.org\/10.1016\/0012-365X(90)90287-R","journal-title":"Discret. Math."},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982). https:\/\/doi.org\/10.1137\/0211023","journal-title":"SIAM J. Comput."},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-94776-1_26","volume-title":"Computing and Combinatorics","author":"C Xu","year":"2018","unstructured":"Xu, C., Zhang, G.: The path set packing problem. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 305\u2013315. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_26"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:10:05Z","timestamp":1709655005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_30","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":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}