{"id":"https://openalex.org/W3155023502","doi":"https://doi.org/10.1007/s00453-022-01019-6","title":"Combinatorics and Algorithms for Quasi-Chain Graphs","display_name":"Combinatorics and Algorithms for Quasi-Chain Graphs","publication_year":2022,"publication_date":"2022-08-08","ids":{"openalex":"https://openalex.org/W3155023502","doi":"https://doi.org/10.1007/s00453-022-01019-6","mag":"3155023502"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-01019-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01019-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01019-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01019-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021958252","display_name":"Bogdan Alecu","orcid":"https://orcid.org/0000-0002-5515-9145"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Bogdan Alecu","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062255888","display_name":"Aistis Atminas","orcid":"https://orcid.org/0000-0001-5026-3210"},"institutions":[{"id":"https://openalex.org/I69356397","display_name":"Xi\u2019an Jiaotong-Liverpool University","ror":"https://ror.org/03zmrmn05","country_code":"CN","type":"education","lineage":["https://openalex.org/I69356397"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Aistis Atminas","raw_affiliation_strings":["Department of Mathematical Sciences, Xi\u2019an Jiaotong-Liverpool University, 111 Ren\u2019ai Road, Suzhou, 215123, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Xi\u2019an Jiaotong-Liverpool University, 111 Ren\u2019ai Road, Suzhou, 215123, China","institution_ids":["https://openalex.org/I69356397"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081581015","display_name":"Vadim Lozin","orcid":"https://orcid.org/0000-0003-2464-7389"},"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":true,"raw_author_name":"Vadim Lozin","raw_affiliation_strings":["Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK"],"raw_orcid":"https://orcid.org/0000-0003-2464-7389","affiliations":[{"raw_affiliation_string":"Mathematics Institute, University of Warwick, Coventry, CV4 7AL, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071846174","display_name":"D. S. Malyshev","orcid":"https://orcid.org/0000-0001-7529-8233"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Dmitriy Malyshev","raw_affiliation_strings":["Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Str., Nizhny Novgorod, Russia, 603093"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Technologies for Networks Analysis, National Research University Higher School of Economics, 136 Rodionova Str., Nizhny Novgorod, Russia, 603093","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5081581015"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0137076,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"85","issue":"3","first_page":"642","last_page":"664"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9983000159263611,"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/combinatorics","display_name":"Combinatorics","score":0.6896688342094421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6371564865112305},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6228897571563721},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5962685346603394},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.5347524881362915},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5230944156646729},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4961257874965668},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4885617196559906},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.4792214035987854},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4782944321632385},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4686509966850281},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.46052393317222595},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4360968768596649},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4157334566116333},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3377865254878998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21652913093566895},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16191142797470093},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12279507517814636}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6896688342094421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6371564865112305},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6228897571563721},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5962685346603394},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.5347524881362915},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5230944156646729},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4961257874965668},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4885617196559906},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.4792214035987854},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4782944321632385},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4686509966850281},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.46052393317222595},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4360968768596649},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4157334566116333},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3377865254878998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21652913093566895},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16191142797470093},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12279507517814636},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00453-022-01019-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01019-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01019-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:eprints.whiterose.ac.uk:211810","is_oa":true,"landing_page_url":null,"pdf_url":"https://eprints.whiterose.ac.uk/211810/1/s00453-022-01019-6.pdf","source":{"id":"https://openalex.org/S4306400854","display_name":"White Rose Research Online (University of Leeds, The University of Sheffield, University of York)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800616092","host_organization_name":"White Rose University Consortium","host_organization_lineage":["https://openalex.org/I2800616092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1007/s00453-022-01019-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01019-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01019-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2958834129","display_name":null,"funder_award_id":"21-11-00194","funder_id":"https://openalex.org/F4320324099","funder_display_name":"Russian Science Foundation"},{"id":"https://openalex.org/G8411042292","display_name":null,"funder_award_id":"Grant No. 21-11-00194","funder_id":"https://openalex.org/F4320324099","funder_display_name":"Russian Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320324099","display_name":"Russian Science Foundation","ror":"https://ror.org/03y2gwe85"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3155023502.pdf","grobid_xml":"https://content.openalex.org/works/W3155023502.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W137664942","https://openalex.org/W166539567","https://openalex.org/W1691611448","https://openalex.org/W1925430667","https://openalex.org/W1971790772","https://openalex.org/W1974351233","https://openalex.org/W1997435682","https://openalex.org/W1998456137","https://openalex.org/W2007843697","https://openalex.org/W2017593566","https://openalex.org/W2026563873","https://openalex.org/W2049670817","https://openalex.org/W2052621607","https://openalex.org/W2058460385","https://openalex.org/W2058511514","https://openalex.org/W2059076871","https://openalex.org/W2060963839","https://openalex.org/W2062476001","https://openalex.org/W2067016370","https://openalex.org/W2076508310","https://openalex.org/W2079856162","https://openalex.org/W2083354900","https://openalex.org/W2122172628","https://openalex.org/W2125792811","https://openalex.org/W2132624129","https://openalex.org/W2148043549","https://openalex.org/W2150718242","https://openalex.org/W2167462019","https://openalex.org/W2748096547","https://openalex.org/W2913398500","https://openalex.org/W2992939139","https://openalex.org/W3184216788","https://openalex.org/W4243764894","https://openalex.org/W4248950742"],"related_works":["https://openalex.org/W2898526288","https://openalex.org/W2113292309","https://openalex.org/W1578113210","https://openalex.org/W2607123191","https://openalex.org/W2766499403","https://openalex.org/W4288422263","https://openalex.org/W1971319751","https://openalex.org/W2169699292","https://openalex.org/W2809882961","https://openalex.org/W2046755592"],"abstract_inverted_index":{"Abstract":[0],"The":[1,36],"class":[2,12,18,37,48,91,137],"of":[3,9,13,38,72,83,92,98],"quasi-chain":[4,39,73,99,114,126],"graphs":[5,40,74,127,134],"is":[6,41,49,58,75,111],"an":[7,130],"extension":[8],"the":[10,56,64,70,81,90,106,117],"well-studied":[11],"chain":[14],"graphs.":[15,100,115],"This":[16,101],"latter":[17],"enjoys":[19],"many":[20],"nice":[21],"and":[22,55,95,138],"important":[23],"properties,":[24],"such":[25],"as":[26,78,80],"bounded":[27,60],"clique-width,":[28],"implicit":[29,131],"representation,":[30],"well-quasi-ordering":[31],"by":[32,52,85],"induced":[33,53,107],"subgraphs,":[34,54],"etc.":[35],"substantially":[42],"more":[43],"complex.":[44],"In":[45,63],"particular,":[46,104],"this":[47,136],"not":[50,59],"well-quasi-ordered":[51],"clique-width":[57],"in":[61,103,135],"it.":[62],"present":[65],"paper,":[66],"we":[67,120],"show":[68],"that":[69,105,128,145],"universe":[71,82],"at":[76],"least":[77],"complex":[79],"permutations":[84,94],"establishing":[86],"a":[87,96,122],"bijection":[88],"between":[89],"all":[93],"subclass":[97],"implies,":[102],"subgraph":[108],"isomorphism":[109],"problem":[110],"NP-complete":[112],"for":[113,125,133,141],"On":[116],"other":[118],"hand,":[119],"propose":[121],"decomposition":[123],"theorem":[124],"implies":[129],"representation":[132],"efficient":[139],"solutions":[140],"some":[142],"algorithmic":[143],"problems":[144],"are":[146],"generally":[147],"intractable.":[148]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}