{"id":"https://openalex.org/W2765687715","doi":"https://doi.org/10.23638/dmtcs-21-3-18","title":"Planar 3-SAT with a Clause/Variable Cycle","display_name":"Planar 3-SAT with a Clause/Variable Cycle","publication_year":2019,"publication_date":"2019-06-05","ids":{"openalex":"https://openalex.org/W2765687715","doi":"https://doi.org/10.23638/dmtcs-21-3-18","mag":"2765687715"},"language":"en","primary_location":{"id":"doi:10.23638/dmtcs-21-3-18","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-3-18","pdf_url":"https://dmtcs.episciences.org/5521/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dmtcs.episciences.org/5521/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050197344","display_name":"Alexander Pilz","orcid":"https://orcid.org/0000-0002-6059-1821"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Alexander Pilz","raw_affiliation_strings":["Institute of Software Technology , Graz University of Technology , Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Software Technology , Graz University of Technology , Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050197344"],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":null,"apc_paid":null,"fwci":0.2021,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49725824,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Vol. 21 no. 3","issue":"Discrete Algorithms","first_page":"311","last_page":"3113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9896000027656555,"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.9896000027656555,"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.9779999852180481,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.973800003528595,"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/mathematics","display_name":"Mathematics","score":0.7123521566390991},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6838349103927612},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6573320031166077},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6022922992706299},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5842035412788391},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5530996322631836},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5310423970222473},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5146113634109497},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48792764544487},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41700485348701477}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7123521566390991},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6838349103927612},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6573320031166077},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6022922992706299},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5842035412788391},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5530996322631836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5310423970222473},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5146113634109497},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48792764544487},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41700485348701477},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.23638/dmtcs-21-3-18","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-3-18","pdf_url":"https://dmtcs.episciences.org/5521/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:8857","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.31","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:1710.07476","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.07476","pdf_url":"https://arxiv.org/pdf/1710.07476","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/273480","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/273480","pdf_url":"http://hdl.handle.net/20.500.11850/273480","source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"16th Scandinavian Symposium and Workshops on Algorithm  Theory (SWAT 2018)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:2765687715","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1710.07476.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:27044d92bb354c61bf066abd15d7b8d7","is_oa":true,"landing_page_url":"https://doaj.org/article/27044d92bb354c61bf066abd15d7b8d7","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science, Vol Vol. 21 no. 3, Iss Discrete Algorithms (2019)","raw_type":"article"},{"id":"doi:10.48550/arxiv.1710.07476","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1710.07476","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.3929/ethz-b-000273480","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000273480","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.swat.2018.31","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2018.31","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2949221776","is_oa":false,"landing_page_url":"http://drops.dagstuhl.de/opus/volltexte/2018/8857/pdf/LIPIcs-SWAT-2018-31.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420822","display_name":"Scandinavian Workshop on Algorithm Theory","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Scandinavian Workshop on Algorithm Theory","raw_type":null},{"id":"mag:2963779915","is_oa":true,"landing_page_url":"https://dmtcs.episciences.org/5521/pdf","pdf_url":null,"source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.23638/dmtcs-21-3-18","is_oa":true,"landing_page_url":"https://doi.org/10.23638/dmtcs-21-3-18","pdf_url":"https://dmtcs.episciences.org/5521/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G8381026457","display_name":null,"funder_award_id":"J-3847-N35","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320321652","display_name":"Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich","ror":"https://ror.org/05a28rw58"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2765687715.pdf","grobid_xml":"https://content.openalex.org/works/W2765687715.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1749523692","https://openalex.org/W1975501803","https://openalex.org/W1981505946","https://openalex.org/W1983379779","https://openalex.org/W1989142182","https://openalex.org/W2003525146","https://openalex.org/W2003979824","https://openalex.org/W2012041962","https://openalex.org/W2047095042","https://openalex.org/W2054926952","https://openalex.org/W2063292248","https://openalex.org/W2066577300","https://openalex.org/W2074210283","https://openalex.org/W2081580682","https://openalex.org/W2087083200","https://openalex.org/W2090518395","https://openalex.org/W2115754974","https://openalex.org/W2116909526","https://openalex.org/W2121601978","https://openalex.org/W2133839024","https://openalex.org/W2148360835","https://openalex.org/W2157529519","https://openalex.org/W2341149892","https://openalex.org/W2894780622","https://openalex.org/W2913068454","https://openalex.org/W2964278127","https://openalex.org/W3102370784"],"related_works":["https://openalex.org/W2949221776","https://openalex.org/W1584085037","https://openalex.org/W2505733753","https://openalex.org/W180627479","https://openalex.org/W618838339","https://openalex.org/W2069504147","https://openalex.org/W1674033109","https://openalex.org/W2026105979","https://openalex.org/W774584138","https://openalex.org/W3042846617","https://openalex.org/W2781437110","https://openalex.org/W3135386707","https://openalex.org/W1832421600","https://openalex.org/W1931480168","https://openalex.org/W2952943368","https://openalex.org/W2400777899","https://openalex.org/W1561517399","https://openalex.org/W1968692677","https://openalex.org/W2726266756","https://openalex.org/W1969989905"],"abstract_inverted_index":{"In":[0,49,74,182],"the":[1,50,58,62,69,79,86,93,114,123,136,145,159,183,208,216],"Planar":[2,194],"3-SAT":[3,9,130,195],"problem,":[4],"we":[5,77,83,188],"are":[6,20,203],"given":[7],"a":[8,40,44,96,111,129,223],"formula":[10,24,63,131],"together":[11],"with":[12,175,196],"its":[13],"incidence":[14,59,87,137],"graph,":[15],"which":[16,68,82],"is":[17,25,33,117,139,148],"planar,":[18],"and":[19,105,144,213],"asked":[21],"whether":[22],"this":[23,31,53,75,186,219],"satisfiable.":[26],"Since":[27],"Lichtenstein's":[28],"proof":[29],"that":[30,85,99,113,122,142,190],"problem":[32,70,124,164,220],"NP-complete,":[34],"it":[35],"has":[36],"been":[37,65],"used":[38],"as":[39,170,172],"starting":[41],"point":[42],"for":[43,67,167,173],"large":[45],"number":[46],"of":[47,52,61,95,125,128,185,193,218,229],"reductions.":[48],"course":[51,184],"research,":[54],"different":[55],"restrictions":[56],"on":[57,215],"graph":[60,88,116,138],"have":[64],"devised,":[66],"also":[71],"remains":[72,132,165],"hard.":[73],"paper,":[76],"investigate":[78],"restriction":[80],"in":[81,110,141,222],"require":[84],"can":[89],"be":[90],"augmented":[91],"by":[92,210],"edges":[94],"Hamiltonian":[97,146],"cycle":[98,147],"first":[100],"passes":[101],"through":[102,107,157],"all":[103,108],"variables":[104,160,179,200],"then":[106],"clauses,":[109],"way":[112,143],"resulting":[115],"still":[118],"planar.":[119],"We":[120],"show":[121,189],"deciding":[126],"satisfiability":[127],"NP-complete":[133],"even":[134],"if":[135],"restricted":[140],"given.":[149],"This":[150],"complements":[151],"previous":[152],"results":[153],"demanding":[154],"cycles":[155],"only":[156],"either":[158],"or":[161],"clauses.":[162],"The":[163],"hard":[166],"monotone":[168,191],"formulas,":[169],"well":[171],"instances":[174,192],"exactly":[176,197],"three":[177,198],"distinct":[178,199],"per":[180,201],"clause.":[181],"investigation,":[187],"clause":[202],"always":[204],"satisfiable,":[205],"thus":[206],"settling":[207],"question":[209],"Darmann,":[211],"D\\"ocker,":[212],"Dorn":[214],"complexity":[217],"variant":[221],"surprising":[224],"way.":[225],"Comment:":[226],"Implementing":[227],"style":[228],"DMTCS":[230],"journal":[231]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}