{"id":"https://openalex.org/W7118344632","doi":"https://doi.org/10.1137/1.9781611978971.72","title":"The Parameterised Complexity of Counting Small Sub-Hypergraphs","display_name":"The Parameterised Complexity of Counting Small Sub-Hypergraphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118344632","doi":"https://doi.org/10.1137/1.9781611978971.72"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.72","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.72","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","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/A5041614328","display_name":"Marco Bressan","orcid":"https://orcid.org/0000-0001-5211-2264"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Marco Bressan","raw_affiliation_strings":["University of Milan"],"affiliations":[{"raw_affiliation_string":"University of Milan","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122253206","display_name":"Julian Christoph Brinkmann","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Julian Christoph Brinkmann","raw_affiliation_strings":["Goethe University Frankfurt"],"affiliations":[{"raw_affiliation_string":"Goethe University Frankfurt","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052689442","display_name":"Holger Dell","orcid":"https://orcid.org/0000-0001-8955-0786"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]},{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE","DK"],"is_corresponding":false,"raw_author_name":"Holger Dell","raw_affiliation_strings":["Basic Algorithms Research Copenhagen and IT University of Copenhagen","Goethe University Frankfurt"],"affiliations":[{"raw_affiliation_string":"Basic Algorithms Research Copenhagen and IT University of Copenhagen","institution_ids":["https://openalex.org/I83467386"]},{"raw_affiliation_string":"Goethe University Frankfurt","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091690351","display_name":"Marc Roth","orcid":"https://orcid.org/0000-0003-3159-9418"},"institutions":[{"id":"https://openalex.org/I166337079","display_name":"Queen Mary University of London","ror":"https://ror.org/026zzn846","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I166337079"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marc Roth","raw_affiliation_strings":["Queen Mary University of London"],"affiliations":[{"raw_affiliation_string":"Queen Mary University of London","institution_ids":["https://openalex.org/I166337079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030374322","display_name":"Philip Wellnitz","orcid":"https://orcid.org/0000-0002-6482-8478"},"institutions":[{"id":"https://openalex.org/I200475212","display_name":"The Graduate University for Advanced Studies, SOKENDAI","ror":"https://ror.org/0516ah480","country_code":"JP","type":"education","lineage":["https://openalex.org/I200475212"]},{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Philip Wellnitz","raw_affiliation_strings":["National Institute of Informatics","The Graduate University for Advanced Studies"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"The Graduate University for Advanced Studies","institution_ids":["https://openalex.org/I200475212"]}]}],"institutions":[],"countries_distinct_count":5,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5041614328"],"corresponding_institution_ids":["https://openalex.org/I189158943"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22596154,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2002","last_page":"2014"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.4968000054359436,"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.4968000054359436,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.19769999384880066,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.06390000134706497,"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/hypergraph","display_name":"Hypergraph","score":0.7513999938964844},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.7195000052452087},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6287999749183655},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.5656999945640564},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5335000157356262},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4772000014781952},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.4749999940395355},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.45840001106262207},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4578000009059906},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4293000102043152}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7513999938964844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7414000034332275},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.7195000052452087},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6287999749183655},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5759999752044678},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.5656999945640564},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5371999740600586},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5335000157356262},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4772000014781952},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.4749999940395355},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.45840001106262207},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4578000009059906},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4293000102043152},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.40290001034736633},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3677999973297119},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3675000071525574},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.36059999465942383},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.3544999957084656},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.34439998865127563},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3215999901294708},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.3140000104904175},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.3089999854564667},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.28949999809265137},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.2867000102996826},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.26899999380111694},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26750001311302185},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.26030001044273376}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.72","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.72","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Subgraph":[0],"counting":[1,21,39],"is":[2,11,80,86,106,131],"a":[3,59,87,120,185,207,269,289],"fundamental":[4],"and":[5,45,110,128,135,164,178,217,227,258],"well-studied":[6],"problem":[7,71],"whose":[8],"computational":[9],"complexity":[10,220,309],"well":[12],"understood.":[13],"Quite":[14],"surprisingly,":[15,305],"the":[16,35,48,67,70,76,91,98,158,188,194,213,219,243,273,277,282],"hypergraph":[17,214,283],"version":[18],"of":[19,50,52,62,69,90,94,162,191,235,264,268,272,276,292],"subgraph":[20],"has":[22,114,139],"been":[23],"almost":[24],"ignored.":[25],"In":[26],"this":[27,31,126,307],"work,":[28,127],"we":[29,102,210,239,302],"address":[30],"gap":[32,245],"by":[33],"investigating":[34],"most":[36],"basic":[37],"sub-hypergraph":[38],"problem:":[40],"given":[41],"two":[42],"hypergraphs":[43,234],"\\(H\\)":[44],"\\(G\\),":[46],"compute":[47],"number":[49],"sub-hypergraphs":[51,293],"\\(G\\)":[53],"isomorphic":[54],"to":[55,72,168,200,212,224,233,255,298],"\\(H\\).":[56],"Formally,":[57],"for":[58,149,246],"family":[60],"\\(\\mathcal{H}\\)":[61,113,138],"hypergraphs,":[63],"let":[64],"#Sub\\((\\mathcal{H})\\)":[65,105],"be":[66,169,202,299],"restriction":[68],"\\(H":[73],"\\in":[74],"\\mathcal{H}\\);":[75],"induced":[77],"variant":[78,291],"#IndSub\\((\\mathcal{H})\\)":[79,130,165],"defined":[81],"analogously.":[82],"Our":[83],"main":[84],"contribution":[85],"complete":[88],"classification":[89],"fixed-parameter":[92,107,132,159,195],"tractability":[93],"these":[95],"problems.":[96],"Assuming":[97],"Exponential":[99],"Time":[100],"Hypothesis,":[101],"prove":[103],"that":[104,129,157,279],"tractable":[108,133,160,196],"if":[109,112,134,137],"only":[111,136],"bounded":[115,140],"fractional":[116,141,247],"co-independent":[117],"edge-cover":[118,142],"number,":[119],"novel":[121],"graph":[122],"parameter":[123],"introduced":[124],"in":[125,170,203,281,306],"number.":[143],"Both":[144],"results":[145,148],"subsume":[146],"pre-existing":[147],"graphs":[150,232],"as":[151],"special":[152,189],"cases.":[153],"We":[154,286],"also":[155,287],"show":[156,303],"cases":[161,197],"#Sub\\(\\mathcal{H})\\)":[163],"are":[166,198,296],"unlikely":[167],"polynomial":[171,204],"time,":[172],"unless":[173],"respectively":[174],"\\(\\#P":[175],"=":[176],"P\\)":[177],"Graph":[179],"Isomorphism":[180],"\\(\\in\\,":[181],"P\\).":[182],"This":[183],"shows":[184],"separation":[186],"with":[187],"case":[190,308],"graphs,":[192],"where":[193,294],"known":[199],"actually":[201],"time.":[205],"From":[206],"technical":[208],"standpoint,":[209],"turn":[211],"homomorphism":[215,284],"basis":[216],"lift":[218],"monotonicity":[221,310],"principle":[222],"due":[223,254],"Curticapean,":[225],"Dell,":[226],"Marx":[228],"[STOC":[229,260],"2017]":[230],"from":[231],"unbounded":[236],"rank.":[237],"Moreover,":[238],"crucially":[240],"rely":[241],"on":[242,251],"integrality":[244],"independent":[248],"sets":[249],"based":[250],"adaptive":[252,274],"width":[253,275],"Bressan,":[256],"Lanzinger,":[257],"Roth":[259],"2023].":[261],"The":[262],"heart":[263],"our":[265],"proofs":[266],"consists":[267],"careful":[270],"investigation":[271],"patterns":[278],"survive":[280],"basis.":[285],"consider":[288],"natural":[290],"edges":[295],"trimmed":[297],"vertex":[300],"subsets;":[301],"that,":[304],"fails.":[311]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}