{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:00:29Z","timestamp":1763535629650,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2934470","type":"journal-article","created":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T19:28:28Z","timestamp":1565638108000},"page":"110267-110278","source":"Crossref","is-referenced-by-count":4,"title":["A Swap-Based Heuristic Algorithm for the Maximum $k$ -Plex Problem"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4746-3179","authenticated-orcid":false,"given":"Sun-Yuan","family":"Hsieh","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan"}]},{"given":"Shih-Shun","family":"Kao","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan"}]},{"given":"Yu-Sheng","family":"Lin","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan, Taiwan"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289199"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9338-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/net.21745"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF00139635"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9391-5"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.07.019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_10"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(99)00047-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"key":"ref6","first-page":"9","article-title":"An\n$O^{*}(1.4658^ {n})$\n-time exact algorithm for the maximum bounded-degree-1 set problem","author":"chang","year":"2014","journal-title":"Proc 31st Workshop Combinat Math Comput Theory"},{"key":"ref5","first-page":"41","article-title":"On effectively finding maximal quasi-cliques in graphs","author":"brunato","year":"2007","journal-title":"Proc 5th Int Conf Learn Intell Optim"},{"key":"ref8","volume":"26","author":"johnson","year":"1993","journal-title":"Cliques Coloring and Satisfiability Second DIMACS Implementation Challenge"},{"journal-title":"A Hybrid Metaheuristic for the Maximum k-Plex Problem","year":"2014","author":"gujjula","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1973.9989826"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45995-2_51"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230080402"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.05.005"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08794502.pdf?arnumber=8794502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:49:03Z","timestamp":1662666543000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8794502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2934470","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}