{"id":"https://openalex.org/W3210858999","doi":"https://doi.org/10.1145/3519935.3520008","title":"Counting small induced subgraphs with hereditary properties","display_name":"Counting small induced subgraphs with hereditary properties","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W3210858999","doi":"https://doi.org/10.1145/3519935.3520008","mag":"3210858999"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520008","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/Counting_Small_Induced_Subgraphs_with_Hereditary_Properties/24614370","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002287702","display_name":"Jacob Focke","orcid":"https://orcid.org/0000-0002-6895-755X"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jacob Focke","raw_affiliation_strings":["CISPA, Germany"],"affiliations":[{"raw_affiliation_string":"CISPA, Germany","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091690351","display_name":"Marc Roth","orcid":"https://orcid.org/0000-0003-3159-9418"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marc Roth","raw_affiliation_strings":["University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002287702"],"corresponding_institution_ids":["https://openalex.org/I4210128801"],"apc_list":null,"apc_paid":null,"fwci":1.0557,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78477604,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1543","last_page":"1551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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.6938289999961853},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6883286833763123},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6652039289474487},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5752413272857666},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5199471712112427},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49161916971206665},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4873121678829193},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46543872356414795},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.44495925307273865},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4367869794368744},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.42577800154685974},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.41442224383354187},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4135606586933136},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3212790787220001},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19782540202140808},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1271049678325653}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6938289999961853},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6883286833763123},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6652039289474487},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5752413272857666},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5199471712112427},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49161916971206665},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4873121678829193},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46543872356414795},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.44495925307273865},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4367869794368744},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.42577800154685974},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.41442224383354187},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4135606586933136},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3212790787220001},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19782540202140808},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1271049678325653},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3519935.3520008","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520008","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:figshare.com:article/24614370","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Counting_Small_Induced_Subgraphs_with_Hereditary_Properties/24614370","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"","raw_type":"Text"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:7c2096d3-56a4-4b55-86cd-288ae83ee654","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:7c2096d3-56a4-4b55-86cd-288ae83ee654","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Symplectic Elements","raw_type":"Conference item"},{"id":"pmh:oai:qmro.qmul.ac.uk:123456789/101485","is_oa":false,"landing_page_url":"https://qmro.qmul.ac.uk/xmlui/handle/123456789/101485","pdf_url":null,"source":{"id":"https://openalex.org/S4306400530","display_name":"Queen Mary Research Online (Queen Mary University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I166337079","host_organization_name":"Queen Mary University of London","host_organization_lineage":["https://openalex.org/I166337079"],"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":"Conference Proceeding"},{"id":"doi:10.60882/cispa.24614370.v1","is_oa":true,"landing_page_url":"https://doi.org/10.60882/cispa.24614370.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050916","display_name":"CISPA Helmholtz Center","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/24614370","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Counting_Small_Induced_Subgraphs_with_Hereditary_Properties/24614370","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"","raw_type":"Text"},"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W104109059","https://openalex.org/W127859554","https://openalex.org/W1488421129","https://openalex.org/W1507763859","https://openalex.org/W1553420678","https://openalex.org/W1565660154","https://openalex.org/W1570425181","https://openalex.org/W1653035750","https://openalex.org/W1872333393","https://openalex.org/W1982250981","https://openalex.org/W1985572324","https://openalex.org/W1988772559","https://openalex.org/W1995907191","https://openalex.org/W2003591835","https://openalex.org/W2009147258","https://openalex.org/W2027519504","https://openalex.org/W2049559029","https://openalex.org/W2065813152","https://openalex.org/W2102039892","https://openalex.org/W2130190334","https://openalex.org/W2153624566","https://openalex.org/W2236332462","https://openalex.org/W2277472453","https://openalex.org/W2610844084","https://openalex.org/W2914414140","https://openalex.org/W2941191312","https://openalex.org/W2960856150","https://openalex.org/W2962738766","https://openalex.org/W2963279056","https://openalex.org/W2963918649","https://openalex.org/W2964347561","https://openalex.org/W2970202550","https://openalex.org/W3003056897","https://openalex.org/W3125086224","https://openalex.org/W3200817613"],"related_works":["https://openalex.org/W4287815058","https://openalex.org/W1558618163","https://openalex.org/W4214914101","https://openalex.org/W3196775331","https://openalex.org/W2256089709","https://openalex.org/W4287689012","https://openalex.org/W2000333212","https://openalex.org/W2030312085","https://openalex.org/W2221885959","https://openalex.org/W3049215996"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,6,43,108,146,175,192,206],"computational":[3],"complexity":[4,160],"of":[5,9,14,104,174,181,191,209,226],"problem":[7,111],"#IndSub(\u03a6)":[8,69,76,210],"counting":[10,123,147],"k-vertex":[11],"induced":[12],"subgraphs":[13],"a":[15,20,49,101],"graph":[16,21],"G":[17],"that":[18,165],"satisfy":[19],"property":[22,51],"\u03a6.":[23],"Our":[24],"main":[25],"result":[26],"establishes":[27],"an":[28,155],"exhaustive":[29,156],"and":[30,116,157,178,204,219],"explicit":[31,158],"classification":[32,99,161,208],"for":[33,55,64,94,106,128,145,162,211],"all":[34,56,163,230],"hereditary":[35,50],"properties,":[36],"including":[37],"tight":[38],"conditional":[39],"lower":[40,143],"bounds":[41,144],"under":[42,168,185],"Exponential":[44],"Time":[45],"Hypothesis":[46],"(ETH):":[47],"If":[48],"\u03a6":[52],"is":[53,61,70,77,120,124,232],"true":[54,62],"graphs,":[57,67],"or":[58],"if":[59],"it":[60,86],"only":[63],"finitely":[65],"many":[66],"then":[68],"solvable":[71],"in":[72,90,134],"polynomial":[73],"time.":[74],"Otherwise,":[75],"#W[1]-complete":[78],"when":[79],"parameterised":[80,159],"by":[81,114],"k,":[82],"and,":[83],"assuming":[84],"ETH,":[85],"cannot":[87],"be":[88],"solved":[89],"time":[91],"f(k)\u00b7":[92],"|G|o(k)":[93],"any":[95],"function":[96],"f.":[97],"This":[98],"features":[100],"wide":[102],"range":[103],"properties":[105,129,164,214],"which":[107,130],"corresponding":[109],"detection":[110],"(as":[112],"classified":[113],"Khot":[115],"Raman":[117],"[TCS":[118],"02])":[119],"tractable":[121],"but":[122],"hard.":[125],"Moreover,":[126],"even":[127],"are":[131,166],"already":[132],"intractable":[133],"their":[135],"decision":[136],"version,":[137],"our":[138,200,227],"results":[139,194,201],"yield":[140],"significantly":[141],"stronger":[142],"problem.":[148,197],"As":[149],"additional":[150],"result,":[151],"we":[152,188],"also":[153],"present":[154],"invariant":[167],"homomorphic":[169],"equivalence.":[170],"By":[171],"covering":[172],"one":[173],"most":[176],"natural":[177],"general":[179],"notions":[180],"closure,":[182],"namely,":[183],"closure":[184],"vertex-deletion":[186],"(hereditary),":[187],"generalise":[189],"some":[190],"earlier":[193],"on":[195],"this":[196],"For":[198],"instance,":[199],"fully":[202],"subsume":[203],"strengthen":[205],"existing":[207],"monotone":[212],"(subgraph-closed)":[213],"due":[215],"to":[216],"Roth,":[217],"Schmitt,":[218],"Wellnitz":[220],"[FOCS":[221],"20].":[222],"A":[223],"full":[224],"version":[225],"paper,":[228],"containing":[229],"proofs,":[231],"available":[233],"at":[234],"https://arxiv.org/abs/2111.02277.":[235]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}