{"id":"https://openalex.org/W2979496305","doi":"https://doi.org/10.1016/j.jcss.2021.12.002","title":"Length-bounded cuts: Proper interval graphs and structural parameters","display_name":"Length-bounded cuts: Proper interval graphs and structural parameters","publication_year":2021,"publication_date":"2021-12-17","ids":{"openalex":"https://openalex.org/W2979496305","doi":"https://doi.org/10.1016/j.jcss.2021.12.002","mag":"2979496305"},"language":"en","primary_location":{"id":"doi:10.1016/j.jcss.2021.12.002","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2021.12.002","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0022000021001161/pdf","source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"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":"Journal of Computer and System Sciences","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://www.sciencedirect.com/science/article/pii/S0022000021001161/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086072107","display_name":"Matthias Bentert","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Bentert","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074163053","display_name":"Klaus Heeger","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Klaus Heeger","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073361240","display_name":"Du\u0161an Knop","orcid":"https://orcid.org/0000-0003-2588-5709"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074163053"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":2400,"currency":"USD","value_usd":2400},"apc_paid":{"value":2400,"currency":"USD","value_usd":2400},"fwci":0.5366,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67563304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"126","issue":null,"first_page":"21","last_page":"43"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.995199978351593,"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.9810000061988831,"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/combinatorics","display_name":"Combinatorics","score":0.7575467824935913},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7337415218353271},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7153294086456299},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7115786671638489},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.7057917714118958},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5938162803649902},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5544819831848145},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5014486312866211},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47641146183013916},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.47453272342681885},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.42936885356903076},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4246557056903839},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21161499619483948}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7575467824935913},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7337415218353271},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7153294086456299},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7115786671638489},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.7057917714118958},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5938162803649902},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5544819831848145},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5014486312866211},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47641146183013916},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.47453272342681885},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.42936885356903076},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4246557056903839},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21161499619483948},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.jcss.2021.12.002","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2021.12.002","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0022000021001161/pdf","source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"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":"Journal of Computer and System Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.jcss.2021.12.002","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.jcss.2021.12.002","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0022000021001161/pdf","source":{"id":"https://openalex.org/S141020589","display_name":"Journal of Computer and System Sciences","issn_l":"0022-0000","issn":["0022-0000","1090-2724"],"is_oa":false,"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":"Journal of Computer and System Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1404832668","display_name":null,"funder_award_id":"CZ.02.1.01","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G1935710221","display_name":null,"funder_award_id":"CZ.02.","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G5641063287","display_name":null,"funder_award_id":"CZ.02.1.01","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G6761430300","display_name":null,"funder_award_id":"CZ.02.1.01/0.0","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G718049477","display_name":null,"funder_award_id":"CZ.02.1.01/0.0/0.0/16_019/0000765","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G8056830759","display_name":null,"funder_award_id":"NI 369/19","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"},{"id":"https://openalex.org/F4320321005","display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","ror":"https://ror.org/037n8p820"},{"id":"https://openalex.org/F4320334253","display_name":"Research Center for Informatics, Czech Technical University in Prague","ror":"https://ror.org/02j8d3734"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2979496305.pdf","grobid_xml":"https://content.openalex.org/works/W2979496305.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1547666349","https://openalex.org/W1557598286","https://openalex.org/W1579049696","https://openalex.org/W1913315348","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2002531683","https://openalex.org/W2019637647","https://openalex.org/W2025838844","https://openalex.org/W2026420755","https://openalex.org/W2037968786","https://openalex.org/W2050719228","https://openalex.org/W2051627428","https://openalex.org/W2061513598","https://openalex.org/W2081013866","https://openalex.org/W2129239025","https://openalex.org/W2144452581","https://openalex.org/W2171565779","https://openalex.org/W2262201633","https://openalex.org/W2557667247","https://openalex.org/W2790988318","https://openalex.org/W2884564598","https://openalex.org/W2888538681","https://openalex.org/W2914414140","https://openalex.org/W2952915478","https://openalex.org/W2962863824","https://openalex.org/W2970673587","https://openalex.org/W2988480584","https://openalex.org/W3022472023","https://openalex.org/W4213060883","https://openalex.org/W4231512181","https://openalex.org/W4241397890","https://openalex.org/W6633724248","https://openalex.org/W6768478175","https://openalex.org/W6773168714"],"related_works":["https://openalex.org/W1875643871","https://openalex.org/W2050719228","https://openalex.org/W2542138745","https://openalex.org/W2797680869","https://openalex.org/W2617953066","https://openalex.org/W2235452386","https://openalex.org/W2899088615","https://openalex.org/W4381707841","https://openalex.org/W2964000270","https://openalex.org/W2296180642"],"abstract_inverted_index":{"We":[0,84],"study":[1],"the":[2,76,97,115,123,135],"Length-Bounded":[3,69,106,130],"Cut":[4,70,107,131],"problem":[5],"for":[6,105,114,134],"special":[7],"graph":[8,21,78],"classes":[9],"and":[10,26,28,32,102,119],"from":[11],"a":[12,20,39,72,80,90],"parameterized":[13,108],"complexity":[14],"viewpoint.":[15],"Here,":[16],"we":[17,95,127],"are":[18],"given":[19],"G,":[22],"two":[23],"vertices":[24],"s":[25],"t,":[27],"positive":[29],"integers":[30],"\u03b2":[31,45],"\u03bb.":[33],"The":[34],"task":[35],"is":[36,79,132],"to":[37],"find":[38],"set":[40],"F":[41],"of":[42,51,100,122],"at":[43,53],"most":[44,54],"edges":[46],"such":[47],"that":[48,68,129],"each":[49],"s-t-path":[50],"length":[52],"\u03bb":[55],"in":[56,61],"G":[57],"contains":[58],"some":[59],"edge":[60],"F.":[62],"Bazgan":[63],"et":[64],"al.":[65],"[20]":[66],"conjectured":[67],"admits":[71],"polynomial-time":[73,92],"algorithm":[74],"if":[75],"input":[77,124],"proper":[81],"interval":[82],"graph.":[83,125],"confirm":[85],"this":[86],"conjecture":[87],"by":[88,109,111],"providing":[89],"dynamic-programming-based":[91],"algorithm.":[93],"Moreover,":[94],"strengthen":[96],"W[1]-hardness":[98,113],"result":[99],"Dvo\u0159\u00e1k":[101],"Knop":[103],"[15]":[104],"pathwidth":[110,118],"showing":[112],"combined":[116],"parameter":[117],"maximum":[120],"degree":[121],"Finally,":[126],"prove":[128],"W[1]-hard":[133],"feedback":[136],"vertex":[137],"number.":[138],"Both":[139],"our":[140],"hardness":[141],"results":[142],"complement":[143],"known":[144],"XP":[145],"algorithms.":[146]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-09-04T10:56:28.161419","created_date":"2025-10-10T00:00:00"}