{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T02:19:31Z","timestamp":1773368371984,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319575858","type":"print"},{"value":"9783319575865","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_12","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"128-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Assessing the Computational Complexity of Multi-layer Subgraph Detection"],"prefix":"10.1007","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"12_CR1","unstructured":"Agrawal, A., Lokshtanov, D., Mouawad, A.E., Saurabh, S.: Simultaneous feedback vertex set: a parameterized perspective. In: Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016). LIPIcs, vol. 47, pp. 7:1\u20137:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"key":"12_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-3886-0","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2002","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer, London (2002)","edition":"2"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Berlingerio, M., Coscia, M., Giannotti, F., Monreale, A., Pedreschi, D.: Multidimensional networks: foundations of structural analysis. In: Proceedings of the 22nd International World Wide Web Conference (WWW 2013), vol. 16(5\u20136), pp. 567\u2013593 (2013)","DOI":"10.1007\/s11280-012-0190-4"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","volume":"544","author":"S Boccaletti","year":"2014","unstructured":"Boccaletti, S., Bianconi, G., Criado, R., del Genio, C.I., Gmez-Gardees, J., Romance, M., SendNadal, I., Wang, Z., Zanin, M.: The structure and dynamics of multilayer networks. Phys. Rep. 544(1), 1\u2013122 (2014)","journal-title":"Phys. Rep."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Boden, B., G\u00fcnnemann, S., Hoffmann, H., Seidl, T.: Mining coherent subgraphs in multi-layer graphs with edge labels. In: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2012), pp. 1258\u20131266. ACM Press (2012)","DOI":"10.1145\/2339530.2339726"},{"key":"12_CR6","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, vol. 3. SIAM, Philadelphia (1999)"},{"issue":"1\u20133","key":"12_CR7","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2007.10.048","volume":"393","author":"B Bui-Xuan","year":"2008","unstructured":"Bui-Xuan, B., Habib, M., Paul, C.: Competitive graph searches. Theor. Comput. Sci. 393(1\u20133), 72\u201380 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"12_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-662-44465-8_13","volume-title":"Mathematical Foundations of Computer Science 2014","author":"L Cai","year":"2014","unstructured":"Cai, L., Ye, J.: Dual connectedness of edge-bicolored graphs and beyond. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 141\u2013152. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44465-8_13"},{"key":"12_CR10","unstructured":"Cohen, J.: Trusses: cohesive subgraphs for social network analysis. Technical report, National Security Agency, p. 16 (2008)"},{"key":"12_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)"},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"543","DOI":"10.7155\/jgaa.00273","volume":"16","author":"D Eppstein","year":"2012","unstructured":"Eppstein, D., Spiro, E.S.: The $$h$$-index of a graph and its application to dynamic subgraph statistics. J. Graph Algorithms Appl. 16(2), 543\u2013567 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2008.09.065","volume":"410","author":"MR Fellows","year":"2009","unstructured":"Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53\u201361 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR14","unstructured":"Gai, A.T., Habib, M., Paul, C., Raffinot, M.: Identifying common connected components of graphs. Technical report, RR-LIRMM-03016, LIRMM, Universit\u00e9 de Montpellier II (2003)"},{"key":"12_CR15","volume-title":"Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, Annals of Discrete Mathematics, vol. 57, 2nd edn. Elsevier B. V., Amsterdam (2004)","edition":"2"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1460797.1460799","volume":"2","author":"D Jiang","year":"2009","unstructured":"Jiang, D., Pei, J.: Mining frequent cross-graph quasi-cliques. ACM Trans. Knowl. Discov. Data. 2(4), 16 (2009)","journal-title":"ACM Trans. Knowl. Discov. Data."},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00373-008-0789-5","volume":"24","author":"M Kano","year":"2008","unstructured":"Kano, M., Li, X.: Monochromatic and heterochromatic subgraphs in edge-colored graphs\u2013a survey. Graphs Comb. 24(4), 237\u2013263 (2008)","journal-title":"Graphs Comb."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1016\/S0304-3975(01)00414-5","volume":"289","author":"S Khot","year":"2002","unstructured":"Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2), 997\u20131008 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"12_CR19","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/2854006.2854013","volume":"44","author":"J Kim","year":"2015","unstructured":"Kim, J., Lee, J.: Community detection in multi-layer graphs: a survey. SIGMOD Rec. 44(3), 37\u201348 (2015)","journal-title":"SIGMOD Rec."},{"issue":"3","key":"12_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivel","year":"2014","unstructured":"Kivel, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., Porter, M.A.: Multilayer networks. J. Complex Netw. 2(3), 203\u2013271 (2014)","journal-title":"J. Complex Netw."},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Lin, B.: The parameterized complexity of $$k$$-biclique. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 605\u2013615. SIAM (2015)","DOI":"10.1137\/1.9781611973730.41"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0304-0208(08)73110-4","volume":"109","author":"B Monien","year":"1985","unstructured":"Monien, B.: How to find long paths efficiently. N.-Holl. Math. Stud. 109, 239\u2013254 (1985)","journal-title":"N.-Holl. Math. Stud."},{"issue":"5980","key":"12_CR24","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"PJ Mucha","year":"2010","unstructured":"Mucha, P.J., Richardson, T., Macon, K., Porter, M.A., Onnela, J.P.: Community structure in time-dependent, multiscale, and multiplex networks. Science 328(5980), 876\u2013878 (2010)","journal-title":"Science"},{"issue":"7\u20138","key":"12_CR25","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.disc.2005.11.059","volume":"307","author":"MD Plummer","year":"2007","unstructured":"Plummer, M.D.: Graph factors and factorization: 1985\u20132003: a survey. Discret. Math. 307(7\u20138), 791\u2013821 (2007)","journal-title":"Discret. Math."},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Rossi, L., Musolesi, M., Torsello, A.: On the $$k$$-anonymization of time-varying and multi-layer social graphs. In: Proceedings of the 9th International Conference on Web and Social Media (ICWSM 2015), pp. 377\u2013386. AAAI Press (2015)","DOI":"10.1609\/icwsm.v9i1.14605"},{"issue":"3","key":"12_CR27","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","volume":"5","author":"SB Seidman","year":"1983","unstructured":"Seidman, S.B.: Network structure and minimum degree. Soc. Netw. 5(3), 269\u2013287 (1983)","journal-title":"Soc. Netw."},{"issue":"2","key":"12_CR28","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/1242524.1242530","volume":"32","author":"Z Zeng","year":"2007","unstructured":"Zeng, Z., Wang, J., Zhou, L., Karypis, G.: Out-of-core coherent closed quasi-clique mining from large dense graph databases. ACM Trans. Database Syst. 32(2), 13 (2007)","journal-title":"ACM Trans. Database Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:48:09Z","timestamp":1710341289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}