{"id":"https://openalex.org/W2408491755","doi":"https://doi.org/10.1145/2885499","title":"LIMITS and Applications of Group Algebras for Parameterized Problems","display_name":"LIMITS and Applications of Group Algebras for Parameterized Problems","publication_year":2016,"publication_date":"2016-05-24","ids":{"openalex":"https://openalex.org/W2408491755","doi":"https://doi.org/10.1145/2885499","mag":"2408491755"},"language":"en","primary_location":{"id":"doi:10.1145/2885499","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2885499","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/A5066131957","display_name":"Ioannis Koutis","orcid":"https://orcid.org/0000-0003-1535-3397"},"institutions":[{"id":"https://openalex.org/I1662191","display_name":"University of Puerto Rico at R\u00edo Piedras","ror":"https://ror.org/0453v4r20","country_code":"PR","type":"education","lineage":["https://openalex.org/I1662191","https://openalex.org/I200399037"]}],"countries":["PR"],"is_corresponding":true,"raw_author_name":"Ioannis Koutis","raw_affiliation_strings":["University of Puerto Rico, Rio Piedras"],"affiliations":[{"raw_affiliation_string":"University of Puerto Rico, Rio Piedras","institution_ids":["https://openalex.org/I1662191"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Williams","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066131957"],"corresponding_institution_ids":["https://openalex.org/I1662191"],"apc_list":null,"apc_paid":null,"fwci":5.2271,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.95706806,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"3","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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.9980999827384949,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8373550176620483},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.7143945693969727},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6731545329093933},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6166466474533081},{"id":"https://openalex.org/keywords/monomial","display_name":"Monomial","score":0.6042119264602661},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5391007661819458},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5385182499885559},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5147183537483215},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5080587863922119},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48288798332214355},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.48216456174850464},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.479383260011673},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45544883608818054},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.4373292326927185},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4257707893848419},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.425611287355423},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3429531157016754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26285994052886963},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.11628404259681702}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8373550176620483},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.7143945693969727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6731545329093933},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6166466474533081},{"id":"https://openalex.org/C11252640","wikidata":"https://www.wikidata.org/wiki/Q243723","display_name":"Monomial","level":2,"score":0.6042119264602661},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5391007661819458},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5385182499885559},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5147183537483215},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5080587863922119},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48288798332214355},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.48216456174850464},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.479383260011673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45544883608818054},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.4373292326927185},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4257707893848419},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.425611287355423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3429531157016754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26285994052886963},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.11628404259681702},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2885499","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2885499","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1503751645","https://openalex.org/W1565660154","https://openalex.org/W1575411448","https://openalex.org/W1577302089","https://openalex.org/W1596578766","https://openalex.org/W1606480398","https://openalex.org/W1799048485","https://openalex.org/W1808823193","https://openalex.org/W1812837484","https://openalex.org/W1852383912","https://openalex.org/W1944877748","https://openalex.org/W1964089073","https://openalex.org/W1970828859","https://openalex.org/W1971216370","https://openalex.org/W2034011726","https://openalex.org/W2049253486","https://openalex.org/W2067814301","https://openalex.org/W2080525033","https://openalex.org/W2083120484","https://openalex.org/W2100239335","https://openalex.org/W2102039892","https://openalex.org/W2107372402","https://openalex.org/W2137874581","https://openalex.org/W2151732151","https://openalex.org/W2166173580","https://openalex.org/W2169262928","https://openalex.org/W2296148711","https://openalex.org/W2340787257","https://openalex.org/W2505201213","https://openalex.org/W2561675875","https://openalex.org/W2737040443","https://openalex.org/W2913688336","https://openalex.org/W3098712039","https://openalex.org/W4255155072","https://openalex.org/W4298425892"],"related_works":["https://openalex.org/W1999178348","https://openalex.org/W4296311369","https://openalex.org/W4318719034","https://openalex.org/W37958683","https://openalex.org/W2396820687","https://openalex.org/W3035010459","https://openalex.org/W3151212431","https://openalex.org/W2011892585","https://openalex.org/W2094567862","https://openalex.org/W2004787924"],"abstract_inverted_index":{"The":[0,30],"fastest":[1,31],"known":[2,32,116],"randomized":[3],"algorithms":[4],"for":[5,34,145],"several":[6],"parameterized":[7],"problems":[8,125],"use":[9,53],"reductions":[10],"to":[11,56,124],"the":[12,46,68,76,121,141,146],"k":[13,24,35,43,86,103],"-M":[14,36],"l":[15,37],"D":[16,38],"problem:":[17],"detection":[18],"of":[19,22,45,75,81,91,137],"multilinear":[20],"monomials":[21],"degree":[23],"in":[25,126],"polynomials":[26],"presented":[27],"as":[28],"circuits.":[29],"algorithm":[33,112],"is":[39,60],"based":[40],"on":[41,85],"2":[42],"evaluations":[44],"circuit":[47],"over":[48],"a":[49,79,82,88,110,135],"suitable":[50],"algebra.":[51],"We":[52,118],"communication":[54],"complexity":[55],"show":[57,133],"that":[58,93,134],"it":[59,138],"essentially":[61],"optimal":[62],"within":[63],"this":[64],"evaluation":[65],"framework.":[66],"On":[67],"positive":[69],"side,":[70],"we":[71,108,132],"give":[72],"additional":[73],"applications":[74],"method:":[77],"finding":[78],"copy":[80],"given":[83],"tree":[84],"nodes,":[87,98],"minimum":[89],"set":[90],"nodes":[92],"dominate":[94],"at":[95],"least":[96],"t":[97],"and":[99],"an":[100],"m":[101],"-dimensional":[102],"-matching.":[104],"In":[105],"each":[106],"case,":[107],"achieve":[109],"faster":[111],"than":[113],"what":[114],"was":[115],"before.":[117],"also":[119],"apply":[120],"algebraic":[122],"method":[123],"exact":[127],"counting.":[128],"Among":[129],"other":[130],"results,":[131],"variation":[136],"can":[139],"break":[140],"trivial":[142],"upper":[143],"bounds":[144],"disjoint":[147],"summation":[148],"problem.":[149]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}