{"id":"https://openalex.org/W2957744695","doi":"https://doi.org/10.1007/978-3-030-25005-8_8","title":"Parameterized Complexity of Min-Power Asymmetric Connectivity","display_name":"Parameterized Complexity of Min-Power Asymmetric Connectivity","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2957744695","doi":"https://doi.org/10.1007/978-3-030-25005-8_8","mag":"2957744695"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-25005-8_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-25005-8_8","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/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":true,"raw_author_name":"Matthias Bentert","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014406119","display_name":"Roman Haag","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":"Roman Haag","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034761074","display_name":"Christian Hofer","orcid":"https://orcid.org/0000-0003-1721-4606"},"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":"Christian Hofer","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088434500","display_name":"Tomohiro Koana","orcid":"https://orcid.org/0000-0002-8684-0611"},"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":"Tomohiro Koana","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012560459","display_name":"Andr\u00e9 Nichterlein","orcid":"https://orcid.org/0000-0001-7451-9401"},"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":"Andr\u00e9 Nichterlein","raw_affiliation_strings":["Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Algorithmics and Computational Complexity, Faculty IV, TU Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5086072107"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4905,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64946889,"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":"85","last_page":"96"},"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.998199999332428,"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.9976999759674072,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.7562928795814514},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6227349638938904},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5831387042999268},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5224998593330383},{"id":"https://openalex.org/keywords/strongly-connected-component","display_name":"Strongly connected component","score":0.5013251304626465},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48929283022880554},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4602140188217163},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4493475556373596},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.43731117248535156},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.42911607027053833},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4124497175216675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2866957187652588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27997422218322754},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.23747870326042175}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7562928795814514},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6227349638938904},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5831387042999268},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5224998593330383},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.5013251304626465},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48929283022880554},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4602140188217163},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4493475556373596},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.43731117248535156},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.42911607027053833},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4124497175216675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2866957187652588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27997422218322754},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.23747870326042175},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-25005-8_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-25005-8_8","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":20,"referenced_works":["https://openalex.org/W1522456302","https://openalex.org/W1541256735","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2004706672","https://openalex.org/W2012760542","https://openalex.org/W2034799053","https://openalex.org/W2088273596","https://openalex.org/W2112341077","https://openalex.org/W2116087731","https://openalex.org/W2117768029","https://openalex.org/W2122877877","https://openalex.org/W2125578939","https://openalex.org/W2141434827","https://openalex.org/W2146185076","https://openalex.org/W2158465338","https://openalex.org/W2163123280","https://openalex.org/W2230017674","https://openalex.org/W2624846542","https://openalex.org/W2978192884"],"related_works":["https://openalex.org/W2488129067","https://openalex.org/W2039866832","https://openalex.org/W2014594560","https://openalex.org/W1984251932","https://openalex.org/W2746332120","https://openalex.org/W1992030522","https://openalex.org/W1996575062","https://openalex.org/W4232486927","https://openalex.org/W2039349395","https://openalex.org/W4293456354"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}