{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T03:32:55Z","timestamp":1777865575988,"version":"3.51.4"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031976285","type":"print"},{"value":"9783031976292","type":"electronic"}],"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-3-031-97629-2_3","type":"book-chapter","created":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T06:30:44Z","timestamp":1751610644000},"page":"35-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Uncovering and\u00a0Verifying Optimal Community Structure in\u00a0Complex Networks: A MaxSAT Approach"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Ans\u00f3tegui","sequence":"first","affiliation":[]},{"given":"Vaidyanathan Peruvemba","family":"Ramaswamy","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]},{"given":"Hai","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,5]]},"reference":[{"key":"3_CR1","unstructured":"Ans\u00f3tegui, C., Levy, J.: On the modularity of industrial SAT instances. In: CCIA 2011. FAIA, vol.\u00a0232, pp. 11\u201320. IOS Press (2011)"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Aref, S., Chheda, H., Mostajabdaveh, M.: The Bayan algorithm: detecting communities in networks through exact and approximate optimization of modularity. CoRR arxiv:2209.04562 (2022). https:\/\/doi.org\/10.48550\/ARXIV.2209.04562","DOI":"10.48550\/ARXIV.2209.04562"},{"key":"3_CR3","doi-asserted-by":"publisher","DOI":"10.6084\/m9.figshare.24257293.v1","author":"S Aref","year":"2023","unstructured":"Aref, S., Mostajabdaveh, M.: Dataset of synthetic modular graphs from LFR and ABCD benchmark models for community detection. Figshare (2023). https:\/\/doi.org\/10.6084\/m9.figshare.24257293.v1","journal-title":"Figshare"},{"key":"3_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/J.JOCS.2024.102283","volume":"78","author":"S Aref","year":"2024","unstructured":"Aref, S., Mostajabdaveh, M.: Analyzing modularity maximization in approximation, heuristic, and graph neural network algorithms for community detection. JCS 78, 102283 (2024). https:\/\/doi.org\/10.1016\/J.JOCS.2024.102283","journal-title":"JCS"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Aref, S., Mostajabdaveh, M., Chheda, H.: Heuristic modularity maximization algorithms for community detection rarely return an optimal partition or anything similar. In: ICCS 2023. LNCS, vol. 14076, pp. 612\u2013626. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-36027-5_48","DOI":"10.1007\/978-3-031-36027-5_48"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Biedermann, S., Henzinger, M., Schulz, C., Schuster, B.: Memetic graph clustering. In: SEA 2018. LIPIcs, vol.\u00a0103, pp. 3:1\u20133:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.SEA.2018.3","DOI":"10.4230\/LIPICS.SEA.2018.3"},{"issue":"10","key":"3_CR7","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. JSTAT 2008(10), P10008 (2008). https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"JSTAT"},{"key":"3_CR8","unstructured":"Bonald, T., Charpentier, B., Galland, A., Hollocou, A.: Hierarchical graph clustering using node pair sampling. In: MLG (2018)"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Bouguessa, M., Missaoui, R., Talbi, M.: A novel approach for detecting community structure in networks. In: ICTAI 2014, pp. 469\u2013477 (2014). https:\/\/doi.org\/10.1109\/ICTAI.2014.77","DOI":"10.1109\/ICTAI.2014.77"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., et al.: On modularity clustering. IEEE TKDE 20(2), 172\u2013188 (2008). https:\/\/doi.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE TKDE"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset, A., Newman, M., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.70.066111","journal-title":"Phys. Rev. E"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1080\/15427951.2014.950875","volume":"11","author":"TN Dinh","year":"2015","unstructured":"Dinh, T.N., Thai, M.T.: Toward optimal community detection: from trees to general weighted networks. Internet Math. 11(3), 181\u2013200 (2015). https:\/\/doi.org\/10.1080\/15427951.2014.950875","journal-title":"Internet Math."},{"key":"3_CR13","unstructured":"Esfahanian, A.H.: Connectivity algorithms. In: Topics in Structural Graph Theory, pp. 268\u2013281 (2013)"},{"key":"3_CR14","unstructured":"Even, S.: Graph Algorithms. WH Freeman & Co. (1979)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977). https:\/\/doi.org\/10.2307\/3033543","journal-title":"Sociometry"},{"key":"3_CR16","unstructured":"Gocht, S., McCreesh, C., Nordstr\u00f6m, J.: Veripb: the easy way to make your combinatorial search algorithm trustworthy. In: CPTAI Workshop at CP (2020)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: SciPy 2008, pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a python toolkit for prototyping with SAT oracles. In: SAT 2018, pp. 428\u2013437 (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Kammer, F., T\u00e4ubig, H.: Connectivity, pp. 143\u2013177. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31955-9_7","DOI":"10.1007\/978-3-540-31955-9_7"},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.118703","volume":"100","author":"EA Leicht","year":"2008","unstructured":"Leicht, E.A., Newman, M.: Community structure in directed networks. Phys. Rev. Lett. 100, 118703 (2008). https:\/\/doi.org\/10.1103\/PhysRevLett.100.118703","journal-title":"Phys. Rev. Lett."},{"key":"3_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128169","volume":"600","author":"J Li","year":"2024","unstructured":"Li, J., et al.: A comprehensive review of community detection in graphs. Neurocomputing 600, 128169 (2024). https:\/\/doi.org\/10.1016\/j.neucom.2024.128169","journal-title":"Neurocomputing"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Li, P., Huang, L., Wang, C., Lai, J.: Edmot: an edge enhancement approach for motif-aware community detection. In: KDD 2019, pp. 479\u2013487. ACM (2019). https:\/\/doi.org\/10.1145\/3292500.3330882","DOI":"10.1145\/3292500.3330882"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms. In: Handbook of Metaheuristics, ISOR, vol.\u00a057, pp. 105\u2013144. Kluwer\/Springer (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_5","DOI":"10.1007\/0-306-48056-5_5"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejor.2010.08.012","volume":"211","author":"MC Nascimento","year":"2011","unstructured":"Nascimento, M.C., de Carvalho, A.C.: Spectral methods for graph clustering - a survey. EJOR 211(2), 221\u2013231 (2011). https:\/\/doi.org\/10.1016\/j.ejor.2010.08.012","journal-title":"EJOR"},{"key":"3_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004). https:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys. Rev. E"},{"key":"3_CR26","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198805090.001.0001","volume-title":"Networks","author":"M Newman","year":"2018","unstructured":"Newman, M.: Networks, 2nd edn. Oxford University Press, Oxford (2018)","edition":"2"},{"key":"3_CR27","first-page":"20","volume":"2018","author":"T Paxian","year":"2018","unstructured":"Paxian, T., Reimer, S., Becker, B.: Pacose: an iterative SAT-based MaxSAT solver. MaxSAT Eval. 2018, 20 (2018)","journal-title":"MaxSAT Eval."},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Peixoto, T.P.: The Netzschleuder network catalogue and repository (2023). https:\/\/doi.org\/10.5281\/zenodo.7839981","DOI":"10.5281\/zenodo.7839981"},{"issue":"1","key":"3_CR29","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/S41109-022-00500-Z","volume":"7","author":"S Sobolevsky","year":"2022","unstructured":"Sobolevsky, S., Belyi, A.: Graph neural network inspired algorithm for unsupervised network community detection. Appl. Netw. Sci. 7(1), 63 (2022). https:\/\/doi.org\/10.1007\/S41109-022-00500-Z","journal-title":"Appl. Netw. Sci."},{"key":"3_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.012811","volume":"90","author":"S Sobolevsky","year":"2014","unstructured":"Sobolevsky, S., Campari, R., Belyi, A., Ratti, C.: General optimization technique for high-quality community detection in complex networks. Phys. Rev. E 90, 012811 (2014). https:\/\/doi.org\/10.1103\/PhysRevE.90.012811","journal-title":"Phys. Rev. E"},{"key":"3_CR31","doi-asserted-by":"publisher","unstructured":"Traag, V., Waltman, L., van Eck, N.J.: From Louvain to Leiden: guaranteeing well-connected communities. Nat. Sci. Rep. 9(5233) (2019). https:\/\/doi.org\/10.1038\/s41598-019-41695-z","DOI":"10.1038\/s41598-019-41695-z"},{"issue":"95","key":"3_CR32","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. JMLR 11(95), 2837\u20132854 (2010)","journal-title":"JMLR"},{"key":"3_CR33","doi-asserted-by":"publisher","unstructured":"Xia, H., Szeider, S.: SAT-Based tree decomposition with iterative cascading policy selection. In: AAAI, vol. 38, no. 8, pp. 8191\u20138199 (2024). https:\/\/doi.org\/10.1609\/aaai.v38i8.28659","DOI":"10.1609\/aaai.v38i8.28659"},{"issue":"51","key":"3_CR34","doi-asserted-by":"publisher","first-page":"18144","DOI":"10.1073\/pnas.1409770111","volume":"111","author":"P Zhang","year":"2014","unstructured":"Zhang, P., Moore, C.: Scalable detection of statistically significant communities and hierarchies, using message passing for modularity. Proc. Natl. Acad. Sci. U.S.A. 111(51), 18144\u201318149 (2014)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97629-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T06:54:46Z","timestamp":1777532086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97629-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031976285","9783031976292"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97629-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"7 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}