{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:16:48Z","timestamp":1778807808715,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Google Faculty Research Award","award":[""],"award-info":[{"award-number":[""]}]},{"name":"NSF (National Science Foundation)","award":["CNS-2154149,CCF-2129139,Career Award CCF-1651838"],"award-info":[{"award-number":["CNS-2154149,CCF-2129139,Career Award CCF-1651838"]}]},{"name":"Sloan School of Management, Massachusetts Institute of Technology","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Defense Advanced Research Projects Agency","award":["HR00112020023"],"award-info":[{"award-number":["HR00112020023"]}]},{"name":"MIT Akamai Fellowship","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Siebel Scholars Foundation","award":[""],"award-info":[{"award-number":[""]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649663","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"923-934","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7797-3690","authenticated-orcid":false,"given":"Mina","family":"Dalirrooyfard","sequence":"first","affiliation":[{"name":"Morgan Stanley Research, Calgary, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4904-3637","authenticated-orcid":false,"given":"Surya","family":"Mathialagan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4844-2863","authenticated-orcid":false,"given":"Virginia Vassilevska","family":"Williams","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6809-2514","authenticated-orcid":false,"given":"Yinzhan","family":"Xu","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1061771"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188938"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585240"},{"key":"e_1_3_2_1_4_1","unstructured":"Amir Abboud Seri Khoury Oree Leibowitz and Ron Safier. 2022. Listing 4-Cycles. arXiv preprint arXiv:2211.10022."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP). 81:1\u201381:13","author":"Backurs Arturs","year":"2016","unstructured":"Arturs Backurs, Nishanth Dikkala, and Christos Tzamos. 2016. Tight Hardness Results for Maximum Weight Rectangles. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP). 81:1\u201381:13."},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning (ICML). 311\u2013321","author":"Backurs Arturs","year":"2017","unstructured":"Arturs Backurs and Christos Tzamos. 2017. Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms. In Proceedings of the 34th International Conference on Machine Learning (ICML). 311\u2013321."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_19"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517804.3526234"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381878"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM). 12:1\u201312:14","author":"Bringmann Karl","year":"2017","unstructured":"Karl Bringmann and Philip Wellnitz. 2017. Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. In Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM). 12:1\u201312:14."},{"key":"e_1_3_2_1_13_1","volume-title":"Chan and Yinzhan Xu","author":"Timothy","year":"2024","unstructured":"Timothy M. Chan and Yinzhan Xu. 2024. Simpler Reductions from Exact Triangle. In Proceedings of the 2024 SIAM Symposium on Simplicity in Algorithms (SOSA). to appear."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00130"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.009"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0207033"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977936.3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585157"},{"key":"e_1_3_2_1_23_1","volume-title":"Reducibility Among Combinatorial Problems. In Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations. 85\u2013103","author":"Karp Richard M.","year":"1972","unstructured":"Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations. 85\u2013103."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch89"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.017"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.67"},{"key":"e_1_3_2_1_27_1","volume-title":"Virginia Vassilevska Williams, and R. Ryan Williams","author":"Lincoln Andrea","year":"2018","unstructured":"Andrea Lincoln, Virginia Vassilevska Williams, and R. Ryan Williams. 2018. Tight Hardness for Shortest Cycles and Paths in Sparse Graphs. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1236\u20131252."},{"key":"e_1_3_2_1_28_1","first-page":"415","article-title":"On the complexity of the subgraph problem","volume":"26","author":"Ne\u0161et\u0159il Jaroslav","year":"1985","unstructured":"Jaroslav Ne\u0161et\u0159il and Svatopluk Poljak. 1985. On the complexity of the subgraph problem. Comment. Math. Univ. Carol., 26, 2 (1985), 415\u2013419.","journal-title":"Comment. Math. Univ. Carol."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052597"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_54"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00035"},{"key":"e_1_3_2_1_36_1","first-page":"3431","article-title":"On some fine-grained questions in algorithms and complexity","volume":"3","author":"Williams Virginia Vassilevska","year":"2018","unstructured":"Virginia Vassilevska Williams. 2018. On some fine-grained questions in algorithms and complexity. In Proceedings of the ICM. 3, 3431\u20133472.","journal-title":"Proceedings of the ICM."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00078"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.134"}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","location":"Vancouver BC Canada","acronym":"STOC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649663","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649663"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":37,"alternative-id":["10.1145\/3618260.3649663","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649663","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}