{"id":"https://openalex.org/W2963965405","doi":"https://doi.org/10.1145/3125500","title":"Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time","display_name":"Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time","publication_year":2017,"publication_date":"2017-09-19","ids":{"openalex":"https://openalex.org/W2963965405","doi":"https://doi.org/10.1145/3125500","mag":"2963965405"},"language":"en","primary_location":{"id":"doi:10.1145/3125500","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3125500","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038787166","display_name":"Andreas Bj\u00f6rklund","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Andreas Bj\u00f6rklund","raw_affiliation_strings":["Department of Computer Science, Lund University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Lund University, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055721632","display_name":"Petteri Kaski","orcid":"https://orcid.org/0009-0002-3069-7753"},"institutions":[{"id":"https://openalex.org/I32943570","display_name":"Helsinki Institute for Information Technology","ror":"https://ror.org/05kph4940","country_code":"FI","type":"facility","lineage":["https://openalex.org/I133731052","https://openalex.org/I32943570","https://openalex.org/I9927081"]},{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Petteri Kaski","raw_affiliation_strings":["Helsinki Institute for Information Technology HIIT, Department of Information and Computer Science, Aalto University, Finland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki Institute for Information Technology HIIT, Department of Information and Computer Science, Aalto University, Finland","institution_ids":["https://openalex.org/I32943570","https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084157220","display_name":"\u0141ukasz Kowalik","orcid":"https://orcid.org/0000-0002-7546-2969"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"\u0141ukasz Kowalik","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4249,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68010187,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"13","issue":"4","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8188666701316833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7043796181678772},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5949558019638062},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5347076654434204},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.5230725407600403},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.521190345287323},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5059797167778015},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.497297078371048},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4887254238128662},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48233339190483093},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4503827691078186},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3691040873527527}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8188666701316833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7043796181678772},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5949558019638062},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5347076654434204},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.5230725407600403},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.521190345287323},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5059797167778015},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.497297078371048},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4887254238128662},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48233339190483093},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4503827691078186},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3691040873527527},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3125500","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3125500","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:8b7e597d-4762-493d-82a1-d47792a53120","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/8b7e597d-4762-493d-82a1-d47792a53120","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1549-6325","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7183736128","display_name":null,"funder_award_id":"252083, 256287, and 283437","funder_id":"https://openalex.org/F4320321108","funder_display_name":"Academy of Finland"},{"id":"https://openalex.org/G7810330751","display_name":"Exact, exponential-time algorithms","funder_award_id":"2012-04730","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G8033428204","display_name":null,"funder_award_id":"N206 567140 and 2013/09/B/ST6/03136","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320321108","display_name":"Academy of Finland","ror":"https://ror.org/05k73zm37"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W104109059","https://openalex.org/W1503751645","https://openalex.org/W1515898325","https://openalex.org/W1792324772","https://openalex.org/W1967534352","https://openalex.org/W1973113631","https://openalex.org/W1980074516","https://openalex.org/W1985572324","https://openalex.org/W1991858502","https://openalex.org/W1996176003","https://openalex.org/W2005253487","https://openalex.org/W2026416569","https://openalex.org/W2032951732","https://openalex.org/W2038073775","https://openalex.org/W2045492613","https://openalex.org/W2052867211","https://openalex.org/W2065888137","https://openalex.org/W2070188445","https://openalex.org/W2080525033","https://openalex.org/W2089369802","https://openalex.org/W2100239335","https://openalex.org/W2102892751","https://openalex.org/W2114177725","https://openalex.org/W2120248756","https://openalex.org/W2126436716","https://openalex.org/W2137874581","https://openalex.org/W2150123893","https://openalex.org/W2150875823","https://openalex.org/W2242139912","https://openalex.org/W2288712712","https://openalex.org/W2397172610","https://openalex.org/W2610844084","https://openalex.org/W2950663737","https://openalex.org/W2951040528","https://openalex.org/W3160627641","https://openalex.org/W4230989983"],"related_works":["https://openalex.org/W1572263176","https://openalex.org/W2132777284","https://openalex.org/W1999473833","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W3047081115","https://openalex.org/W2565109825"],"abstract_inverted_index":{"Vassilevska":[0],"and":[1,13,47,50,88,102,134,167,195,197],"Williams":[2,48],"(STOC\u201909)":[3],"showed":[4,91],"how":[5],"to":[6,234],"count":[7],"simple":[8],"paths":[9,194],"on":[10,15,164,188],"k":[11,16,27,106,165,171,180],"vertices":[12,166],"matchings":[14],"/2":[17,130],"edges":[18],"in":[19,24,140,172,177],"an":[20,81,136,173,228],"n":[21,26,56,82,97,104,142,174,178],"-vertex":[22,175],"graph":[23,176],"time":[25,141],"/2+":[28,58],"O":[29,59,146,184],"(1)":[30,60,147,185],".":[31],"In":[32],"the":[33,40,126,189,199,237],"same":[34,41],"year,":[35],"two":[36],"different":[37],"algorithms":[38,62,156,192,221],"with":[39],"runtime":[42],"were":[43],"given":[44,74],"by":[45,113],"Koutis":[46],"(ICALP\u201909),":[49],"Bj\u00f6rklund":[51],"et":[52],"al.":[53],"(ESA\u201909),":[54],"via":[55],"st":[57,99,129,144],"-time":[61],"for":[63,148,157,193,208,216],"counting":[64,112,158,209],"t":[65,149,210],"-tuples":[66,211],"of":[67,76,80,152,160,212],"pairwise":[68],"disjoint":[69,213],"sets":[70],"drawn":[71],"from":[72],"a":[73,150,161],"family":[75],"s":[77,214,217],"-sized":[78],"subsets":[79],"-element":[83],"universe.":[84],"Shortly":[85],"afterwards,":[86],"Alon":[87],"Gutner":[89],"(TALG\u201910)":[90],"that":[92,119,125,138,230],"these":[93],"problems":[94],"have":[95],"\u03a9(":[96,103],"\u230a":[98,105],"/2\u230b":[100,107],")":[101,108],"lower":[109,201],"bounds":[110,207],"when":[111],"color":[114],"coding.":[115],"Here,":[116],"we":[117],"show":[118,124,227],"one":[120],"can":[121,131],"do":[122],"better\u2014we":[123],"\u201cmeet-in-the-middle\u201d":[127],"exponent":[128],"be":[132],"beaten":[133],"give":[135,205],"algorithm":[137],"counts":[139],"0.45470382":[143,179],"+":[145,183],"multiple":[151],"three.":[153],"This":[154],"implies":[155],"occurrences":[159],"fixed":[162],"subgraph":[163],"pathwidth":[168],"p":[169,182],"\u226a":[170],"+2":[181],"time,":[186],"improving":[187],"three":[190],"mentioned":[191],"matchings,":[196],"circumventing":[198],"color-coding":[200],"bound.":[202],"We":[203,226],"also":[204],"improved":[206],"-sets":[215],"=":[218],"2,3,4.":[219],"Our":[220],"use":[222],"fast":[223],"matrix":[224],"multiplication.":[225],"argument":[229],"this":[231],"is":[232],"necessary":[233],"go":[235],"below":[236],"meet-in-the-middle":[238],"barrier.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}