{"id":"https://openalex.org/W2507175560","doi":"https://doi.org/10.1007/978-3-319-50106-2_28","title":"A Note on the Practicality of Maximal Planar Subgraph Algorithms","display_name":"A Note on the Practicality of Maximal Planar Subgraph Algorithms","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2507175560","doi":"https://doi.org/10.1007/978-3-319-50106-2_28","mag":"2507175560"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-50106-2_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-50106-2_28","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":"conference-paper","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/A5044475263","display_name":"Markus Chimani","orcid":"https://orcid.org/0000-0002-4681-5550"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Chimani","raw_affiliation_strings":["University Osnabr\u00fcck, Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Osnabr\u00fcck, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023110492","display_name":"Karsten Klein","orcid":"https://orcid.org/0000-0002-8345-5806"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karsten Klein","raw_affiliation_strings":["Uni Konstanz, Konstanz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Uni Konstanz, Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055002184","display_name":"Tilo Wiedera","orcid":"https://orcid.org/0000-0002-5923-4114"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tilo Wiedera","raw_affiliation_strings":["University Osnabr\u00fcck, Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University Osnabr\u00fcck, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6203,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.59421379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"357","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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.9991000294685364,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7252848744392395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.672848105430603},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6675702333450317},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6269299387931824},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5899936556816101},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5405579805374146},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4912061095237732},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4693772792816162},{"id":"https://openalex.org/keywords/exploratory-analysis","display_name":"Exploratory analysis","score":0.4656181335449219},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.46353769302368164},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4397847056388855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.363180935382843},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35076141357421875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2726033926010132},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2117873728275299},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.0990343689918518}],"concepts":[{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7252848744392395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.672848105430603},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6675702333450317},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6269299387931824},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5899936556816101},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5405579805374146},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4912061095237732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4693772792816162},{"id":"https://openalex.org/C3018260909","wikidata":"https://www.wikidata.org/wiki/Q1322871","display_name":"Exploratory analysis","level":2,"score":0.4656181335449219},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.46353769302368164},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4397847056388855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.363180935382843},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35076141357421875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2726033926010132},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2117873728275299},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0990343689918518},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C2522767166","wikidata":"https://www.wikidata.org/wiki/Q2374463","display_name":"Data science","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-50106-2_28","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-50106-2_28","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"},{"id":"pmh:oai:gdea.informatik.uni-koeln.de:1555","is_oa":false,"landing_page_url":"http://gdea.informatik.uni-koeln.de/1555/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400857","display_name":"Graph Drawing E-print Archive (Die Universit\u00e4t zu K\u00f6ln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:gdea.informatik.uni-koeln.de:1556","is_oa":false,"landing_page_url":"http://gdea.informatik.uni-koeln.de/1556/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400857","display_name":"Graph Drawing E-print Archive (Die Universit\u00e4t zu K\u00f6ln)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W112131548","https://openalex.org/W174566906","https://openalex.org/W1490332542","https://openalex.org/W1535967299","https://openalex.org/W1595830044","https://openalex.org/W1968592790","https://openalex.org/W1976060438","https://openalex.org/W2000109702","https://openalex.org/W2004677209","https://openalex.org/W2005080287","https://openalex.org/W2037121654","https://openalex.org/W2052400534","https://openalex.org/W2078391137","https://openalex.org/W2085124875","https://openalex.org/W2100810364","https://openalex.org/W2121655825","https://openalex.org/W2262426677","https://openalex.org/W2408539216","https://openalex.org/W2537735054"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W231720905","https://openalex.org/W2604893261","https://openalex.org/W2915540008","https://openalex.org/W2361654510","https://openalex.org/W2128390795","https://openalex.org/W1482551403","https://openalex.org/W2255102592","https://openalex.org/W2077912839","https://openalex.org/W2537735054"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-09-16T00:00:00"}