{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:55:33Z","timestamp":1774544133920,"version":"3.50.1"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"University Research Board of the American University of Beirut","award":["AUB-URB-104391-26749"],"award-info":[{"award-number":["AUB-URB-104391-26749"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tpds.2025.3641049","type":"journal-article","created":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T18:32:14Z","timestamp":1766514734000},"page":"504-517","source":"Crossref","is-referenced-by-count":1,"title":["Faster Vertex Cover Algorithms on GPUs With Component-Aware Parallel Branching"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3438-372X","authenticated-orcid":false,"given":"Hussein","family":"Amro","sequence":"first","affiliation":[{"name":"Department of Computer Science, American University of Beirut, Beirut, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8630-9807","authenticated-orcid":false,"given":"Basel","family":"Fakhri","sequence":"additional","affiliation":[{"name":"Department of Computer Science, American University of Beirut, Beirut, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2481-4968","authenticated-orcid":false,"given":"Amer E.","family":"Mouawad","sequence":"additional","affiliation":[{"name":"Department of Computer Science, American University of Beirut, Beirut, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3356-6898","authenticated-orcid":false,"given":"Izzat El","family":"Hajj","sequence":"additional","affiliation":[{"name":"Department of Computer Science, American University of Beirut, Beirut, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/81.895327"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.6.820"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.26756\/th.2013.26"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2018.00008"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00028"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460359"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3605573.3605653"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23397-5_42"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3067053"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/PACT58117.2023.00022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3524059.3532382"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3205289.3205291"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34223-4_45"},{"key":"ref15","article-title":"Targeted branching for the maximum independent set problem","author":"Hespe","year":"2021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1552285.1552286"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"ref18","volume-title":"Programming Massively Parallel Processors: A Hands-On Approach","author":"Hwu","year":"2022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.03.026"},{"key":"ref20","first-page":"4292","article-title":"The network data repository with interactive graph analytics and visualization","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Rossi","year":"2015"},{"key":"ref21","first-page":"25:1","article-title":"The PACE 2019 parameterized algorithms and computational experiments challenge: The fourth iteration","volume-title":"Proc. 14th Int. Symp. Parameterized Exact Computation","volume":"148","author":"Dzulfikar","year":"2019"},{"key":"ref22","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0206038"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90032-5"},{"key":"ref25","article-title":"Finding a maximum independent set in time ${O}(2^{n\/4})$O(2n\/4)","author":"Robson","year":"2001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.06.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-017-0115-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00213-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46784-X_30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200007)35:4<253::AID-NET3>3.0.CO;2-K"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56686-4_38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/0222038"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.026"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976229.1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.023"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1214-1"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.07.006"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1063\/1.4897834"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3291525"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CANDAR51075.2020.00012"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3721145.3730416"},{"key":"ref43","article-title":"Maximum independent set algorithms on the GPU","author":"Waldherr","year":"2025"},{"key":"ref44","article-title":"Finding vertex cover: Acceleration via CUDA","author":"Liu","year":"2008"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783716"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.14"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CGO53902.2022.9741284"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3128571"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77220-0_21"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2008.4563095"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145832"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/2717511"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442523"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.117"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3567955.3567963"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3173162.3173180"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW59300.2023.00045"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/71\/11299490\/11313712.pdf?arnumber=11313712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:47:22Z","timestamp":1766602042000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11313712\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":58,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2025.3641049","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}