{"id":"https://openalex.org/W2165094933","doi":"https://doi.org/10.1007/s00453-009-9296-1","title":"Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions","display_name":"Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions","publication_year":2009,"publication_date":"2009-03-12","ids":{"openalex":"https://openalex.org/W2165094933","doi":"https://doi.org/10.1007/s00453-009-9296-1","mag":"2165094933"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-009-9296-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9296-1","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/A5027034693","display_name":"Frederic Dorn","orcid":null},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"Frederic Dorn","raw_affiliation_strings":["Department of Informatics, University of Bergen, 5020, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056651388","display_name":"Eelko Penninkx","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Eelko Penninkx","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075328697","display_name":"Fedor V. Fomin","orcid":"https://orcid.org/0000-0003-1955-4612"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Fedor V. Fomin","raw_affiliation_strings":["Department of Informatics, University of Bergen, 5020, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, 5020, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5027034693"],"corresponding_institution_ids":["https://openalex.org/I4432739"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":12.0191,"has_fulltext":false,"cited_by_count":108,"citation_normalized_percentile":{"value":0.99024278,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"58","issue":"3","first_page":"790","last_page":"810"},"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.996399998664856,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/planar-graph","display_name":"Planar graph","score":0.7867756485939026},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7598099708557129},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6680959463119507},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.629105269908905},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6228978037834167},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6176434755325317},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6098010540008545},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5742119550704956},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5092700719833374},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.4145743250846863},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40158283710479736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3784279227256775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22429215908050537}],"concepts":[{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.7867756485939026},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7598099708557129},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6680959463119507},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.629105269908905},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6228978037834167},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6176434755325317},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6098010540008545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5742119550704956},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5092700719833374},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.4145743250846863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40158283710479736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3784279227256775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22429215908050537},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-009-9296-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9296-1","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":[{"id":"https://metadata.un.org/sdg/11","score":0.7699999809265137,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W307896644","https://openalex.org/W1491529421","https://openalex.org/W1506969660","https://openalex.org/W1801598458","https://openalex.org/W1850475437","https://openalex.org/W1930019869","https://openalex.org/W1969186119","https://openalex.org/W1972912363","https://openalex.org/W1982180670","https://openalex.org/W1983156760","https://openalex.org/W1983798870","https://openalex.org/W1999497750","https://openalex.org/W2011039300","https://openalex.org/W2012313040","https://openalex.org/W2019137761","https://openalex.org/W2037995626","https://openalex.org/W2038643780","https://openalex.org/W2042509875","https://openalex.org/W2047871605","https://openalex.org/W2048794017","https://openalex.org/W2052812513","https://openalex.org/W2062254875","https://openalex.org/W2077357506","https://openalex.org/W2085348754","https://openalex.org/W2092904196","https://openalex.org/W2106183852","https://openalex.org/W2108093643","https://openalex.org/W2119044694","https://openalex.org/W2127485201","https://openalex.org/W2158584754","https://openalex.org/W2166658560","https://openalex.org/W2167377888","https://openalex.org/W2913688336","https://openalex.org/W2986773320","https://openalex.org/W4232845306","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W4389615663","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W1618127724","https://openalex.org/W4299647289","https://openalex.org/W2155631825","https://openalex.org/W2952856011","https://openalex.org/W2011032737","https://openalex.org/W2078431586","https://openalex.org/W2069133957","https://openalex.org/W140019436","https://openalex.org/W2259723333"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}