{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:31:17Z","timestamp":1761294677810,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T00:00:00Z","timestamp":1698710400000},"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":[],"published-print":{"date-parts":[[2023,10,31]]},"DOI":"10.1109\/tencon58879.2023.10322484","type":"proceedings-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T19:07:19Z","timestamp":1700680039000},"page":"674-679","source":"Crossref","is-referenced-by-count":2,"title":["Solving Dense Subgraph Problems Using Genetic Algorithm"],"prefix":"10.1109","author":[{"given":"Joseph L","family":"Pachuau","sequence":"first","affiliation":[{"name":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nongmeikapam Brajabidhu","family":"Singh","sequence":"additional","affiliation":[{"name":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laiphrakpam Dolendro","family":"Singh","sequence":"additional","affiliation":[{"name":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anish Kumar","family":"Saha","sequence":"additional","affiliation":[{"name":"National Institute of Technology Silchar,Department of Computer Science and Engineering,Assam,India,788010"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.01.027"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-4-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICS51289.2020.00034"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-x_10"},{"key":"ref8","first-page":"721","article-title":"Discovering large dense subgraphs in massive graphs","volume-title":"Proceedings of the 31st international conference on Very large data bases","author":"Gibson"},{"key":"ref9","article-title":"Most probable densest subgraphs","volume":"abs\/2212.08820","author":"Saha","year":"2022","journal-title":"ArXiv"},{"issue":"2","key":"ref10","first-page":"51","article-title":"An efficient ga with multipoint guided mutation for graph coloring problems","volume":"3","author":"Ray","year":"2010","journal-title":"International Journal of Signal Processing, Image Processing and Pattern Recognition"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/12.508322"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3014351"},{"key":"ref13","first-page":"299","article-title":"A two stage converging ge-netic algorithm for graph clustering","volume":"17","author":"Lu","year":"2020","journal-title":"International Journal of Applied Science and Engineering"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1998.699328"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.05.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598382"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0602-x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2022.106316"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-022-00927-1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551826"},{"article-title":"Finding dense subgraphs via low-rank bilinear optimization","volume-title":"International Conference on Machine Learning","author":"Papailiopoulos","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-007-9069-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-01090-z"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.130.190601"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.12.031045"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330216"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IEOM.2015.7093815"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"}],"event":{"name":"TENCON 2023 - 2023 IEEE Region 10 Conference (TENCON)","start":{"date-parts":[[2023,10,31]]},"location":"Chiang Mai, Thailand","end":{"date-parts":[[2023,11,3]]}},"container-title":["TENCON 2023 - 2023 IEEE Region 10 Conference (TENCON)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10322307\/10322308\/10322484.pdf?arnumber=10322484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T21:26:19Z","timestamp":1709414779000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10322484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,31]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/tencon58879.2023.10322484","relation":{},"subject":[],"published":{"date-parts":[[2023,10,31]]}}}