{"id":"https://openalex.org/W3160838608","doi":"https://doi.org/10.1007/978-3-030-75242-2_13","title":"A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs","display_name":"A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3160838608","doi":"https://doi.org/10.1007/978-3-030-75242-2_13","mag":"3160838608"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-75242-2_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-75242-2_13","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/A5012330722","display_name":"Rajesh Chitnis","orcid":"https://orcid.org/0000-0002-6098-7770"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rajesh Chitnis","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, UK"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012330722"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.5453,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65396759,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"187","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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9979000091552734,"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.8125145435333252},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7395467758178711},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6829192638397217},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6372193098068237},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5015163421630859},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49812817573547363},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4980459213256836},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.48766791820526123},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.406649112701416}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8125145435333252},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7395467758178711},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6829192638397217},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6372193098068237},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5015163421630859},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49812817573547363},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4980459213256836},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.48766791820526123},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.406649112701416}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-75242-2_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-75242-2_13","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1733171300","https://openalex.org/W1760079236","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2005079828","https://openalex.org/W2006146932","https://openalex.org/W2017434030","https://openalex.org/W2022459721","https://openalex.org/W2042697932","https://openalex.org/W2050579693","https://openalex.org/W2061597613","https://openalex.org/W2115589427","https://openalex.org/W2297903070","https://openalex.org/W2477674116","https://openalex.org/W2550041253","https://openalex.org/W2569646339","https://openalex.org/W2798588639","https://openalex.org/W2799833205","https://openalex.org/W2914414140","https://openalex.org/W2944399784","https://openalex.org/W2963232826","https://openalex.org/W2963896308","https://openalex.org/W2963908100","https://openalex.org/W2963966355","https://openalex.org/W2964013645","https://openalex.org/W2988480584","https://openalex.org/W2995828778","https://openalex.org/W3035520095","https://openalex.org/W3122423875","https://openalex.org/W6817609399"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W1516574938","https://openalex.org/W2563912921","https://openalex.org/W3190612612"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}