{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:12:57Z","timestamp":1763968377303},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366827"},{"type":"electronic","value":"9783030366834"}],"license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36683-4_42","type":"book-chapter","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T17:08:15Z","timestamp":1574788095000},"page":"519-531","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Enumerating Isolated Cliques in Temporal Networks"],"prefix":"10.1007","author":[{"given":"Hendrik","family":"Molter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malte","family":"Renken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"issue":"1","key":"42_CR1","first-page":"1.13:1","volume":"24","author":"M Bentert","year":"2019","unstructured":"Bentert, M., Himmel, A.S., Molter, H., Morik, M., Niedermeier, R., Saitenmacher, R.: Listing all maximal $$k$$-plexes in temporal graphs. ACM J. Exp. Algorithm. 24(1), 1.13:1\u20131.13:27 (2019)","journal-title":"ACM J. Exp. Algorithm."},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.disopt.2018.05.002","volume":"30","author":"R Bevern van","year":"2018","unstructured":"van Bevern, R., Fluschnik, T., Mertzios, G.B., Molter, H., Sorge, M., Such\u00fd, O.: The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30, 20\u201350 (2018)","journal-title":"Discret. Optim."},{"issue":"3","key":"42_CR3","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/s00453-016-0222-z","volume":"79","author":"S Chechik","year":"2017","unstructured":"Chechik, S., Johnson, M.P., Parter, M., Peleg, D.: Secluded connectivity problems. Algorithmica 79(3), 708\u2013741 (2017)","journal-title":"Algorithmica"},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2543629","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. ACM J. Exp. Algorithm. 18, 1\u20133 (2013)","journal-title":"ACM J. Exp. Algorithm."},{"issue":"9","key":"42_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0107878","volume":"9","author":"J Fournet","year":"2014","unstructured":"Fournet, J., Barrat, A.: Contact patterns among high school students. PLoS ONE 9(9), 1\u201317 (2014)","journal-title":"PLoS ONE"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1140\/epjds\/s13688-018-0140-1","volume":"7","author":"M G\u00e9nois","year":"2018","unstructured":"G\u00e9nois, M., Barrat, A.: Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci. 7(1), 11 (2018)","journal-title":"EPJ Data Sci."},{"issue":"1","key":"42_CR7","doi-asserted-by":"publisher","first-page":"35:1","DOI":"10.1007\/s13278-017-0455-0","volume":"7","author":"AS Himmel","year":"2017","unstructured":"Himmel, A.S., Molter, H., Niedermeier, R., Sorge, M.: Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs. Soc. Netw. Anal. Min. 7(1), 35:1\u201335:16 (2017)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"3","key":"42_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"52","key":"42_CR9","doi-asserted-by":"publisher","first-page":"5384","DOI":"10.1016\/j.tcs.2009.05.008","volume":"410","author":"F H\u00fcffner","year":"2009","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Isolation concepts for clique enumeration: comparison and computational experiments. Theor. Comput. Sci. 410(52), 5384\u20135397 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"42_CR10","doi-asserted-by":"publisher","first-page":"40:1","DOI":"10.1145\/1597036.1597044","volume":"5","author":"H Ito","year":"2009","unstructured":"Ito, H., Iwama, K.: Enumeration of isolated cliques and pseudo-cliques. ACM Trans. Algorithms 5(4), 40:1\u201340:21 (2009)","journal-title":"ACM Trans. Algorithms"},{"issue":"38\u201340","key":"42_CR11","doi-asserted-by":"publisher","first-page":"3640","DOI":"10.1016\/j.tcs.2009.04.021","volume":"410","author":"C Komusiewicz","year":"2009","unstructured":"Komusiewicz, C., H\u00fcffner, F., Moser, H., Niedermeier, R.: Isolation concepts for efficiently enumerating dense subgraphs. Theor. Comput. Sci. 410(38\u201340), 3640\u20133654 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"42_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s13278-018-0537-7","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy, M., Viard, T., Magnien, C.: Stream graphs and link streams for the modeling of interactions over time. Soc. Netw. Anal. Min. 8(1), 61 (2018)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"4","key":"42_CR13","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail, O.: An introduction to temporal graphs: an algorithmic perspective. Internet Math. 12(4), 239\u2013280 (2016)","journal-title":"Internet Math."},{"issue":"2","key":"42_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Comput. Surv. 51(2), 35 (2018)","journal-title":"ACM Comput. Surv."},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard, T., Latapy, M., Magnien, C.: Computing maximal cliques in link streams. Theor. Comput. Sci. 609, 245\u2013252 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ipl.2018.01.006","volume":"133","author":"T Viard","year":"2018","unstructured":"Viard, T., Magnien, C., Latapy, M.: Enumerating maximal cliques in link streams with durations. Inf. Process. Lett. 133, 44\u201348 (2018)","journal-title":"Inf. Process. Lett."}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36683-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,6]],"date-time":"2021-02-06T13:54:56Z","timestamp":1612619696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36683-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"ISBN":["9783030366827","9783030366834"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36683-4_42","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}