{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:17:29Z","timestamp":1758874649570,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T00:00:00Z","timestamp":1572739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"name":"Marie Sklodowska-Curie Grant","award":["665501"],"award-info":[{"award-number":["665501"]}]},{"name":"Academy of Finland","award":["286211, 313927, and 317085"],"award-info":[{"award-number":["286211, 313927, and 317085"]}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["G091017N, G0F9816N"],"award-info":[{"award-number":["G091017N, G0F9816N"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"name":"EC H2020","award":["654024"],"award-info":[{"award-number":["654024"]}]},{"name":"ERC FP7\/2007-2013","award":["615517"],"award-info":[{"award-number":["615517"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,3]]},"DOI":"10.1145\/3357384.3357970","type":"proceedings-article","created":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T14:11:35Z","timestamp":1572876695000},"page":"1191-1200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Discovering Interesting Cycles in Directed Graphs"],"prefix":"10.1145","author":[{"given":"Florian","family":"Adriaens","sequence":"first","affiliation":[{"name":"Ghent University, Ghent, Belgium"}]},{"given":"Cigdem","family":"Aslay","sequence":"additional","affiliation":[{"name":"Aalto University, Helsinki, Finland"}]},{"given":"Tijl","family":"De Bie","sequence":"additional","affiliation":[{"name":"Ghent University, Ghent, Belgium"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"Aalto University, Helsinki, Finland"}]},{"given":"Jefrey","family":"Lijffijt","sequence":"additional","affiliation":[{"name":"Ghent University, Ghent, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-019-00627-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"A. Bj\u00f6rklund T. Husfeldt and S. Khanna. 2004. Approximating Longest Directed Paths and Cycles. In Automata Languages and Programming . Springer Berlin.  A. Bj\u00f6rklund T. Husfeldt and S. Khanna. 2004. Approximating Longest Directed Paths and Cycles. In Automata Languages and Programming . Springer Berlin.","DOI":"10.1007\/978-3-540-27836-8_21"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.09.029"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1997.612321"},{"key":"e_1_3_2_1_5_1","first-page":"10","article-title":"Faster Maximum and Minimum Mean Cycle Algorithms for System-performance Analysis","volume":"17","author":"Dasdan A.","year":"2006","journal-title":"TCADICS"},{"volume-title":"Proc. KDD. 564--572","year":"2011","author":"Bie T. De","key":"e_1_3_2_1_6_1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0209-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"J. A. Dunne R. J. Williams and N. D. Martinez. 2002. Network structure and biodiversity loss in food webs: robustness increases with connectance. Ecology letters (2002).  J. A. Dunne R. J. Williams and N. D. Martinez. 2002. Network structure and biodiversity loss in food webs: robustness increases with connectance. Ecology letters (2002).","DOI":"10.1046\/j.1461-0248.2002.00354.x"},{"volume-title":"ACM Symposium on Discrete Algorithms . Society for Industrial and Applied Mathematics.","author":"Gabow H. N.","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","volume-title":"Complex Networks","volume":"5","author":"Giscard P.L.","year":"2017"},{"volume-title":"Dynamic Programming and Markov Processes","author":"Howard R. A.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1086"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90011-0"},{"key":"e_1_3_2_1_15_1","unstructured":"R. Kumar and T. Calders. 2017. Finding simple temporal cycles in an interaction network. In TD-LSG@PKDD\/ECML .  R. Kumar and T. Calders. 2017. Finding simple temporal cycles in an interaction network. In TD-LSG@PKDD\/ECML ."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Y.K. Kwon and K. H. Cho. 2007. Analysis of feedback loops and robustness in network evolution based on Boolean models. BMC bioinformatics (2007).  Y.K. Kwon and K. H. Cho. 2007. Analysis of feedback loops and robustness in network evolution based on Boolean models. BMC bioinformatics (2007).","DOI":"10.1186\/1471-2105-8-430"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5539-3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322048"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00359-4"},{"volume-title":"Proc. KDD . 275--281","author":"Silberschatz A.","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","first-page":"1349","article-title":"Approximability of the minimum Steiner cycle problem","volume":"29","author":"Steinov\u00e1 Monika","year":"2010","journal-title":"Computing and Informatics"},{"key":"e_1_3_2_1_23_1","unstructured":".  ."},{"volume-title":"FY 97: The Florida Bay Ecosystem. Report to the United States Geological Service Biological Resources Division.","year":"1998","author":"Ulanowicz R.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210206"}],"event":{"name":"CIKM '19: The 28th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"CIKM '19"},"container-title":["Proceedings of the 28th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357970","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357384.3357970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:04Z","timestamp":1750202584000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357384.3357970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,3]]},"references-count":25,"alternative-id":["10.1145\/3357384.3357970","10.1145\/3357384"],"URL":"https:\/\/doi.org\/10.1145\/3357384.3357970","relation":{},"subject":[],"published":{"date-parts":[[2019,11,3]]},"assertion":[{"value":"2019-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}