{"id":"https://openalex.org/W3005984602","doi":"https://doi.org/10.1137/22m1518943","title":"Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space","display_name":"Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space","publication_year":2023,"publication_date":"2023-07-24","ids":{"openalex":"https://openalex.org/W3005984602","doi":"https://doi.org/10.1137/22m1518943","mag":"3005984602"},"language":"en","primary_location":{"id":"doi:10.1137/22m1518943","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1518943","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/314768594/22m1518943.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I173063890","display_name":"University of Applied Sciences Utrecht","ror":"https://ror.org/028z9kw20","country_code":"NL","type":"education","lineage":["https://openalex.org/I173063890"]},{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"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"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE","NL","PL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Utrecht University, Utrecht, 3584 CC, The Netherlands","\\P Saarland University and Max Planck Institute for Informatics, Saarbr\\\" ucken, 66123, Germany","\\S Eindhoven University of Technology, Eindhoven, 5600 MB, The Netherlands","\\dagger Utrecht University, Utrecht, 3584 CC, The Netherlands","\\ddagger Institute of Informatics, University of Warsaw, Warsaw, 02-097, Poland"],"raw_orcid":"https://orcid.org/0000-0003-1848-0076","affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, 3584 CC, The Netherlands","institution_ids":["https://openalex.org/I173063890","https://openalex.org/I193662353"]},{"raw_affiliation_string":"\\P Saarland University and Max Planck Institute for Informatics, Saarbr\\\" ucken, 66123, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]},{"raw_affiliation_string":"\\S Eindhoven University of Technology, Eindhoven, 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"\\dagger Utrecht University, Utrecht, 3584 CC, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"\\ddagger Institute of Informatics, University of Warsaw, Warsaw, 02-097, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"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, Warsaw, 02-097, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Informatics, University of Warsaw, Warsaw, 02-097, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053202642","display_name":"C\u00e9line M. F. Swennenhuis","orcid":"https://orcid.org/0000-0001-9654-8094"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Celine M. F. Swennenhuis","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, 5600 MB, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-9654-8094","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055238529","display_name":"Karol W\u0119grzycki","orcid":"https://orcid.org/0000-0001-9746-5733"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"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"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]},{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE","NL","PL"],"is_corresponding":false,"raw_author_name":"Karol W\u0119grzycki","raw_affiliation_strings":["Saarland University and Max Planck Institute for Informatics, Saarbr\u00fccken, 66123, Germany","\\P Saarland University and Max Planck Institute for Informatics, Saarbr\\\" ucken, 66123, Germany","\\S Eindhoven University of Technology, Eindhoven, 5600 MB, The Netherlands","\\dagger Utrecht University, Utrecht, 3584 CC, The Netherlands","\\ddagger Institute of Informatics, University of Warsaw, Warsaw, 02-097, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University and Max Planck Institute for Informatics, Saarbr\u00fccken, 66123, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"\\P Saarland University and Max Planck Institute for Informatics, Saarbr\\\" ucken, 66123, Germany","institution_ids":["https://openalex.org/I4210109712","https://openalex.org/I91712215"]},{"raw_affiliation_string":"\\S Eindhoven University of Technology, Eindhoven, 5600 MB, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"\\dagger Utrecht University, Utrecht, 3584 CC, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"\\ddagger Institute of Informatics, University of Warsaw, Warsaw, 02-097, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4261,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60741228,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"37","issue":"3","first_page":"1566","last_page":"1586"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8467055559158325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7965737581253052},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6445144414901733},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.618054211139679},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.602519154548645},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5563626289367676},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5142685770988464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5071635246276855},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48572713136672974},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.47479504346847534},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.24437794089317322},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18297991156578064},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.15579819679260254},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.14837801456451416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14425018429756165}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8467055559158325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7965737581253052},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6445144414901733},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.618054211139679},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.602519154548645},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5563626289367676},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5142685770988464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5071635246276855},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48572713136672974},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.47479504346847534},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.24437794089317322},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18297991156578064},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.15579819679260254},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.14837801456451416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14425018429756165}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/22m1518943","is_oa":false,"landing_page_url":"https://doi.org/10.1137/22m1518943","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/93ef641c-346a-4e6c-8d08-59ef6eca6043","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/93ef641c-346a-4e6c-8d08-59ef6eca6043","pdf_url":"https://pure.tue.nl/ws/files/314768594/22m1518943.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nederlof, J, Pilipczuk, M, Swennenhuis, C M F & Wegrzycki, K 2023, 'Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space', SIAM Journal on Discrete Mathematics, vol. 37, no. 3, pp. 1566-1586. https://doi.org/10.1137/22m1518943","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dspace.library.uu.nl:1874/414807","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/414807","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Part of book"},{"id":"pmh:oai:dspace.library.uu.nl:1874/431586","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/431586","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:pure.tue.nl:openaire/93ef641c-346a-4e6c-8d08-59ef6eca6043","is_oa":true,"landing_page_url":"https://research.tue.nl/files/314768594/22m1518943.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nederlof, J, Pilipczuk, M, Swennenhuis, C M F & Wegrzycki, K 2023, 'Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space', SIAM Journal on Discrete Mathematics, vol. 37, no. 3, pp. 1566-1586. https://doi.org/10.1137/22m1518943","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.tue.nl:publications/93ef641c-346a-4e6c-8d08-59ef6eca6043","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85168758843&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nederlof, J, Pilipczuk, M, Swennenhuis, C M F & Wegrzycki, K 2023, 'Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space', SIAM Journal on Discrete Mathematics, vol. 37, no. 3, pp. 1566-1586. https://doi.org/10.1137/22m1518943","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/93ef641c-346a-4e6c-8d08-59ef6eca6043","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/93ef641c-346a-4e6c-8d08-59ef6eca6043","pdf_url":"https://pure.tue.nl/ws/files/314768594/22m1518943.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nederlof, J, Pilipczuk, M, Swennenhuis, C M F & Wegrzycki, K 2023, 'Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space', SIAM Journal on Discrete Mathematics, vol. 37, no. 3, pp. 1566-1586. https://doi.org/10.1137/22m1518943","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G142022035","display_name":null,"funder_award_id":"853234","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G1533455792","display_name":null,"funder_award_id":"677651","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G2321274833","display_name":null,"funder_award_id":"850979","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G2608529560","display_name":null,"funder_award_id":"850979","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5244030528","display_name":null,"funder_award_id":"714704","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5276803151","display_name":null,"funder_award_id":"948057","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G754337842","display_name":"Advanced Divide and Conquer Strategies for Algorithm Design and Complexity","funder_award_id":"613.009.031b","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320323873","display_name":"Uniwersytet Warszawski","ror":"https://ror.org/039bjqg32"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3005984602.pdf","grobid_xml":"https://content.openalex.org/works/W3005984602.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W118014313","https://openalex.org/W1532942816","https://openalex.org/W1570425181","https://openalex.org/W1981234161","https://openalex.org/W2005079828","https://openalex.org/W2027562075","https://openalex.org/W2048068744","https://openalex.org/W2052210031","https://openalex.org/W2059273723","https://openalex.org/W2116087731","https://openalex.org/W2158584754","https://openalex.org/W2180988813","https://openalex.org/W2525537616","https://openalex.org/W2527679477","https://openalex.org/W2591652165","https://openalex.org/W2610479830","https://openalex.org/W2783306705","https://openalex.org/W2794350243","https://openalex.org/W2854461116","https://openalex.org/W2913867289","https://openalex.org/W2914414140","https://openalex.org/W2923540477","https://openalex.org/W2943672262","https://openalex.org/W2950987206","https://openalex.org/W2962914338","https://openalex.org/W2963390736","https://openalex.org/W2964327191","https://openalex.org/W3000445495","https://openalex.org/W3021494513","https://openalex.org/W3046608358","https://openalex.org/W3139078859","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W4243020994","https://openalex.org/W2155631825","https://openalex.org/W2050734073","https://openalex.org/W2093397072","https://openalex.org/W2602068307","https://openalex.org/W2557802198","https://openalex.org/W1796863810","https://openalex.org/W2066708286","https://openalex.org/W2069133957","https://openalex.org/W3106943288"],"abstract_inverted_index":{"For":[0,81],"many":[1],"algorithmic":[2],"problems":[3,84,140,195],"on":[4,100,241],"graphs":[5,101,121,242],"of":[6,45,62,74,102,122,139,163,176,193,243],"treewidth":[7,103],"t":[8,104],",":[9,66,105],"a":[10,43,136,191,198],"standard":[11,88],"dynamic":[12,89],"programming":[13,90],"approach":[14],"gives":[15,180],"an":[16],"algorithm":[17],"with":[18,85,94,141,182,200,253],"time":[19,60,95,148,184],"and":[20,96,133,149,156,178,186,208,229,237],"space":[21,54,97,118,150,188,239],"complexity":[22,55,61,98,151],"2O(t)\u22c5nO(1)":[23,152],".":[24,153,246],"It":[25],"turns":[26],"out":[27],"that":[28,42,135,220],"when":[29],"one":[30],"considers":[31],"the":[32,40,53,63,70,130,166,174,201,216],"more":[33],"restrictive":[34],"parameter":[35],"treedepth,":[36,177],"it":[37,107,179],"is":[38,69,108],"often":[39],"case":[41],"variation":[44],"this":[46,212],"technique":[47,132,168],"can":[48,144,169],"be":[49,145,170],"used":[50],"to":[51,56,112],"reduce":[52],"polynomial,":[57],"while":[58],"retaining":[59],"form":[64],"2O(d)\u22c5nO(1)":[65,185],"where":[67],"d":[68,245],"treedepth.":[71,124],"This":[72],"transfer":[73],"methodology":[75],"is,":[76],"however,":[77],"far":[78],"from":[79],"automatic.":[80],"instance,":[82],"for":[83,120,161],"connectivity":[86,142],"constraints,":[87],"techniques":[91],"give":[92],"algorithms":[93,119,181,240,248],"2O(tlogt)\u22c5nO(1)":[99],"but":[106],"not":[109],"clear":[110],"how":[111],"convert":[113],"them":[114],"into":[115],"time-efficient":[116],"polynomial":[117,187,238],"low":[123],"Cygan":[125],"et":[126],"al.":[127],"(FOCS\u201911)":[128],"introduced":[129],"Cut&Count":[131,167],"showed":[134,159],"certain":[137],"class":[138],"constraints":[143],"solved":[146],"in":[147,173],"Recently,":[154],"Hegerfeld":[155],"Kratsch":[157],"(STACS\u201920)":[158],"that,":[160],"some":[162],"those":[164],"problems,":[165],"also":[171],"applied":[172],"setting":[175],"running":[183],"usage.":[189],"However,":[190],"number":[192],"important":[194],"eluded":[196],"such":[197],"treatment,":[199],"most":[202],"prominent":[203],"examples":[204],"being":[205],"Hamiltonian":[206,221,223],"Cycle":[207,231],"Longest":[209],"Path.":[210],"In":[211],"paper":[213],"we":[214],"clarify":[215],"situation":[217],"by":[218],"showing":[219],"Cycle,":[222,226],"Path,":[224,228],"Long":[225,227],"Min":[230],"Cover":[232],"all":[233],"admit":[234],"5d\u22c5nO(1)":[235],"-time":[236],"treedepth":[244],"The":[247],"are":[249],"randomized":[250],"Monte":[251],"Carlo":[252],"only":[254],"false":[255],"negatives.":[256]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}