{"id":"https://openalex.org/W7162585903","doi":"https://doi.org/10.4230/lipics.socg.2026.51","title":"First-Order Logic and Twin-Width for Some Geometric Graphs","display_name":"First-Order Logic and Twin-Width for Some Geometric Graphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7162585903","doi":"https://doi.org/10.4230/lipics.socg.2026.51"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25857","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.51","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.51/LIPIcs.SoCG.2026.51.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.51/LIPIcs.SoCG.2026.51.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030860994","display_name":"Colin Geniet","orcid":null},"institutions":[{"id":"https://openalex.org/I4210104335","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565","country_code":"KR","type":"facility","lineage":["https://openalex.org/I4210104335"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Geniet, Colin","raw_affiliation_strings":["Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-4034-7634","affiliations":[{"raw_affiliation_string":"Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea","institution_ids":["https://openalex.org/I4210104335"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121575372","display_name":"Gunwoo Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]},{"id":"https://openalex.org/I4210104335","display_name":"Institute for Basic Science","ror":"https://ror.org/00y0zf565","country_code":"KR","type":"facility","lineage":["https://openalex.org/I4210104335"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Kim, Gunwoo","raw_affiliation_strings":["School of Computing, KAIST, Daejeon, South Korea","Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0009-0001-2394-0914","affiliations":[{"raw_affiliation_string":"School of Computing, KAIST, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Discrete Mathematics Group, Institute for Basic Science (IBS), Daejeon, South Korea","institution_ids":["https://openalex.org/I4210104335"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062839128","display_name":"Lucas Meijer","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Meijer, Lucas","raw_affiliation_strings":["Department of Information and Computing Sciences, Utrecht University, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0002-4901-5249","affiliations":[{"raw_affiliation_string":"Department of Information and Computing Sciences, Utrecht University, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63890274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.7038999795913696,"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.7038999795913696,"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.15360000729560852,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04780000075697899,"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/indifference-graph","display_name":"Indifference graph","score":0.5608000159263611},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.48820000886917114},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.48410001397132874},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4799000024795532},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.42399999499320984},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4133000075817108},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.40130001306533813},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.3917999863624573},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.38920000195503235}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6711000204086304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6539000272750854},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5608000159263611},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5516999959945679},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.48820000886917114},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.48410001397132874},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4799000024795532},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.42399999499320984},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4133000075817108},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.40130001306533813},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.3917999863624573},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.38920000195503235},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.38749998807907104},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3596000075340271},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.34459999203681946},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.3353999853134155},{"id":"https://openalex.org/C68103157","wikidata":"https://www.wikidata.org/wiki/Q569347","display_name":"Graph product","level":5,"score":0.3206999897956848},{"id":"https://openalex.org/C128394911","wikidata":"https://www.wikidata.org/wiki/Q1987578","display_name":"Unit interval","level":2,"score":0.320499986410141},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.2944999933242798},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.28519999980926514},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.2840000092983246},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25857","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.51","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.51/LIPIcs.SoCG.2026.51.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.socg.2026.51","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.socg.2026.51","pdf_url":null,"source":null,"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25857","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2026.51","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol367-socg2026/LIPIcs.SoCG.2026.51/LIPIcs.SoCG.2026.51.pdf","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[{"display_name":"Life in Land","score":0.5077628493309021,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7162585903.pdf","grobid_xml":"https://content.openalex.org/works/W7162585903.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0],"some":[1],"geometric":[2,63],"graph":[3,15],"classes,":[4],"tractability":[5],"of":[6,77,97,108,118],"testing":[7],"first-order":[8],"formulas":[9],"is":[10,34,52,56],"precisely":[11],"characterised":[12],"by":[13],"the":[14,32,59,73],"parameter":[16],"twin-width.":[17],"This":[18],"was":[19],"first":[20],"proved":[21],"for":[22,41,79,94,105,115],"interval":[23],"graphs":[24,64,96,107,117],"among":[25],"others":[26],"in":[27,86],"[BCKKLT,":[28],"IPEC":[29],"'22],":[30],"where":[31],"equivalence":[33],"called":[35],"delineation,":[36],"and":[37,48],"more":[38],"generally":[39],"holds":[40,93],"circle":[42],"graphs,":[43,47,102],"rooted":[44],"directed":[45],"path":[46],"H-graphs":[49],"when":[50],"H":[51],"a":[53],"forest.":[54],"Delineation":[55],"based":[57],"on":[58],"key":[60],"idea":[61],"that":[62,91],"often":[65],"admit":[66],"natural":[67],"vertex":[68],"orderings,":[69],"allowing":[70],"to":[71],"use":[72],"very":[74],"rich":[75],"theory":[76],"twin-width":[78],"ordered":[80],"graphs.":[81],"Answering":[82],"two":[83],"questions":[84],"raised":[85],"their":[87],"work,":[88],"we":[89],"prove":[90,113],"delineation":[92,114],"intersection":[95,116],"non-degenerate":[98],"axis-parallel":[99],"unit":[100],"segment":[101],"but":[103],"fails":[104],"visibility":[106],"1.5D":[109],"terrains.":[110],"We":[111],"also":[112],"circular":[119],"arcs.":[120]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-28T00:00:00"}