{"id":"https://openalex.org/W7160419687","doi":"https://doi.org/10.7155/jgaa.v30i2.3136","title":"Heuristics for Exact 1-Planarity Testing","display_name":"Heuristics for Exact 1-Planarity Testing","publication_year":2026,"publication_date":"2026-04-29","ids":{"openalex":"https://openalex.org/W7160419687","doi":"https://doi.org/10.7155/jgaa.v30i2.3136"},"language":null,"primary_location":{"id":"doi:10.7155/jgaa.v30i2.3136","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i2.3136","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7155/jgaa.v30i2.3136","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066754403","display_name":"M. Munch","orcid":"https://orcid.org/0000-0002-6997-8774"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Miriam M\u00fcnch","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018354799","display_name":"S D Fink","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simon D. Fink","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042538126","display_name":"Matthias Pfretzschner","orcid":"https://orcid.org/0000-0002-5378-1694"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthias Pfretzschner","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135495349","display_name":"Ignaz Rutter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ignaz Rutter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.71802982,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"2","first_page":"121","last_page":"147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9521999955177307,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9521999955177307,"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.013000000268220901,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.011099999770522118,"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/backtracking","display_name":"Backtracking","score":0.7199000120162964},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.705299973487854},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44600000977516174},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3822000026702881},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3652999997138977},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.3492000102996826},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.34790000319480896},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.33329999446868896},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.31779998540878296}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.7199000120162964},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.705299973487854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5810999870300293},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3882000148296356},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3659999966621399},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3652999997138977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36250001192092896},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.3492000102996826},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.33329999446868896},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3037000000476837},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.2904999852180481},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.28769999742507935},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2827000021934509},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.2775999903678894},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.27489998936653137},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.27469998598098755},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2687999904155731},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.26080000400543213},{"id":"https://openalex.org/C2781011336","wikidata":"https://www.wikidata.org/wiki/Q1465133","display_name":"Time limit","level":2,"score":0.251800000667572},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7155/jgaa.v30i2.3136","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i2.3136","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.v30i2.3136","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i2.3136","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Since":[0],"many":[1],"real-world":[2],"graphs":[3,9,35,40,178],"are":[4,36],"nonplanar,":[5],"the":[6,29,37,71,80,101,129,142,169,173,185],"study":[7],"of":[8,21,28,33,104,146,153,168],"that":[10,41,121,140],"allow":[11,122],"few":[12],"crossings":[13],"per":[14,50,156],"edge":[15],"has":[16],"been":[17],"an":[18,89,136],"active":[19],"subfield":[20],"graph":[22,56,68],"theory":[23],"in":[24,128],"recent":[25],"years.":[26],"One":[27],"most":[30,47],"natural":[31],"generalizations":[32],"planar":[34],"so-called":[38],"1-planar":[39,58],"admit":[42],"a":[43,55,150],"drawing":[44],"with":[45,179],"at":[46],"one":[48],"crossing":[49],"edge.":[51],"Unfortunately,":[52],"testing":[53,85],"whether":[54],"is":[57,59,161,192],"known":[60],"to":[61,124,163,181],"be":[62],"NP-complete":[63],"even":[64],"for":[65,84,189],"very":[66],"restricted":[67],"classes.":[69],"On":[70],"positive":[72],"side,":[73],"Binucci,":[74],"Didimo":[75],"and":[76,98,107,117,144,176],"Montecchiani":[77],"[7]":[78],"presented":[79],"first":[81],"practical":[82],"algorithm":[83],"1-planarity":[86],"based":[87],"on":[88,95],"easy-to-implement":[90],"backtracking":[91],"strategy.":[92],"We":[93,134],"build":[94],"this":[96],"idea":[97],"systematically":[99],"explore":[100],"design":[102],"choices":[103],"such":[105,112],"algorithms":[106],"propose":[108],"several":[109],"new":[110],"ingredients,":[111],"as":[113],"different":[114],"branching":[115],"strategies":[116],"multiple":[118],"filter":[119],"criteria":[120],"us":[123],"reject":[125],"certain":[126],"branches":[127],"search":[130],"tree":[131],"early":[132],"on.":[133],"conduct":[135],"extensive":[137],"experimental":[138],"evaluation":[139],"evaluates":[141],"efficiency":[143],"effectiveness":[145],"these":[147],"ingredients.":[148],"Given":[149],"time":[151,188],"limit":[152],"three":[154],"hours":[155],"instance,":[157],"our":[158],"best":[159],"configuration":[160],"able":[162],"solve":[164],"more":[165],"than":[166],"98%":[167],"non-planar":[170],"instances":[171,191],"from":[172],"well-known":[174],"North":[175],"Rome":[177],"up":[180],"50":[182],"vertices.":[183],"Notably,":[184],"median":[186],"running":[187],"solved":[190],"well":[193],"below":[194],"1":[195],"second.":[196]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-07T00:00:00"}