{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T21:31:57Z","timestamp":1780954317410,"version":"3.54.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"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":[[2025,1,15]]},"DOI":"10.1109\/icoin63865.2025.10993141","type":"proceedings-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T17:30:44Z","timestamp":1747243844000},"page":"584-589","source":"Crossref","is-referenced-by-count":2,"title":["Finding Maximum Independent Set using Particle Swarm Optimization"],"prefix":"10.1109","author":[{"given":"Ritika","family":"Verma","sequence":"first","affiliation":[{"name":"National Institute of Technology Hamirpur,Department of Computer Science and Engineering,Hamirpur,Himachal Pradesh,India,177 005"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dharmendra Prasad","family":"Mahato","sequence":"additional","affiliation":[{"name":"National Institute of Technology Hamirpur,Department of Computer Science and Engineering,Hamirpur,Himachal Pradesh,India,177 005"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.11591\/ijece.v7i6.pp3583-3592"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.2.226"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.08.223"},{"issue":"6","key":"ref4","first-page":"19","article-title":"Heuristic algorithm for graph coloring based on maximum independent set","volume":"13","author":"Almara\u2019beh","year":"2012","journal-title":"Journal of Applied Computer Science & Mathematics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1994.350004"},{"key":"ref7","article-title":"10th dimacs implementation challenge-graph partitioning and graph clustering","author":"Bader","year":"2011"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.5539\/cis.v3n1p180"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312058"},{"key":"ref11","first-page":"1","article-title":"The maximum clique problem. Handbook of Combinatorial Optimization: Supplement Volume A","author":"Bomze","year":"1999"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-0487-9_83"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.860"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600405"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21200"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/iccima.2003.1238126"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02832348"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098364"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v29i1.9277","article-title":"The network data repository with interactive graph analytics and visualization","author":"Rossi","year":"2015","journal-title":"AAAI"},{"issue":"3","key":"ref25","first-page":"551","article-title":"A genetic approach for maximum independent set problems","volume":"80","author":"Sakamoto","year":"1997","journal-title":"IEICE transactions on fundamentals of electronics, communications and computer sciences"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/cec.2002.1004495"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110474"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ITI.2001.938044"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-9464-7"}],"event":{"name":"2025 International Conference on Information Networking (ICOIN)","location":"Chiang Mai, Thailand","start":{"date-parts":[[2025,1,15]]},"end":{"date-parts":[[2025,1,17]]}},"container-title":["2025 International Conference on Information Networking (ICOIN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10992637\/10992586\/10993141.pdf?arnumber=10993141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:34:36Z","timestamp":1747283676000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10993141\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,15]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icoin63865.2025.10993141","relation":{},"subject":[],"published":{"date-parts":[[2025,1,15]]}}}