{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:26:32Z","timestamp":1774023992311,"version":"3.50.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tcss.2024.3462934","type":"journal-article","created":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:34:50Z","timestamp":1730208890000},"page":"1584-1597","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Detection of $k$-Plex Structures in Large Graphs Through Constraint Learning"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2277-6021","authenticated-orcid":false,"given":"Hui-Ju","family":"Hung","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Central University, Taoyuan, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5966-8987","authenticated-orcid":false,"given":"Chia-Hsun","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun-Ya","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6422-0246","authenticated-orcid":false,"given":"Ming-Yi","family":"Chang","sequence":"additional","affiliation":[{"name":"Department of Sociology, Fu Jen Catholic University, Taipei, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0560-9857","authenticated-orcid":false,"given":"Ya-Chi","family":"Ho","sequence":"additional","affiliation":[{"name":"Industrial Technology Research Institute (ITRI), Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0377-7945","authenticated-orcid":false,"given":"Chih-Ya","family":"Shen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.110487"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3266755"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/250"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746478"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3639318"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-016-0022-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/GCCE46687.2019.9015425"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098031"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17477"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9338-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/233"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-017-0059-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.04.041"},{"key":"ref15","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"Li","year":"2018","journal-title":"Annu. Conf. Neural Inf. Process. Syst. (NIPS)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.06.111"},{"key":"ref17","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Khalil","year":"2017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3103811"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/net.21745"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2468726"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3057361"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2980516"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2875911"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11310"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2859580"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2878866"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.173"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SSIRI.2009.62"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411867"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.14"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2021.3139319"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2949294"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574249"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487599"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380269"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539437"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-2253-2_27"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2023.3340230"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3152179"},{"key":"ref41","article-title":"Erdos goes neural: An unsupervised learning framework for combinatorial optimization on graphs","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Karalias","year":"2020"},{"key":"ref42","article-title":"Deep graph representation learning and optimization for influence maximization","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Ling","year":"2023"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.02.034"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/323"},{"key":"ref45","first-page":"7619","article-title":"An integer linear programming framework for mining constraints from data","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Meng","year":"2021"},{"key":"ref46","first-page":"344","article-title":"Learning to branch","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Balcan","year":"2018"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16512"},{"key":"ref48","article-title":"An improved reinforcement learning algorithm for learning to branch","author":"Qu","year":"2022"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25521"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-32833-1_235"},{"key":"ref51","article-title":"Linear programming and integer linear programming","author":"Mehlhorn","year":"2013"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339679"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2835565"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"issue":"290-297","key":"ref58","first-page":"1","article-title":"Random graphs I","volume":"6","author":"Erdos","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20307"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i14.29468"},{"key":"ref62","article-title":"Graph mixture of experts: Learning on large-scale graphs with explicit diversity modeling","author":"Wang","year":"2024","journal-title":"Annu. Conf. Neural Inf. Process. Syst. (NIPS)"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2024.3388728"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3068461"},{"key":"ref65","article-title":"Gurobi Optimizer Reference Manual","year":"2023"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570650\/11118943\/10737893.pdf?arnumber=10737893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T18:37:00Z","timestamp":1767724620000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10737893\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":65,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2024.3462934","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}