{"id":"https://openalex.org/W2962738632","doi":"https://doi.org/10.1145/3320344","title":"Exact Algorithms for the Maximum Planar Subgraph Problem","display_name":"Exact Algorithms for the Maximum Planar Subgraph Problem","publication_year":2019,"publication_date":"2019-04-25","ids":{"openalex":"https://openalex.org/W2962738632","doi":"https://doi.org/10.1145/3320344","mag":"2962738632"},"language":"en","primary_location":{"id":"doi:10.1145/3320344","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3320344","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/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":["Osnabr\u00fcck University, Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Osnabr\u00fcck University, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063731113","display_name":"Ivo Hedtke","orcid":"https://orcid.org/0000-0003-0335-7825"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ivo Hedtke","raw_affiliation_strings":["Schenker AG, Essen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-0335-7825","affiliations":[{"raw_affiliation_string":"Schenker AG, Essen, Germany","institution_ids":[]}]},{"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":["Osnabr\u00fcck University, Osnabr\u00fcck, Germany"],"raw_orcid":"https://orcid.org/0000-0002-5923-4114","affiliations":[{"raw_affiliation_string":"Osnabr\u00fcck University, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11053119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9991999864578247,"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.9969000220298767,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9932000041007996,"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/planarity-testing","display_name":"Planarity testing","score":0.9395432472229004},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6491727828979492},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.623460590839386},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6216169595718384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5828947424888611},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5398539304733276},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5248672366142273},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.4919690787792206},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4788348972797394},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.47577348351478577},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4720367193222046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4490922689437866},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4225251078605652},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.421149343252182},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27885398268699646},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07757282257080078}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.9395432472229004},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6491727828979492},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.623460590839386},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6216169595718384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5828947424888611},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5398539304733276},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5248672366142273},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.4919690787792206},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4788348972797394},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.47577348351478577},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4720367193222046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4490922689437866},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4225251078605652},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.421149343252182},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27885398268699646},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07757282257080078},{"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/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3320344","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3320344","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6675309310","display_name":null,"funder_award_id":"CH 897/2-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W27464104","https://openalex.org/W114965580","https://openalex.org/W124060458","https://openalex.org/W129287158","https://openalex.org/W174566906","https://openalex.org/W634834491","https://openalex.org/W968309248","https://openalex.org/W1482113038","https://openalex.org/W1482532598","https://openalex.org/W1490332542","https://openalex.org/W1535967299","https://openalex.org/W1550469572","https://openalex.org/W1550834367","https://openalex.org/W1564988587","https://openalex.org/W1595830044","https://openalex.org/W1598585423","https://openalex.org/W1601296025","https://openalex.org/W1908738628","https://openalex.org/W1976060438","https://openalex.org/W1979740931","https://openalex.org/W1981470489","https://openalex.org/W1989666671","https://openalex.org/W1990809754","https://openalex.org/W1997298427","https://openalex.org/W1997409776","https://openalex.org/W2002723731","https://openalex.org/W2003965618","https://openalex.org/W2004677209","https://openalex.org/W2005080287","https://openalex.org/W2009582911","https://openalex.org/W2011039300","https://openalex.org/W2013148843","https://openalex.org/W2015924510","https://openalex.org/W2020015381","https://openalex.org/W2035471954","https://openalex.org/W2037121654","https://openalex.org/W2038610533","https://openalex.org/W2043664398","https://openalex.org/W2048361468","https://openalex.org/W2052400534","https://openalex.org/W2075838454","https://openalex.org/W2078391137","https://openalex.org/W2081599503","https://openalex.org/W2083176195","https://openalex.org/W2085124875","https://openalex.org/W2089070935","https://openalex.org/W2090282626","https://openalex.org/W2114049268","https://openalex.org/W2121655825","https://openalex.org/W2171261902","https://openalex.org/W2284110704","https://openalex.org/W2325654786","https://openalex.org/W2408539216","https://openalex.org/W2493461980","https://openalex.org/W2507175560","https://openalex.org/W2625058834","https://openalex.org/W2916974679","https://openalex.org/W2948574111","https://openalex.org/W2973550843","https://openalex.org/W2998102832","https://openalex.org/W2999957995","https://openalex.org/W4226015859","https://openalex.org/W4242583213","https://openalex.org/W4389615669"],"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/W2015924510","https://openalex.org/W2084592635","https://openalex.org/W2948574111","https://openalex.org/W2962738632","https://openalex.org/W2255102592"],"abstract_inverted_index":{"Given":[0],"a":[1,13,46],"graph":[2],"G":[3,17],",":[4],"the":[5,19],"NP-hard":[6],"Maximum":[7],"Planar":[8],"Subgraph":[9],"problem":[10,49],"asks":[11],"for":[12],"planar":[14,64],"subgraph":[15],"of":[16,22,56],"with":[18],"maximum":[20,63],"number":[21],"edges.":[23],"The":[24],"only":[25],"known":[26],"non-trivial":[27],"exact":[28],"algorithm":[29],"utilizes":[30],"Kuratowski\u2019s":[31],"famous":[32],"planarity":[33,57],"criterion":[34],"and":[35,72,79],"can":[36],"be":[37],"formulated":[38],"as":[39],"an":[40],"integer":[41],"linear":[42],"program":[43],"(ILP)":[44],"or":[45],"pseudo-Boolean":[47],"satisfiability":[48],"(PBS).":[50],"We":[51],"examine":[52],"three":[53],"alternative":[54],"characterizations":[55],"regarding":[58],"their":[59,81],"applicability":[60],"to":[61],"model":[62],"subgraphs.":[65],"For":[66],"each,":[67],"we":[68],"consider":[69],"both":[70],"ILP":[71],"PBS":[73],"variants,":[74],"investigate":[75],"diverse":[76],"formulation":[77],"aspects,":[78],"evaluate":[80],"practical":[82],"performance.":[83]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}