{"id":"https://openalex.org/W7169596418","doi":"https://doi.org/10.7155/jgaa.v30i2.3114","title":"OOPS: Optimized One-Planarity Solver via SAT","display_name":"OOPS: Optimized One-Planarity Solver via SAT","publication_year":2026,"publication_date":"2026-07-17","ids":{"openalex":"https://openalex.org/W7169596418","doi":"https://doi.org/10.7155/jgaa.v30i2.3114"},"language":"en","primary_location":{"id":"doi:10.7155/jgaa.v30i2.3114","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i2.3114","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3114/3041","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://jgaa.info/index.php/jgaa/article/download/3114/3041","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058217001","display_name":"Sergey Pupyrev","orcid":"https://orcid.org/0000-0003-4089-673X"},"institutions":[{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sergey Pupyrev","raw_affiliation_strings":["Menlo Park, CA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4089-673X","affiliations":[{"raw_affiliation_string":"Menlo Park, CA, USA","institution_ids":["https://openalex.org/I4210099336"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058217001"],"corresponding_institution_ids":["https://openalex.org/I4210099336"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.78973889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"2","first_page":"175","last_page":"197"},"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.29409998655319214,"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.29409998655319214,"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.17599999904632568,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1103999987244606,"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/solver","display_name":"Solver","score":0.5464000105857849},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5288000106811523},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4952999949455261},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.47870001196861267},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.429500013589859},{"id":"https://openalex.org/keywords/planarity-testing","display_name":"Planarity testing","score":0.3490000069141388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7055000066757202},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5464000105857849},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5288000106811523},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4952999949455261},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.47870001196861267},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46799999475479126},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.429500013589859},{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.3490000069141388},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3483999967575073},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3321000039577484},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3001999855041504},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.27399998903274536},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.7155/jgaa.v30i2.3114","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i2.3114","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3114/3041","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"},{"id":"pmh:oai:doaj.org/article:8e53770a470a42008b6add615605c066","is_oa":false,"landing_page_url":"https://doaj.org/article/8e53770a470a42008b6add615605c066","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"Journal of Graph Algorithms and Applications, Vol 30, Iss 2 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.v30i2.3114","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i2.3114","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3114/3041","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":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7169596418.pdf","grobid_xml":"https://content.openalex.org/works/W7169596418.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"OOPS":[2,134,148],"(Optimized":[3],"One-Planarity":[4],"Solver),":[5],"a":[6,83,139],"practical":[7,66],"heuristicfor":[8],"recognizing":[9],"1-planar":[10,18,60],"graphs":[11,39,61],"and":[12,47,129],"several":[13],"important":[14],"subclasses.":[15],"A":[16],"graphis":[17],"if":[19],"it":[20],"can":[21,54,135],"be":[22,55,136],"drawn":[23],"in":[24,44,57,111,142,171],"the":[25,78,88,97,101,104,121,162,172],"plane":[26],"such":[27],"that":[28,40],"each":[29],"edge":[30],"is":[31,62,75,108,164],"crossed":[32],"at":[33],"mostonce---a":[34],"natural":[35],"generalization":[36],"of":[37,72,80,90,124,156,161],"planar":[38],"has":[41],"received":[42],"increasingattention":[43],"graph":[45,49,144,158],"drawing":[46],"beyond-planar":[48],"theory.":[50,145],"Although":[51],"testing":[52],"planarity":[53],"done":[56],"linear":[58],"time,recognizing":[59],"NP-complete,":[63],"making":[64],"effective":[65],"algorithms":[67],"especially":[68],"valuable.The":[69],"core":[70],"idea":[71],"our":[73,106,125],"approach":[74],"to":[76,82,94,119,149,167],"reduce":[77],"recognition":[79],"1-planarity":[81,155],"propositional":[84],"satisfiability":[85],"(SAT)":[86],"instance,enabling":[87],"use":[89],"modern":[91],"SAT":[92],"solvers":[93],"efficiently":[95],"explore":[96],"search":[98],"space.":[99],"Despite":[100],"inherent":[102],"complexityof":[103],"problem,":[105],"method":[107],"substantially":[109],"faster":[110],"practice":[112],"than":[113],"na\u00efve":[114],"or":[115],"brute-force":[116],"algorithms.In":[117],"addition":[118],"demonstrating":[120],"empirical":[122],"performance":[123],"solver":[126],"on":[127],"synthetic":[128],"real-worldinstances,":[130],"we":[131],"show":[132],"how":[133],"used":[137],"as":[138],"discovery":[140],"tool":[141],"theoretical":[143],"Specifically,we":[146],"employ":[147],"investigate":[150],"two":[151],"research":[152],"problems":[153],"concerning":[154],"specific":[157],"families.Our":[159],"implementation":[160],"algorithm":[163],"publicly":[165],"available":[166],"support":[168],"further":[169],"exploration":[170],"field.":[173]},"counts_by_year":[],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2026-07-18T00:00:00"}