{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T19:16:57Z","timestamp":1769800617863,"version":"3.49.0"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"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,12,14]]},"DOI":"10.1109\/comcomap68359.2025.11353181","type":"proceedings-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:19:25Z","timestamp":1769721565000},"page":"64-70","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic-Guided Iterative Compression for Efficient Graph Bipartization"],"prefix":"10.1109","author":[{"given":"Mahsa","family":"Sadeghi","sequence":"first","affiliation":[{"name":"University of Winnipeg,Applied Computer Science,Winnipeg,Canada"}]},{"given":"Yangjun","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Winnipeg,Applied Computer Science,Winnipeg,Canada"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Stanford large network dataset collection (snap)"},{"key":"ref2","first-page":"69","article-title":"A linear kernel for odd cycle transversal","volume":"851","author":"Agrawal","year":"2021","journal-title":"Theoretical Computer Science"},{"key":"ref3","article-title":"Parameterized heuristics for feedback vertex set","volume-title":"Proceedings of the 30th Annual European Symposium on Algorithms (ESA)","author":"Bergougnoux"},{"key":"ref4","first-page":"1","article-title":"Heuristic-based data reduction for odd cycle transversal","volume":"282","author":"Binkele-Raible","year":"2020","journal-title":"Discrete Applied Mathematics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3467968"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00177"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2019.11.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.10.009"},{"key":"ref10","first-page":"4374","article-title":"A sat-based approach for odd cycle transversal in graphs","volume-title":"Proceedings of the 37th AAAI Conference on Artificial Intelligence","author":"Wu"}],"event":{"name":"2025 Computing, Communications and IoT Applications (ComComAp)","location":"Madrid, Spain","start":{"date-parts":[[2025,12,14]]},"end":{"date-parts":[[2025,12,17]]}},"container-title":["2025 Computing, Communications and IoT Applications (ComComAp)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11353105\/11353106\/11353181.pdf?arnumber=11353181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T07:29:09Z","timestamp":1769758149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11353181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,14]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/comcomap68359.2025.11353181","relation":{},"subject":[],"published":{"date-parts":[[2025,12,14]]}}}