{"id":"https://openalex.org/W2996558957","doi":"https://doi.org/10.1145/3368631","title":"Finding Hamiltonian Cycle in Graphs of Bounded Treewidth","display_name":"Finding Hamiltonian Cycle in Graphs of Bounded Treewidth","publication_year":2019,"publication_date":"2019-12-10","ids":{"openalex":"https://openalex.org/W2996558957","doi":"https://doi.org/10.1145/3368631","mag":"2996558957"},"language":"en","primary_location":{"id":"doi:10.1145/3368631","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368631","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","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/A5073730896","display_name":"Micha\u0142 Ziobro","orcid":null},"institutions":[{"id":"https://openalex.org/I126596746","display_name":"Jagiellonian University","ror":"https://ror.org/03bqmcz70","country_code":"PL","type":"education","lineage":["https://openalex.org/I126596746"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Micha\u0142 Ziobro","raw_affiliation_strings":["Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Poland","institution_ids":["https://openalex.org/I126596746"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"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":"Marcin Pilipczuk","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":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8086,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76849898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":null,"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.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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9983999729156494,"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.946527361869812},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.6759641170501709},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5859725475311279},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5604984164237976},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5589848756790161},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5274237394332886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48870328068733215},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4828915596008301},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47074565291404724},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4571222960948944},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.44362160563468933},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4389035701751709},{"id":"https://openalex.org/keywords/clique-width","display_name":"Clique-width","score":0.4237777590751648},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39200812578201294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3616001009941101},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3140544891357422},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11465597152709961}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.946527361869812},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.6759641170501709},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5859725475311279},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5604984164237976},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5589848756790161},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5274237394332886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48870328068733215},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4828915596008301},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47074565291404724},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4571222960948944},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.44362160563468933},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4389035701751709},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.4237777590751648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39200812578201294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3616001009941101},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3140544891357422},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11465597152709961},{"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/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3368631","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3368631","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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 Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1564921898","https://openalex.org/W1579510955","https://openalex.org/W1787126581","https://openalex.org/W1968103577","https://openalex.org/W1969186119","https://openalex.org/W1994661668","https://openalex.org/W2002722727","https://openalex.org/W2059273723","https://openalex.org/W2067500596","https://openalex.org/W2120141762","https://openalex.org/W2126436716","https://openalex.org/W2240262109","https://openalex.org/W2332265223","https://openalex.org/W2610479830","https://openalex.org/W2753005921","https://openalex.org/W2758747189","https://openalex.org/W2794267717","https://openalex.org/W2794350243","https://openalex.org/W2800485060","https://openalex.org/W2803460775","https://openalex.org/W2886839616","https://openalex.org/W2929933319","https://openalex.org/W2962695818","https://openalex.org/W2995414748","https://openalex.org/W2996558957","https://openalex.org/W4210733105","https://openalex.org/W4238913085","https://openalex.org/W4288558705"],"related_works":["https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W2027388354","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W2186377788","https://openalex.org/W4285428820","https://openalex.org/W4388554541","https://openalex.org/W2087911394"],"abstract_inverted_index":{"The":[0],"notion":[1],"of":[2,38,48,72,82,86,94,147,153,155],"treewidth,":[3],"introduced":[4],"by":[5],"Robertson":[6],"and":[7,68],"Seymour":[8],"in":[9,36,80,114,150],"their":[10],"seminal":[11],"Graph":[12],"Minors":[13],"series,":[14],"turned":[15],"out":[16,31],"to":[17,32,121],"have":[18,64,100],"tremendous":[19],"impact":[20],"on":[21,28,111],"graph":[22],"algorithmics.":[23],"Many":[24],"hard":[25],"computational":[26,78],"problems":[27,79,98],"graphs":[29,37,41,81],"turn":[30],"be":[33,44],"efficiently":[34],"solvable":[35],"bounded":[39,49,83],"treewidth:":[40],"that":[42,99],"can":[43],"sweeped":[45],"with":[46],"separators":[47],"size.":[50],"These":[51],"efficient":[52],"algorithms":[53,95],"usually":[54],"follow":[55],"the":[56,87,92,112,115,151,156],"dynamic":[57],"programming":[58],"paradigm.":[59],"In":[60,138],"recent":[61],"years,":[62],"we":[63,141],"seen":[65],"a":[66,143],"rapid":[67],"quite":[69],"unexpected":[70],"development":[71,93],"involved":[73],"techniques":[74],"for":[75,96],"solving":[76],"various":[77],"treewidth.":[84],"One":[85],"most":[88,157],"surprising":[89],"directions":[90],"is":[91],"connectivity":[97,159],"only":[101],"single-exponential":[102],"dependency":[103],"(i.e.,":[104,124],"2":[105,125],"O":[106,126],"(":[107,127],"t":[108,128,130],")":[109,110,131,132],"treewidth":[113],"running":[116],"time":[117],"bound,":[118],"as":[119],"opposed":[120],"slightly":[122],"superexponential":[123],"log":[129],"stemming":[133],"from":[134],"more":[135],"naive":[136],"approaches.":[137],"this":[139],"work,":[140],"perform":[142],"thorough":[144],"experimental":[145],"evaluation":[146],"these":[148],"approaches":[149],"context":[152],"one":[154],"classic":[158],"problems,":[160],"namely,":[161],"H":[162],"AMILTONIAN":[163],"C":[164],"YCLE":[165],".":[166]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}