{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:59Z","timestamp":1742914259529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_16","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"185-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Small Complete Subgraphs Efficiently"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of 2021 ACM-SIAM Symposium on Discrete Algorithms SODA 2021, Virtual Conference, pp. 522\u2013539. SIAM (2021)","DOI":"10.1137\/1.9781611976465.32"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Even, S.: On approximating a vertex cover for planar graphs. In: Proceedings of 14th ACM Symposium on Theory of Computing (STOC), pp. 303\u2013309 (1982)","DOI":"10.1145\/800070.802205"},{"key":"16_CR4","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). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_19"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","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":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"16_CR7","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"16_CR8","volume-title":"Graph Theory","author":"R Diestel","year":"1997","unstructured":"Diestel, R.: Graph Theory. Springer, New York (1997)"},{"issue":"5","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1137\/15M1054389","volume":"46","author":"T Eden","year":"2017","unstructured":"Eden, T., Levi, A., Ron, D., Seshadhri, C.: Approximately counting triangles in sublinear time. SIAM J. Comput. 46(5), 1603\u20131646 (2017)","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"16_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2004.05.009","volume":"326","author":"F Eisenbrand","year":"2004","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci. 326(1\u20133), 57\u201367 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0020-0190(94)90121-X","volume":"51","author":"D Eppstein","year":"1994","unstructured":"Eppstein, D.: Arboricity and bipartite subgraph listing algorithms. Inf. Process. Lett. 51(4), 207\u2013211 (1994)","journal-title":"Inf. Process. Lett."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Eppstein, D., Goodrich, M.T., Mitzenmacher, M., Torres, M.R.: 2\u20133 cuckoo filters for faster triangle listing and set intersection. In: Proceedings of 36th SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS, pp. 247\u2013260 (2017)","DOI":"10.1145\/3034786.3056115"},{"key":"16_CR13","unstructured":"Harary, F.: Graph Theory, revised. Addison-Wesley, Reading (1972)"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","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."},{"key":"16_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"issue":"3\u20134","key":"16_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett. 74(3\u20134), 115\u2013121 (2000)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"16_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/15427951.2012.625260","volume":"8","author":"M Kolountzakis","year":"2012","unstructured":"Kolountzakis, M., Miller, G., Peng, R., Tsourakakis, C.: Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Math. 8(1\u20132), 161\u2013185 (2012)","journal-title":"Internet Math."},{"key":"16_CR18","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). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_39"},{"issue":"12","key":"16_CR19","doi-asserted-by":"publisher","first-page":"448","DOI":"10.3390\/a15120448","volume":"15","author":"M Kowaluk","year":"2022","unstructured":"Kowaluk, M., Lingas, A.: A multi-dimensional matrix product\u2013a natural tool for parameterized graph algorithms. Algorithms 15(12), 448 (2022)","journal-title":"Algorithms"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Le Gall, F., Urrutia, F.: Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor. In: Proceedings of 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, New Orleans, pp. 1029\u20131046. SIAM (2018)","DOI":"10.1137\/1.9781611975031.67"},{"issue":"5","key":"16_CR21","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: $$k$$-degenerate graphs. Can. J. Math. 22(5), 1082\u20131096 (1970)","journal-title":"Can. J. Math."},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"CSJA Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"issue":"1","key":"16_CR23","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"1","author":"CSJA Nash-Williams","year":"1964","unstructured":"Nash-Williams, C.S.J.A.: Decomposition of finite graphs into forests. J. London Math. Soc. 1(1), 12\u201312 (1964)","journal-title":"J. London Math. Soc."},{"issue":"2","key":"16_CR24","first-page":"415","volume":"26","author":"J Ne\u0161et\u0159il","year":"1985","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Comment. Math. Univ. Carol. 26(2), 415\u2013419 (1985)","journal-title":"Comment. Math. Univ. Carol."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Ortmann, M., Brandes, U.: Triangle listing algorithms: back from the diversion. In: Proceedings of 16th Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, pp. 1\u20138 (2014)","DOI":"10.1137\/1.9781611973198.1"},{"issue":"4\/5","key":"16_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The clique problem for planar graphs. Inf. Process. Lett. 13(4\/5), 131\u2013133 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"16_CR27","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/S0196-8858(02)00037-4","volume":"29","author":"I Rivin","year":"2002","unstructured":"Rivin, I.: Counting cycles and finite dimensional L$${}^{\\text{ p }}$$ norms. Adv. Appl. Math. 29(4), 647\u2013662 (2002)","journal-title":"Adv. Appl. Math."},{"key":"16_CR28","unstructured":"Schank, T.: Algorithmic aspects of triangle-based networks analysis. Ph.D. thesis, Universit\u00e4t Fridericiana zu Karlsruhe (TH) (2007)"},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W Tutte","year":"1961","unstructured":"Tutte, W.: On the problem of decomposing a graph into $$n$$ connected factors. J. Lond. Math. Soc. 36, 221\u2013230 (1961)","journal-title":"J. Lond. Math. Soc."},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"243","DOI":"10.3390\/a7020243","volume":"7","author":"N Zechner","year":"2014","unstructured":"Zechner, N., Lingas, A.: Efficient algorithms for subgraph listing. Algorithms 7(2), 243\u2013252 (2014)","journal-title":"Algorithms"},{"issue":"1","key":"16_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00012","volume":"3","author":"X Zhou","year":"1999","unstructured":"Zhou, X., Nishizeki, T.: Edge-coloring and $$f$$-coloring for various classes of graphs. J. Graph Algorithms Appl. 3(1), 1\u201318 (1999)","journal-title":"J. Graph Algorithms Appl."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34347-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T14:08:06Z","timestamp":1712758086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.04","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.69","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}