{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:43:02Z","timestamp":1730299382537,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"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":[[2022,9]]},"DOI":"10.1109\/synasc57785.2022.00039","type":"proceedings-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T17:28:54Z","timestamp":1685035734000},"page":"208-211","source":"Crossref","is-referenced-by-count":2,"title":["An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem*"],"prefix":"10.1109","author":[{"given":"Zolt\u00e1n","family":"Tasn\u00e1di","sequence":"first","affiliation":[{"name":"Babeş-Bolyai University,Faculty of Mathematics and Computer Science,Cluj-Napoca,Romania"}]},{"given":"No\u00e9mi","family":"Gask\u00f3","sequence":"additional","affiliation":[{"name":"Babeş-Bolyai University,Faculty of Mathematics and Computer Science,Cluj-Napoca,Romania"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0604-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2019.1595620"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02060482"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.2005.11732724"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2016.0024"},{"key":"ref10","first-page":"721","article-title":"Discovering large dense subgraphs in massive graphs","author":"gibson","year":"2005","journal-title":"Proceedings of the 31st International Conference on Very Large Data Bases"},{"key":"ref21","article-title":"Quadratic convex re-formulation: a computational study of the graph bisection problem","author":"billionnet","year":"2006","journal-title":"tech rep Technical Report RC1003 Conservatoire National des Arts et Métiers Paris"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2018.02.002"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2009.11.002"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21094-5_4"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.12.020"},{"key":"ref19","first-page":"163","article-title":"Aco algorithms for the traveling salesman problem","volume":"4","author":"st\u00fctzle","year":"1999","journal-title":"Evolutionary Algorithms in Engineering and Computer Science"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366818"},{"key":"ref5","article-title":"On the densest k-subgraph problem","author":"feige","year":"1997","journal-title":"CiteSeer"}],"event":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","start":{"date-parts":[[2022,9,12]]},"location":"Hagenberg \/ Linz, Austria","end":{"date-parts":[[2022,9,15]]}},"container-title":["2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10130844\/10130822\/10130855.pdf?arnumber=10130855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T17:45:04Z","timestamp":1687196704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10130855\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/synasc57785.2022.00039","relation":{},"subject":[],"published":{"date-parts":[[2022,9]]}}}