{"id":"https://openalex.org/W3110485412","doi":"https://doi.org/10.1016/j.tcs.2020.11.047","title":"How to compute digraph width measures on directed co-graphs","display_name":"How to compute digraph width measures on directed co-graphs","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3110485412","doi":"https://doi.org/10.1016/j.tcs.2020.11.047","mag":"3110485412"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2020.11.047","doi":"https://doi.org/10.1016/j.tcs.2020.11.047","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2020.11.047","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.1016/j.tcs.2020.11.047","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031299024","display_name":"Frank Gurski","orcid":"https://orcid.org/0000-0002-1212-1796","observed_orcids":["https://orcid.org/0000-0002-1212-1796"]},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Gurski","raw_affiliation_strings":["Heinrich Heine University, Institute of Computer Science, Algorithmics for Hard Problems Group, 40225 D\u00fcsseldorf, Germany"],"raw_orcid":"https://orcid.org/0000-0002-1212-1796","affiliations":[{"raw_affiliation_string":"Heinrich Heine University, Institute of Computer Science, Algorithmics for Hard Problems Group, 40225 D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001983447","display_name":"Dominique Komander","orcid":"https://orcid.org/0000-0001-6990-5164","observed_orcids":["https://orcid.org/0000-0001-6990-5164"]},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dominique Komander","raw_affiliation_strings":["Heinrich Heine University, Institute of Computer Science, Algorithmics for Hard Problems Group, 40225 D\u00fcsseldorf, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heinrich Heine University, Institute of Computer Science, Algorithmics for Hard Problems Group, 40225 D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061111704","display_name":"Carolin Rehs","orcid":"https://orcid.org/0000-0002-8788-1028","observed_orcids":["https://orcid.org/0000-0002-8788-1028"]},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carolin Rehs","raw_affiliation_strings":["Heinrich Heine University, Institute of Computer Science, Algorithmics for Hard Problems Group, 40225 D\u00fcsseldorf, Germany"],"raw_orcid":"https://orcid.org/0000-0002-8788-1028","affiliations":[{"raw_affiliation_string":"Heinrich Heine University, Institute of Computer Science, Algorithmics for Hard Problems Group, 40225 D\u00fcsseldorf, Germany","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031299024"],"corresponding_institution_ids":["https://openalex.org/I44260953"],"apc_list":{"value":1700,"currency":"USD","value_usd":1700},"apc_paid":null,"fwci":0.8379,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73751413,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"855","issue":null,"first_page":"161","last_page":"185"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"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/T11567","display_name":"semigroups and automata theory","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-feedback-vertex-set","display_name":"directed feedback vertex set","score":0.8830000162124634},{"id":"https://openalex.org/keywords/cycle-rank","display_name":"cycle rank","score":0.9850000143051147},{"id":"https://openalex.org/keywords/linear-time-computation","display_name":"linear-time computation","score":0.7760000228881836},{"id":"https://openalex.org/keywords/graph-composition","display_name":"graph composition","score":0.5839999914169312},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"disjoint union","score":0.7440000176429749},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8059999942779541}],"concepts":[{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.899807333946228},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.7963405847549438},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.7577875852584839},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7449092268943787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7069121599197388},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.67369145154953},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5362178087234497},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49897122383117676},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44672664999961853},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.434734046459198},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4277687966823578},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.4189327657222748},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.410122811794281},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2529817819595337},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17187979817390442},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.tcs.2020.11.047","doi":"https://doi.org/10.1016/j.tcs.2020.11.047","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2020.11.047","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2020.11.047","doi":"https://doi.org/10.1016/j.tcs.2020.11.047","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2020.11.047","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-b","cwts-core","dongbi-c","jufo-2","ki-jl-2","norway-2","poland-100","russia-white-list-3","vabb-shw"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G7766478702","display_name":"Analyse von Graphparametern f\u00fcr gerichtete Graphen","funder_award_id":"388221852","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":74,"referenced_works":["https://openalex.org/W75009678","https://openalex.org/W135557522","https://openalex.org/W1487444734","https://openalex.org/W1546553618","https://openalex.org/W1548164611","https://openalex.org/W1549231754","https://openalex.org/W1563008855","https://openalex.org/W1578113210","https://openalex.org/W1819685437","https://openalex.org/W1900846841","https://openalex.org/W1963961865","https://openalex.org/W1976676758","https://openalex.org/W1986058515","https://openalex.org/W1989886714","https://openalex.org/W1991755800","https://openalex.org/W1993328543","https://openalex.org/W2007627758","https://openalex.org/W2012154006","https://openalex.org/W2028775537","https://openalex.org/W2029448190","https://openalex.org/W2029643356","https://openalex.org/W2034501206","https://openalex.org/W2052101592","https://openalex.org/W2052210031","https://openalex.org/W2054167510","https://openalex.org/W2055745794","https://openalex.org/W2059372025","https://openalex.org/W2066356146","https://openalex.org/W2067016370","https://openalex.org/W2076322499","https://openalex.org/W2085550081","https://openalex.org/W2087083200","https://openalex.org/W2090787331","https://openalex.org/W2091208300","https://openalex.org/W2095917812","https://openalex.org/W2101400962","https://openalex.org/W2116087731","https://openalex.org/W2118722432","https://openalex.org/W2124568589","https://openalex.org/W2127618440","https://openalex.org/W2141124297","https://openalex.org/W2143561549","https://openalex.org/W2146463098","https://openalex.org/W2157137597","https://openalex.org/W2171760878","https://openalex.org/W2195002222","https://openalex.org/W2249757977","https://openalex.org/W2294558945","https://openalex.org/W2344397418","https://openalex.org/W2401610261","https://openalex.org/W2462139357","https://openalex.org/W2486684896","https://openalex.org/W2593877318","https://openalex.org/W2603178913","https://openalex.org/W2617926292","https://openalex.org/W2730491200","https://openalex.org/W2799178056","https://openalex.org/W2810018852","https://openalex.org/W2901898571","https://openalex.org/W2909119306","https://openalex.org/W2929306367","https://openalex.org/W2947679257","https://openalex.org/W2964025853","https://openalex.org/W2966002898","https://openalex.org/W2993209161","https://openalex.org/W3004208184","https://openalex.org/W3037635610","https://openalex.org/W3083761353","https://openalex.org/W3088600614","https://openalex.org/W4235239597","https://openalex.org/W4254852668","https://openalex.org/W4255005259","https://openalex.org/W6641335539","https://openalex.org/W6815833212"],"related_works":["https://openalex.org/W2966002898","https://openalex.org/W2808661700","https://openalex.org/W2810018852","https://openalex.org/W7099069432","https://openalex.org/W4206381755","https://openalex.org/W1900846841","https://openalex.org/W2118722432","https://openalex.org/W2904146019","https://openalex.org/W2163940503","https://openalex.org/W7097810350"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2020-12-07T00:00:00"}
