{"id":"https://openalex.org/W7106565095","doi":"https://doi.org/10.1016/j.procs.2025.10.324","title":"Finding subdigraphs in digraphs of bounded directed treewidth","display_name":"Finding subdigraphs in digraphs of bounded directed treewidth","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7106565095","doi":"https://doi.org/10.1016/j.procs.2025.10.324"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.10.324","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.324","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.10.324","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Raul Lopes","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4412460525"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]},{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]}],"countries":["DE","FR"],"is_corresponding":true,"raw_author_name":"Raul Lopes","raw_affiliation_strings":["Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany","LIRMM, Universit\u00e9 de Montpellier, CNRS, Montpellier, France"],"affiliations":[{"raw_affiliation_string":"Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]},{"raw_affiliation_string":"LIRMM, Universit\u00e9 de Montpellier, CNRS, Montpellier, France","institution_ids":["https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ignasi Sau","orcid":null},"institutions":[{"id":"https://openalex.org/I19894307","display_name":"Universit\u00e9 de Montpellier","ror":"https://ror.org/051escj72","country_code":"FR","type":"education","lineage":["https://openalex.org/I19894307"]},{"id":"https://openalex.org/I4210101743","display_name":"Laboratoire d'Informatique, de Robotique et de Micro\u00e9lectronique de Montpellier","ror":"https://ror.org/013yean28","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I151295451","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I4210159245","https://openalex.org/I4412460525"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Ignasi Sau","raw_affiliation_strings":["LIRMM, Universit\u00e9 de Montpellier, CNRS, Montpellier, France"],"affiliations":[{"raw_affiliation_string":"LIRMM, Universit\u00e9 de Montpellier, CNRS, Montpellier, France","institution_ids":["https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I159176309","https://openalex.org/I19894307","https://openalex.org/I4210101743","https://openalex.org/I884043246"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.62635623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"273","issue":null,"first_page":"397","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9226999878883362,"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.9226999878883362,"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.029600000008940697,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.009200000204145908,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/digraph","display_name":"Digraph","score":0.8725000023841858},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8105000257492065},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.656499981880188},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6435999870300293},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.642300009727478},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.39410001039505005}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.8725000023841858},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8105000257492065},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.656499981880188},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6435999870300293},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.642300009727478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5442000031471252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5370000004768372},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48190000653266907},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.39410001039505005},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.36579999327659607},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3564000129699707},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2955000102519989},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.procs.2025.10.324","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.324","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:lirmm-05562576v1","is_oa":true,"landing_page_url":"https://hal-lirmm.ccsd.cnrs.fr/lirmm-05562576","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LAGOS 2025 - XIII Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2025, Buenos aires, Argentina. pp.397-404, ⟨10.1016/j.procs.2025.10.324⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.10.324","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.324","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2008436536","display_name":null,"funder_award_id":"ANR-20-CE48-0008","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2402987151","display_name":null,"funder_award_id":"ANR-20-CE","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3345493962","display_name":null,"funder_award_id":"ANR-20-CE48-000","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G6634687969","display_name":null,"funder_award_id":"ANR-20-CE48-0008-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W770376631","https://openalex.org/W1900846841","https://openalex.org/W2007627758","https://openalex.org/W2028357390","https://openalex.org/W2036740975","https://openalex.org/W2054167510","https://openalex.org/W2059372025","https://openalex.org/W2061597613","https://openalex.org/W2061934263","https://openalex.org/W2114616381","https://openalex.org/W2149379116","https://openalex.org/W2610479830","https://openalex.org/W2963004311","https://openalex.org/W2997334533","https://openalex.org/W3043413734","https://openalex.org/W3082444755","https://openalex.org/W4212790289","https://openalex.org/W4376651369","https://openalex.org/W4404848350"],"related_works":[],"abstract_inverted_index":{"It":[0],"is":[1,74,108],"well":[2,122,149],"known":[3],"that":[4,47,88,118],"directed":[5,56,67,86,97,113,126],"treewidth":[6,68,127],"does":[7],"not":[8],"enjoy":[9],"the":[10,30,52,66,77,85,102,112,115,129,146],"nice":[11],"algorithmic":[12],"properties":[13],"of":[14,32,54,69,95,105,137],"its":[15],"undirected":[16],"counterpart.":[17],"There":[18],"exist,":[19],"however,":[20],"some":[21,59,151],"positive":[22,138],"results":[23,144],"that,":[24,109],"essentially,":[25],"present":[26,134],"XP":[27],"algorithms":[28],"for":[29,153],"problem":[31],"finding,":[33],"in":[34,93,145],"a":[35,40,44,100,135],"given":[36],"digraph":[37,45],"D":[38,70],",":[39],"subdigraph":[41],"isomorphic":[42],"to":[43,75,120,125],"H":[46],"can":[48,89],"be":[49,90],"formed":[50],"by":[51,63],"union":[53],"k":[55,64],"paths":[57],"(with":[58],"extra":[60],"properties),":[61],"parameterized":[62],"and":[65,139],".":[71],"Our":[72],"motivation":[73],"tackle":[76],"following":[78],"question:":[79],"Are":[80],"there":[81],"subdigraphs,":[82],"other":[83,110],"than":[84,111],"paths,":[87,114],"found":[91],"efficiently":[92],"digraphs":[94,117],"bounded":[96],"treewidth?":[98],"In":[99],"nutshell,":[101],"main":[103],"message":[104],"this":[106],"article":[107],"only":[116],"seem":[119],"behave":[121],"with":[123],"respect":[124],"are":[128],"stars.":[130],"For":[131],"this,":[132],"we":[133],"number":[136],"negative":[140],"results,":[141],"generalizing":[142],"several":[143],"literature,":[147],"as":[148,150],"directions":[152],"further":[154],"research.":[155]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-11-25T00:00:00"}