{"id":"https://openalex.org/W2112212574","doi":"https://doi.org/10.1145/2499483","title":"Testing first-order properties for subclasses of sparse graphs","display_name":"Testing first-order properties for subclasses of sparse graphs","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2112212574","doi":"https://doi.org/10.1145/2499483","mag":"2112212574"},"language":"en","primary_location":{"id":"doi:10.1145/2499483","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2499483","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5073630443","display_name":"Zden\u0115k Dvo\u0159\u00e1k","orcid":"https://orcid.org/0000-0002-8308-9746"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Zden\u011bk Dvo\u0159\u00e1k","raw_affiliation_strings":["Charles University in Prague, Czech Republic","Charles University in Prague; Czech Republic"],"affiliations":[{"raw_affiliation_string":"Charles University in Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles University in Prague; Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027559065","display_name":"Daniel Kr\u00e1l\u034f\u030c","orcid":"https://orcid.org/0000-0001-8680-0890"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Daniel Kr\u00e1l","raw_affiliation_strings":["University of Warwick, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Warwick, United Kingdom","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101892672","display_name":"Robin Thomas","orcid":"https://orcid.org/0000-0002-9318-1458"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robin Thomas","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA","Georgia Institute of Technology Atlanta, GA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073630443"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":5.9779,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.96625884,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"60","issue":"5","first_page":"1","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9987999796867371,"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/T11476","display_name":"Graph theory and applications","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6716201305389404},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6359542608261108},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6307384371757507},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5928303003311157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.57956862449646},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.5760787725448608},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5572611689567566},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5489951372146606},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.48789215087890625},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.48028823733329773},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4606253504753113},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.44000229239463806},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4175451397895813},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3414246737957001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18842047452926636},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16394507884979248}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6716201305389404},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6359542608261108},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6307384371757507},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5928303003311157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.57956862449646},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.5760787725448608},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5572611689567566},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5489951372146606},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.48789215087890625},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.48028823733329773},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4606253504753113},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.44000229239463806},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4175451397895813},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3414246737957001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18842047452926636},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16394507884979248},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2499483","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2499483","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:58122","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6923105424","display_name":null,"funder_award_id":"259385 (DK)","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W891461","https://openalex.org/W36639738","https://openalex.org/W1492250485","https://openalex.org/W1517036688","https://openalex.org/W1517150411","https://openalex.org/W1570425181","https://openalex.org/W1684832175","https://openalex.org/W1781739513","https://openalex.org/W1978747958","https://openalex.org/W1993920925","https://openalex.org/W1994264784","https://openalex.org/W2003051788","https://openalex.org/W2005079828","https://openalex.org/W2028357390","https://openalex.org/W2030087828","https://openalex.org/W2049229625","https://openalex.org/W2055049645","https://openalex.org/W2061513598","https://openalex.org/W2067431706","https://openalex.org/W2068312052","https://openalex.org/W2075921069","https://openalex.org/W2078674325","https://openalex.org/W2092904196","https://openalex.org/W2119567838","https://openalex.org/W2124442576","https://openalex.org/W2149284317","https://openalex.org/W2561675875","https://openalex.org/W2595518841","https://openalex.org/W2913688336","https://openalex.org/W3032071526","https://openalex.org/W3124913715","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2949199930","https://openalex.org/W1976784955","https://openalex.org/W2570206580","https://openalex.org/W1982089707","https://openalex.org/W2091382007","https://openalex.org/W2111290740","https://openalex.org/W4280617118","https://openalex.org/W4388850666","https://openalex.org/W4297435153","https://openalex.org/W4378498857"],"abstract_inverted_index":{"We":[0,95],"present":[1],"a":[2,17,63,66,76,81,89,120,128,137,187],"linear-time":[3,102,138],"algorithm":[4,103],"for":[5,104,124,197],"deciding":[6,105],"first-order":[7],"(FO)":[8],"properties":[9,107],"in":[10,75,79,108,150,160,179,186,189],"classes":[11,37,50,109],"of":[12,38,44,51,54,65,92,110,131,133,165,171,207,216],"graphs":[13,39,43,53,57,70,111,125,132],"with":[14,58,112],"bounded":[15,41,45,55,114,134],"expansion,":[16],"notion":[18],"recently":[19],"introduced":[20],"by":[21],"Ne\u0161et\u0159il":[22,208],"and":[23,69,153,181,200,209],"Ossona":[24,210],"de":[25,211],"Mendez.":[26],"This":[27],"generalizes":[28],"several":[29],"results":[30,185,194],"from":[31],"the":[32,140,154,169,190,204,214],"literature,":[33],"because":[34],"many":[35],"natural":[36],"have":[40],"expansion:":[42],"tree-width,":[46],"all":[47],"proper":[48],"minor-closed":[49],"graphs,":[52],"degree,":[56],"no":[59],"subgraph":[60],"isomorphic":[61],"to":[62,127,145,174],"subdivision":[64],"fixed":[67,77,129],"graph,":[68],"that":[71,83,97],"can":[72,157],"be":[73,158,175],"drawn":[74],"surface":[78],"such":[80],"way":[82],"each":[84],"edge":[85],"crosses":[86],"at":[87],"most":[88],"constant":[90,151,161],"number":[91],"other":[93],"edges.":[94],"deduce":[96],"there":[98],"is":[99,177],"an":[100,147,166],"almost":[101],"FO":[106,148],"locally":[113],"expansion.":[115,135],"More":[116],"generally,":[117],"we":[118],"design":[119],"dynamic":[121],"data":[122,141,155],"structure":[123,142,156],"belonging":[126],"class":[130],"After":[136],"initialization":[139],"allows":[143],"us":[144],"test":[146],"property":[149],"time,":[152],"updated":[159],"time":[162],"after":[163],"addition/deletion":[164],"edge,":[167],"provided":[168],"list":[170],"possible":[172],"edges":[173],"added":[176],"known":[178],"advance":[180],"their":[182],"simultaneous":[183],"addition":[184],"graph":[188],"class.":[191],"All":[192],"our":[193],"also":[195],"hold":[196],"relational":[198],"structures":[199],"are":[201],"based":[202],"on":[203,213],"seminal":[205],"result":[206],"Mendez":[212],"existence":[215],"low":[217],"tree-depth":[218],"colorings.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-03-29T08:15:47.926485","created_date":"2025-10-10T00:00:00"}