{"id":"https://openalex.org/W1605572092","doi":"https://doi.org/10.1007/978-3-642-11409-0_17","title":"The k-Disjoint Paths Problem on Chordal Graphs","display_name":"The k-Disjoint Paths Problem on Chordal Graphs","publication_year":2009,"publication_date":"2009-12-03","ids":{"openalex":"https://openalex.org/W1605572092","doi":"https://doi.org/10.1007/978-3-642-11409-0_17","mag":"1605572092"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-11409-0_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5078740848","display_name":"Frank Kammer","orcid":"https://orcid.org/0000-0002-2662-3471"},"institutions":[{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]},{"id":"https://openalex.org/I119916105","display_name":"Augsburg University","ror":"https://ror.org/057ewhh68","country_code":"US","type":"education","lineage":["https://openalex.org/I119916105"]}],"countries":["DE","US"],"is_corresponding":true,"raw_author_name":"Frank Kammer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, D-86135, Augsburg, Germany","Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Augsburg, Germany D-86135"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, D-86135, Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Augsburg, Germany D-86135","institution_ids":["https://openalex.org/I119916105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077112807","display_name":"Torsten Tholey","orcid":null},"institutions":[{"id":"https://openalex.org/I119916105","display_name":"Augsburg University","ror":"https://ror.org/057ewhh68","country_code":"US","type":"education","lineage":["https://openalex.org/I119916105"]},{"id":"https://openalex.org/I179225836","display_name":"University of Augsburg","ror":"https://ror.org/03p14d497","country_code":"DE","type":"education","lineage":["https://openalex.org/I179225836"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"Torsten Tholey","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, D-86135, Augsburg, Germany","Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Augsburg, Germany D-86135"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, D-86135, Augsburg, Germany","institution_ids":["https://openalex.org/I179225836"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t Augsburg, Augsburg, Germany D-86135","institution_ids":["https://openalex.org/I119916105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078740848"],"corresponding_institution_ids":["https://openalex.org/I119916105","https://openalex.org/I179225836"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3288,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.62616051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"190","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9976999759674072,"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.9952999949455261,"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/chordal-graph","display_name":"Chordal graph","score":0.8858605623245239},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8559645414352417},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.720302164554596},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.6545597314834595},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6306082606315613},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5770503878593445},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.532784104347229},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.52646404504776},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5190966129302979},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4823443293571472},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4726352095603943},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46483704447746277},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4482715427875519},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43366900086402893},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.41080915927886963},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4020848572254181},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26703786849975586},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.23815631866455078},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20734289288520813},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07353585958480835}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8858605623245239},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8559645414352417},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.720302164554596},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.6545597314834595},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6306082606315613},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5770503878593445},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.532784104347229},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.52646404504776},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5190966129302979},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4823443293571472},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4726352095603943},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46483704447746277},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4482715427875519},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43366900086402893},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.41080915927886963},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4020848572254181},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26703786849975586},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.23815631866455078},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20734289288520813},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07353585958480835},{"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.1007/978-3-642-11409-0_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-11409-0_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1563192285","https://openalex.org/W1586581523","https://openalex.org/W1872961854","https://openalex.org/W1967565181","https://openalex.org/W1972515959","https://openalex.org/W1972937804","https://openalex.org/W1973310391","https://openalex.org/W1976285925","https://openalex.org/W1978452004","https://openalex.org/W2007385106","https://openalex.org/W2052186517","https://openalex.org/W2059563583","https://openalex.org/W2060632898","https://openalex.org/W2060765530","https://openalex.org/W2089465933","https://openalex.org/W2097374444","https://openalex.org/W2339155083","https://openalex.org/W2482935363","https://openalex.org/W2569646339","https://openalex.org/W4210246355"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2029854525","https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2091382007","https://openalex.org/W2584271047","https://openalex.org/W2803227791","https://openalex.org/W143512583","https://openalex.org/W4285428820"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}