{"id":"https://openalex.org/W2593190625","doi":"https://doi.org/10.1137/140999980","title":"Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth","display_name":"Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2593190625","doi":"https://doi.org/10.1137/140999980","mag":"2593190625"},"language":"en","primary_location":{"id":"doi:10.1137/140999980","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140999980","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["Department of Informatics, University of Bergen, Norway,"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Norway,","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["Department of Computer Science, University of Warwick, UK,"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, UK,","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000479623","display_name":"Micha\u0142 Pilipczuk","orcid":"https://orcid.org/0000-0001-7891-1988"},"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":"Micha\u0142 Pilipczuk","raw_affiliation_strings":["Institute of Informatics, University of Warsaw, Poland,"],"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Poland,","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences, India,"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, India,","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5038531405"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":null,"apc_paid":null,"fwci":4.5042,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.95283792,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"46","issue":"1","first_page":"161","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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/treewidth","display_name":"Treewidth","score":0.8549787998199463},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8010615110397339},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7275453805923462},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.6811195611953735},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5892289280891418},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5739279389381409},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5627498626708984},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.5477681159973145},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5272811055183411},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48690927028656006},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4526694416999817},{"id":"https://openalex.org/keywords/invariant","display_name":"Invariant (physics)","score":0.44402605295181274},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4201606512069702},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4042109251022339},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3892173171043396},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15717968344688416}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8549787998199463},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8010615110397339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7275453805923462},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.6811195611953735},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5892289280891418},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5739279389381409},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5627498626708984},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.5477681159973145},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5272811055183411},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48690927028656006},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4526694416999817},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.44402605295181274},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4201606512069702},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4042109251022339},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3892173171043396},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15717968344688416},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/140999980","is_oa":false,"landing_page_url":"https://doi.org/10.1137/140999980","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1320941437","display_name":"Parameterized Approximation","funder_award_id":"306992","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G2761285720","display_name":null,"funder_award_id":"FP/2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3981126665","display_name":null,"funder_award_id":"Seventh Framework Programme","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5593277320","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6492145964","display_name":"RIGOROUS THEORY OF PREPROCESSING","funder_award_id":"267959","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320323898","display_name":"Bergens Forskningsstiftelse","ror":"https://ror.org/04efaep75"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1506542774","https://openalex.org/W1974672137","https://openalex.org/W1987968444","https://openalex.org/W1991005941","https://openalex.org/W2005079828","https://openalex.org/W2015110766","https://openalex.org/W2018099718","https://openalex.org/W2035409201","https://openalex.org/W2037713618","https://openalex.org/W2059372025","https://openalex.org/W2064343909","https://openalex.org/W2065139908","https://openalex.org/W2072082202","https://openalex.org/W2087083200","https://openalex.org/W2089527381","https://openalex.org/W2118348286","https://openalex.org/W2135382359","https://openalex.org/W2159366821","https://openalex.org/W2187277772","https://openalex.org/W2616733098"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W6903974","https://openalex.org/W2027388354","https://openalex.org/W1490290385","https://openalex.org/W1539278744","https://openalex.org/W1973972417","https://openalex.org/W2084535634","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W1576158606"],"abstract_inverted_index":{"We":[0,72],"give":[1],"a":[2,8,75,85,110,131],"fixed-parameter":[3,54],"tractable":[4],"algorithm":[5,40,55,63],"that,":[6,83],"given":[7,86],"parameter":[9],"$k$":[10,26,102],"and":[11,31,49,159],"two":[12],"graphs":[13,21],"$G_1,G_2$,":[14],"either":[15,92],"concludes":[16,93],"that":[17,94,113,126],"one":[18],"of":[19,38,97,134,136],"these":[20],"has":[22],"treewidth":[23,96],"at":[24,100],"least":[25,101],"or":[27,103,153],"determines":[28],"whether":[29,148],"$G_1$":[30,158],"$G_2$":[32,160],"are":[33,161],"isomorphic.":[34],"The":[35],"running":[36],"time":[37,82],"the":[39,52,67,95,142,149,154],"on":[41,89],"an":[42,107,120],"$n$-vertex":[43],"graph":[44,87,111],"is":[45,51,99,114],"$2^{\\mathcal{O}(k^5\\log":[46,79],"k)}\\cdot":[47,80],"n^5$,":[48],"this":[50],"first":[53],"for":[56,84,157],"Graph":[57],"Isomorphism":[58],"parameterized":[59],"by":[60],"treewidth.":[61],"Our":[62],"in":[64,78,106],"fact":[65],"solves":[66],"more":[68],"general":[69],"canonization":[70],"problem.":[71],"namely":[73],"design":[74],"procedure":[76],"working":[77],"n^5$":[81],"$G$":[88,98,128,135],"$n$":[90],"vertices,":[91],"(i)":[104],"finds":[105,119],"isomorphic-invariant":[108],"way":[109],"$\\mathfrak{c}(G)$":[112],"isomorphic":[115,151],"to":[116,146],"$G$;":[117],"(ii)":[118],"isomorphism-invariant":[121],"construction":[122,155],"term---an":[123],"algebraic":[124],"expression":[125],"encodes":[127],"together":[129],"with":[130],"tree":[132],"decomposition":[133],"width":[137],"less":[138],"than":[139],"$k$.":[140],"Hence,":[141],"isomorphism":[143],"test":[144],"reduces":[145],"verifying":[147],"computed":[150],"copies":[152],"terms":[156],"equal.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}