{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:51:29Z","timestamp":1725907889555},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662557501"},{"type":"electronic","value":"9783662557518"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55751-8_9","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:32:49Z","timestamp":1502796769000},"page":"96-110","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized Aspects of Triangle Enumeration"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Till","family":"Fluschnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V.: Popular conjectures imply strong lower bounds for dynamic problems. In: Proceedings of the 55th FOCS, pp. 434\u2013443. IEEE Computer Society (2014)","DOI":"10.1109\/FOCS.2014.53"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Abboud, A., Williams, V.V., Wang, J.R.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the 27th SODA, pp. 377\u2013391. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch28"},{"issue":"4","key":"9_CR3","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1137\/S0097539796305109","volume":"27","author":"R Bar-Yehuda","year":"1998","unstructured":"Bar-Yehuda, R., Geiger, D., Naor, J., Roth, R.M.: Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference. SIAM J. Comput. 27(4), 942\u2013959 (1998)","journal-title":"SIAM J. Comput."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of the 14th ACM KDD, pp. 16\u201324. ACM (2008)","DOI":"10.1145\/1401890.1401898"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-662-43948-7_19","volume-title":"Automata, Languages, and Programming","author":"A Bj\u00f6rklund","year":"2014","unstructured":"Bj\u00f6rklund, A., Pagh, R., Williams, V.V., Zwick, U.: Listing triangles. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 223\u2013234. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-662-43948-7_19"},{"issue":"4","key":"9_CR6","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1137\/060664690","volume":"22","author":"A Bretscher","year":"2008","unstructured":"Bretscher, A., Corneil, D.G., Habib, M., Paul, C.: A simple linear time LexBFS cograph recognition algorithm. SIAM J. Discret. Math. 22(4), 1277\u20131296 (2008)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"9_CR7","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR8","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR9","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s00224-016-9702-4","volume":"60","author":"N Creignou","year":"2017","unstructured":"Creignou, N., Meier, A., M\u00fcller, J.S., Schmidt, J., Vollmer, H.: Paradigms for parameterized enumeration. Theory Comput. Syst. 60(4), 737\u2013758 (2017)","journal-title":"Theory Comput. Syst."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32589-2_32","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Doucha","year":"2012","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-32589-2_32"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/978-1-4614-6170-8_242","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"E Ferrara","year":"2014","unstructured":"Ferrara, E.: Measurement and analysis of online social networks systems. In: Alhajj, R., Rokne, J. (eds.) Encyclopedia of Social Network Analysis and Mining, pp. 891\u2013893. Springer, New York (2014). doi:\n10.1007\/978-1-4614-6170-8_242"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Fluschnik, T., Komusiewicz, C., Mertzios, G.B., Nichterlein, A., Niedermeier, R., Talmon, N.: When can graph hyperbolicity be computed in linear time? In: Ellen F., Kolokolova A., Sack J.R. (eds.) Proceedings of the 15th WADS. LNCS, vol. 10389, pp. 397\u2013408. Springer, Heidelberg (2017). doi:\n10.1007\/978-3-319-62127-2_34\n\n. ISBN 978-3-319-62126-5","DOI":"10.1007\/978-3-319-62127-2_34"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Pilipczuk, M., Saurabh, S., Wrochna, M.: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. In: Proceedings of the 28th SODA, pp. 1419\u20131432. SIAM (2017)","DOI":"10.1137\/1.9781611974782.92"},{"key":"9_CR14","unstructured":"Giannopoulou, A.C., Mertzios, G.B., Niedermeier, R.: Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs. In: Proceedings of the 10th IPEC, LIPIcs, vol. 43, pp. 102\u2013113. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"9_CR15","doi-asserted-by":"crossref","first-page":"052815","DOI":"10.1103\/PhysRevE.91.052815","volume":"91","author":"C Grabow","year":"2015","unstructured":"Grabow, C., Grosskinsky, S., Kurths, J., Timme, M.: Collective relaxation dynamics of small-world networks. Phys. Rev. E 91, 052815 (2015)","journal-title":"Phys. Rev. E"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Green, O., Bader, D.A.: Faster clustering coefficient using vertex covers. In: Proceedings of the 6th SocialCom, pp. 321\u2013330. IEEE Computer Society (2013)","DOI":"10.1109\/SocialCom.2013.51"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BFb0028546","volume-title":"STACS 1998","author":"M Habib","year":"1998","unstructured":"Habib, M., Paul, C., Viennoti, L.: A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 25\u201338. Springer, Heidelberg (1998). doi:\n10.1007\/BFb0028546"},{"issue":"4","key":"9_CR18","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR19","doi-asserted-by":"crossref","first-page":"22:1","DOI":"10.1145\/2967101","volume":"41","author":"MA Khamis","year":"2016","unstructured":"Khamis, M.A., Ngo, H.Q., R\u00e9, C., Rudra, A.: Joins via geometric resolutions: worst case and beyond. ACM Trans. Database Syst. 41(4), 22:1\u201322:45 (2016)","journal-title":"ACM Trans. Database Syst."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-319-21840-3_39","volume-title":"Algorithms and Data Structures","author":"T Kopelowitz","year":"2015","unstructured":"Kopelowitz, T., Pettie, S., Porat, E.: Dynamic set intersection. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 470\u2013481. Springer, Cham (2015). doi:\n10.1007\/978-3-319-21840-3_39"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Kopelowitz, T., Pettie, S., Porat, E.: Higher lower bounds from the 3SUM conjecture. In: Proceedings of the 27th SODA, pp. 1272\u20131287. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch89"},{"issue":"5","key":"9_CR22","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.1007\/s10618-016-0451-4","volume":"30","author":"S Lagraa","year":"2016","unstructured":"Lagraa, S., Seba, H.: An efficient exact algorithm for triangle listing in large graphs. Data Min. Knowl. Disc. 30(5), 1350\u20131369 (2016)","journal-title":"Data Min. Knowl. Disc."},{"issue":"1\u20133","key":"9_CR23","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1016\/j.tcs.2008.07.017","volume":"407","author":"M Latapy","year":"2008","unstructured":"Latapy, M.: Main-memory triangle computations for very large (sparse (power-law)) graphs. Theor. Comput. Sci. 407(1\u20133), 458\u2013473 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR24","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s00453-015-0084-9","volume":"77","author":"T Lee","year":"2017","unstructured":"Lee, T., Magniez, F., Santha, M.: Improved quantum query algorithms for triangle detection and associativity testing. Algorithmica 77(2), 459\u2013486 (2017)","journal-title":"Algorithmica"},{"issue":"2","key":"9_CR25","doi-asserted-by":"crossref","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":"9_CR26","unstructured":"Mertzios, G.B., Nichterlein, A., Niedermeier, R.: The power of linear-time datareduction for maximum matching. In: Proceedings of the 42nd MFCS, LIPIcs, vol. 83, pp. 46:1\u201346:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"2","key":"9_CR27","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45(2), 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Park, H., Silvestri, F., Kang, U., Pagh, R.: Mapreduce triangle enumeration with guarantees. In: Proceedings of CIKM 2014, pp. 1739\u20131748. ACM (2014)","DOI":"10.1145\/2661829.2662017"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Patrascu, M.: Towards polynomial lower bounds for dynamic problems. In: Proceedings of the 42nd STOC, pp. 603\u2013610. ACM (2010)","DOI":"10.1145\/1806689.1806772"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/11427186_54","volume-title":"Experimental and Efficient Algorithms","author":"T Schank","year":"2005","unstructured":"Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 606\u2013609. Springer, Heidelberg (2005). doi:\n10.1007\/11427186_54"},{"key":"9_CR31","unstructured":"Sorge, M., Weller, M.: The graph parameter hierarchy, TU Berlin (2016). Unpublished Manuscript"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle \n            $$k$$\n          -core motifs within networks. In: Proceedings of the 28th ICDE, pp. 1049\u20131060. IEEE Computer Society (2012)","DOI":"10.1109\/ICDE.2012.35"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55751-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T11:34:51Z","timestamp":1502796891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55751-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662557501","9783662557518"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55751-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}