{"id":"https://openalex.org/W2952915478","doi":"https://doi.org/10.1007/s00453-018-0408-7","title":"Parameterized Complexity of Length-bounded Cuts and Multicuts","display_name":"Parameterized Complexity of Length-bounded Cuts and Multicuts","publication_year":2018,"publication_date":"2018-01-22","ids":{"openalex":"https://openalex.org/W2952915478","doi":"https://doi.org/10.1007/s00453-018-0408-7","mag":"2952915478"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-018-0408-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0408-7","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084130815","display_name":"Pavel Dvo\u0159\u00e1k","orcid":"https://orcid.org/0000-0002-6838-1538"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Pavel Dvo\u0159\u00e1k","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University, Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00, Prague 1, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00, Prague 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"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/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Du\u0161an Knop","raw_affiliation_strings":["Faculty of Mathematics and Physics, Charles University, Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00, Prague 1, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Physics, Charles University, Prague, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00, Prague 1, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5084130815"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.2824,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.83282186,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"80","issue":"12","first_page":"3597","last_page":"3617"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.989300012588501,"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.9696999788284302,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8683428764343262},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7607035636901855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7040599584579468},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6720841526985168},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.513020932674408},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5002954006195068},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48827624320983887},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4661484956741333},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.46451133489608765},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46270751953125},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4471646547317505},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41845622658729553},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3803529441356659},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1799525022506714},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13825678825378418},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09315952658653259},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06829646229743958}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8683428764343262},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7607035636901855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7040599584579468},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6720841526985168},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.513020932674408},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5002954006195068},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48827624320983887},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4661484956741333},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.46451133489608765},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46270751953125},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4471646547317505},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41845622658729553},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3803529441356659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1799525022506714},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13825678825378418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09315952658653259},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06829646229743958},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-018-0408-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-018-0408-7","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1859893626","display_name":null,"funder_award_id":"1784214","funder_id":"https://openalex.org/F4320309872","funder_display_name":"Grantov\u00e1 Agentura, Univerzita Karlova"},{"id":"https://openalex.org/G2238376495","display_name":null,"funder_award_id":"Kontakt LH12095","funder_id":"https://openalex.org/F4320321005","funder_display_name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy"},{"id":"https://openalex.org/G4329262146","display_name":null,"funder_award_id":"616787","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G7376146240","display_name":null,"funder_award_id":"SVV-2016- 260332","funder_id":"https://openalex.org/F4320309872","funder_display_name":"Grantov\u00e1 Agentura, Univerzita Karlova"},{"id":"https://openalex.org/G7563668413","display_name":null,"funder_award_id":"CE-ITI P202/12/G061","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320309872","display_name":"Grantov\u00e1 Agentura, Univerzita Karlova","ror":"https://ror.org/024d6js02"},{"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/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W1500603002","https://openalex.org/W1901935697","https://openalex.org/W1983383464","https://openalex.org/W1987580556","https://openalex.org/W2000733920","https://openalex.org/W2006877095","https://openalex.org/W2007572995","https://openalex.org/W2025838844","https://openalex.org/W2050719228","https://openalex.org/W2052210031","https://openalex.org/W2072947773","https://openalex.org/W2104734478","https://openalex.org/W2107284348","https://openalex.org/W2262201633","https://openalex.org/W2401216365","https://openalex.org/W2914414140","https://openalex.org/W2963972833","https://openalex.org/W4213060883","https://openalex.org/W4213368513","https://openalex.org/W4231512181","https://openalex.org/W4253175698"],"related_works":["https://openalex.org/W1986447712","https://openalex.org/W2075531723","https://openalex.org/W2113684989","https://openalex.org/W2110193191","https://openalex.org/W4389814085","https://openalex.org/W1531868704","https://openalex.org/W4285659194","https://openalex.org/W2039168577","https://openalex.org/W3048010228","https://openalex.org/W3031065515"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}