{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:57:09Z","timestamp":1743076629203,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_2","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:10Z","timestamp":1740067210000},"page":"16-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Proportionally Dense Subgraphs: Parameterized Hardness and\u00a0Efficiently Solvable Cases"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4702-673X","authenticated-orcid":false,"given":"Narmina","family":"Baghirova","sequence":"first","affiliation":[]},{"given":"Antoine","family":"Castillon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dam.2024.07.033","volume":"359","author":"N Baghirova","year":"2024","unstructured":"Baghirova, N., Dallard, C., Ries, B., Schindl, D.: Finding k-community structures in special graph classes. Discret. Appl. Math. 359, 159\u2013175 (2024). https:\/\/doi.org\/10.1016\/j.dam.2024.07.033","journal-title":"Discret. Appl. Math."},{"key":"2_CR2","unstructured":"Baghirova, N., Gonzalez, C.L., Ries, B., Schindl, D.: Locally checkable problems parameterized by clique-width. In: 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0248, pp. 31:1\u201331:20 (2022)"},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2019.105877","volume":"155","author":"C Bazgan","year":"2020","unstructured":"Bazgan, C., Chleb\u00edkov\u00e1, J., Dallard, C.: Graphs without a partition into two proportionally dense subgraphs. Inf. Process. Lett. 155, 105877 (2020). https:\/\/doi.org\/10.1016\/j.ipl.2019.105877","journal-title":"Inf. Process. Lett."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.dam.2019.07.010","volume":"270","author":"C Bazgan","year":"2019","unstructured":"Bazgan, C., Chleb\u00edkov\u00e1, J., Dallard, C., Pontoizeau, T.: Proportionally dense subgraph of maximum size: complexity and approximation. J. Comb. Algorithms Inform. Comput. Sci. 270, 25\u201336 (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.07.010","journal-title":"J. Comb. Algorithms Inform. Comput. Sci."},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Bazgan, C., Chlebikova, J., Dallard, C., Pontoizeau, T.: Proportionally dense subgraph of maximum size: complexity and approximation. Discret. Appl. Math. 270 (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.07.010","DOI":"10.1016\/j.dam.2019.07.010"},{"issue":"6","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1890","DOI":"10.1007\/s00453-017-0283-7","volume":"80","author":"C Bazgan","year":"2018","unstructured":"Bazgan, C., Chlebikova, J., Pontoizeau, T.: Structural and algorithmic properties of 2-community structures. Algorithmica 80(6), 1890\u20131908 (2018). https:\/\/doi.org\/10.1007\/s00453-017-0283-7","journal-title":"Algorithmica"},{"issue":"8","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1236","DOI":"10.1016\/j.dam.2005.10.014","volume":"154","author":"C Bazgan","year":"2006","unstructured":"Bazgan, C., Tuza, Z., Vanderpooten, D.: The satisfactory partition problem. Discret. Appl. Math. 154(8), 1236\u20131245 (2006). https:\/\/doi.org\/10.1016\/j.dam.2005.10.014","journal-title":"Discret. Appl. Math."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2022.01.019","volume":"314","author":"F Bonomo-Braberman","year":"2022","unstructured":"Bonomo-Braberman, F., Gonzalez, C.L.: A new approach on locally checkable problems. Discret. Appl. Math. 314, 53\u201380 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.01.019","journal-title":"Discret. Appl. Math."},{"key":"2_CR9","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory. Springer, Cham (2005)"},{"key":"2_CR10","unstructured":"Estivill-Castro, V., Parsa, M.: On connected two communities. In: Proceedings of the Thirty-Sixth Australasian Computer Science Conference, ACSC 2013, vol. 135, pp. 23\u201330. Australian Computer Society, Inc. (2013)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U Feige","year":"2001","unstructured":"Feige, U., Peleg, D., Kortsarz, G.: The dense k-subgraph problem. Algorithmica 29, 410\u2013421 (2001). https:\/\/doi.org\/10.1007\/s004530010050","journal-title":"Algorithmica"},{"issue":"20","key":"2_CR12","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1016\/j.disc.2010.05.028","volume":"310","author":"H Fleischner","year":"2010","unstructured":"Fleischner, H., Sabidussi, G., Sarvanov, V.I.: Maximum independent sets in 3- and 4-regular Hamiltonian graphs. Discret. Math. 310(20), 2742\u20132749 (2010). https:\/\/doi.org\/10.1016\/j.disc.2010.05.028. graph Theory - Dedicated to Carsten Thomassen on his 60th Birthday","journal-title":"Discret. Math."},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.tcs.2022.01.022","volume":"907","author":"A Gaikwad","year":"2022","unstructured":"Gaikwad, A., Maity, S., Tripathi, S.K.: Parameterized complexity of satisfactory partition problem. Theor. Comput. Sci. 907, 113\u2013127 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.01.022","journal-title":"Theor. Comput. Sci."},{"key":"2_CR14","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1990)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90059-1","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Kloks, T.: Treewidth. Lecture Notes in Computer Science, vol. 842 (1994). https:\/\/doi.org\/10.1007\/BFb0045375","DOI":"10.1007\/BFb0045375"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Komusiewicz, C.: Multivariate algorithmics for finding cohesive subnetworks. Algorithms 9(1) (2016). https:\/\/doi.org\/10.3390\/a9010021","DOI":"10.3390\/a9010021"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.mathsocsci.2013.07.002","volume":"66","author":"M Olsen","year":"2013","unstructured":"Olsen, M.: A general view on computing communities. Math. Soc. Sci. 66(3), 331\u2013336 (2013). https:\/\/doi.org\/10.1016\/j.mathsocsci.2013.07.002","journal-title":"Math. Soc. Sci."},{"key":"2_CR19","unstructured":"Vatshelle, M.: New width parameters of graphs. Ph.D. thesis (2012)"},{"issue":"Suppl 7","key":"2_CR20","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1186\/s12864-018-5027-9","volume":"19","author":"Y Zhu","year":"2018","unstructured":"Zhu, Y., Li, Y., Liu, J., Qin, L., Yu, J.X.: Discovering large conserved functional components in global network alignment by graph matching. BMC Genomics 19(Suppl 7), 670 (2018)","journal-title":"BMC Genomics"}],"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-96-2845-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:13Z","timestamp":1740067213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","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":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}