Parameterised counting complexity theory
A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity theory with the goal of applying and generalising the extensive toolkit of parameterised algorithmics to the world of counting. Counting pro...
Uloženo v:
| Vydáno v: | Computer science review Ročník 59; s. 100837 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
01.02.2026
|
| Témata: | |
| ISSN: | 1574-0137 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity theory with the goal of applying and generalising the extensive toolkit of parameterised algorithmics to the world of counting.
Counting problems are known to be infamously hard with respect to classical complexity theory, much harder than NP-complete problems under standard assumptions, as shown by Toda (STOC 91). This holds true even for counting problems that admit a tractable decision version, a fact established in Valiant’s seminal work on the complexity of counting perfect matchings (SICOMP 79). Naturally, the central question in parameterised counting complexity theory asks: Can this intractability be alleviated with a multivariate complexity analysis?
We have observed that many tools from the “swiss army knife” of parameterised decision algorithms, such as win–win approaches based on bidimensionality, colour-coding, and, to some extent, kernelisation, often fail in the realm of counting problems (especially for exact counting). Circumventing the inapplicability of well-established algorithmic tools, we have witnessed the development of a flurry of novel techniques and theories tailored to parameterised counting problems, with origins in commutative combinatorial algebra, topology and deep graph theory dating back to early works of Lovász.
In this survey, we will revisit some of the most important frameworks and results discovered and established in the field over the years. Particular focus will be put on the framework of Graph Motif Parameters due to Curticapean, Dell and Marx (STOC 17), one of, if not the most exciting development in parameterised counting since its inception.
We will assume familiarity with basic concepts of parameterised algorithms and complexity theory, but, aside from that, we aim to present the introduction to the world of parameterised counting in a self-contained way. |
|---|---|
| AbstractList | A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity theory with the goal of applying and generalising the extensive toolkit of parameterised algorithmics to the world of counting.
Counting problems are known to be infamously hard with respect to classical complexity theory, much harder than NP-complete problems under standard assumptions, as shown by Toda (STOC 91). This holds true even for counting problems that admit a tractable decision version, a fact established in Valiant’s seminal work on the complexity of counting perfect matchings (SICOMP 79). Naturally, the central question in parameterised counting complexity theory asks: Can this intractability be alleviated with a multivariate complexity analysis?
We have observed that many tools from the “swiss army knife” of parameterised decision algorithms, such as win–win approaches based on bidimensionality, colour-coding, and, to some extent, kernelisation, often fail in the realm of counting problems (especially for exact counting). Circumventing the inapplicability of well-established algorithmic tools, we have witnessed the development of a flurry of novel techniques and theories tailored to parameterised counting problems, with origins in commutative combinatorial algebra, topology and deep graph theory dating back to early works of Lovász.
In this survey, we will revisit some of the most important frameworks and results discovered and established in the field over the years. Particular focus will be put on the framework of Graph Motif Parameters due to Curticapean, Dell and Marx (STOC 17), one of, if not the most exciting development in parameterised counting since its inception.
We will assume familiarity with basic concepts of parameterised algorithms and complexity theory, but, aside from that, we aim to present the introduction to the world of parameterised counting in a self-contained way. |
| ArticleNumber | 100837 |
| Author | Roth, Marc |
| Author_xml | – sequence: 1 givenname: Marc orcidid: 0000-0003-3159-9418 surname: Roth fullname: Roth, Marc email: m.roth@qmul.ac.uk organization: School of Electronic Engineering and Computer Science, Queen Mary University of London, Mile End Road, London, E1 4NS, United Kingdom |
| BookMark | eNp9z7FOwzAQBmAPRaItvAFDR5aEsx3bzYKEKqBIlWCA2UrOF3DUJpVtKvL2pAoz051O-n_dt2Czru-IsRsOOQeu79oc-xjolAsQajzBWpoZm3Nligy4NJdsEWMLYACUnrPbtypUB0oUfCS3wv67S777HJfDcU8_Pg2r9EV9GK7YRVPtI13_zSX7eHp832yz3evzy-Zhl6GQPGVlgwpqgYoraSTHRqmCV8KB00XFjdOEqHXpTKGEKIWsC7HWqgF0yJvaSLlkxdSLoY8jpLHH4A9VGCwHexba1k5CexbaSTjG7qcYjb-dPAUb0VOH5HwgTNb1_v-CX5a8Xy4 |
| Cites_doi | 10.1016/j.ic.2005.05.001 10.1016/j.ejc.2013.06.048 10.1126/science.298.5594.824 10.7155/jgaa.00014 10.1016/j.ic.2018.02.008 10.1145/3186898 10.1145/1206035.1206036 10.1145/2742544 10.1016/j.ejc.2011.01.006 10.1002/jgt.20461 10.1016/j.tcs.2004.02.003 10.1093/bioinformatics/btn163 10.1016/j.dam.2015.06.019 10.1007/s00224-021-10043-y 10.1145/504794.504798 10.1007/s00453-023-01178-0 10.1016/j.jcss.2010.06.005 10.1145/210332.210337 10.1137/S0097539703427203 10.1016/0304-3975(79)90044-6 10.1145/3520240 10.1137/0218077 10.1007/s00453-023-01114-2 10.1038/ncomms3241 10.1016/j.ipl.2021.106242 10.1016/j.jcss.2014.11.015 10.1080/14786436108243366 10.1145/3651587 10.1016/0031-8914(61)90063-5 10.1137/0208032 10.1016/0304-3975(86)90135-0 10.1016/j.jcss.2006.04.007 10.1145/2635812 10.1006/jcss.2000.1727 10.1137/0220053 10.1137/19M130604X 10.1016/S0304-3975(02)00017-8 10.1016/j.jcss.2009.08.003 10.4086/toc.2010.v006a005 10.1137/0212053 10.1007/s00224-011-9381-0 10.1007/s00453-018-0472-z 10.1016/j.cosrev.2020.100344 10.1017/S0305004100068936 10.1137/0608024 10.1137/110859798 10.1145/3404867 10.1145/2786017 10.1016/j.tcs.2004.08.008 10.1016/j.disopt.2007.08.001 10.1145/3461477 10.1016/0095-8956(86)90030-4 10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W 10.1016/j.apal.2005.06.010 10.1016/0196-6774(91)90006-K 10.1063/1.1703953 10.1007/s00493-016-3338-5 |
| ContentType | Journal Article |
| Copyright | 2025 The Author |
| Copyright_xml | – notice: 2025 The Author |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.cosrev.2025.100837 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| ExternalDocumentID | 10_1016_j_cosrev_2025_100837 S1574013725001133 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6J9 7-5 71M 8P~ AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AATTM AAXKI AAXUO AAYFN AAYWO ABBOA ABFRF ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO AEBSH AEFWE AEIPS AEKER AEUPX AFJKZ AFPUW AFTJW AGHFR AGUBO AGYEJ AHZHX AIALX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APLSM APXCP AXJTR BKOJK BLXMC CS3 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 ROL RPZ SDF SDG SES SPC SPCBC SSB SSD SSV SSZ T5K UNMZH ~G- ~HD 9DU AAYXX CITATION |
| ID | FETCH-LOGICAL-c231t-9fc50b2c5153731cf5541a2d0d64a17d6ecc669d74522923b42865f0cdc1fb733 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001589232200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1574-0137 |
| IngestDate | Sat Nov 29 07:23:11 EST 2025 Sat Nov 01 16:44:48 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | Randomised and approximation algorithms Graph homomorphisms Counting problems Parameterised complexity theory Graph motif parameters |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c231t-9fc50b2c5153731cf5541a2d0d64a17d6ecc669d74522923b42865f0cdc1fb733 |
| ORCID | 0000-0003-3159-9418 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.cosrev.2025.100837 |
| ParticipantIDs | crossref_primary_10_1016_j_cosrev_2025_100837 elsevier_sciencedirect_doi_10_1016_j_cosrev_2025_100837 |
| PublicationCentury | 2000 |
| PublicationDate | February 2026 2026-02-00 |
| PublicationDateYYYYMMDD | 2026-02-01 |
| PublicationDate_xml | – month: 02 year: 2026 text: February 2026 |
| PublicationDecade | 2020 |
| PublicationTitle | Computer science review |
| PublicationYear | 2026 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Brightwell, Winkler (b19) 2004 Arvind, Raman (b77) 2002 Barbanchon (b67) 2004; 319 Jerrum, Sinclair (b6) 1997 Lovász (b42) 2012; vol. 60 Curticapean (b31) 2015 Brand, Dell, Roth (b22) 2019; 81 Flum, Grohe (b32) 2006 Arnborg, Lagergren, Seese (b64) 1991; 12 Grohe, Kersting, Mladenov, Schweitzer (b111) 2021 Kreutzer (b72) 2011; vol. 379 Müller (b84) 2006; vol. 4169 Frick, Grohe (b66) 2001; 48 Weisfeiler, Leman (b109) 1968; 2 Torunczyk (b76) 2023 Alon, Yuster, Zwick (b78) 1995; 42 Seppelt (b114) 2023; vol. 272 Focke, Goldberg, Roth, Zivný (b91) 2022 Downey, Fellows (b33) 2013 Chen, Mengel (b35) 2016 Alon, Dao, Hajirasouliha, Hormozdiari, Sahinalp (b9) 2008; 24 Tran, Choi, Zhang (b12) 2013; 4 Dell, Lapinskas, Meeks (b90) 2022 Chen, Thurley, Weyer (b50) 2008 Nešetřil, de Mendez (b68) 2011; 32 Roth, Schmitt (b56) 2018 Chen, Huang, Kanj, Xia (b38) 2006; 72 Beame, Har-Peled, Ramamoorthy, Rashtchian, Sinha (b88) 2020; 16 Göbel, Goldberg, Roth (b116) 2024; 2 Roth, Schmitt, Wellnitz (b58) 2020 Lokshtanov, Saurabh, Zehavi (b23) 2021 Bera, Gishboliner, Levanzov, Seshadhri, Shapira (b105) 2022; 69 Dyer, Goldberg, Jerrum (b10) 2010; 76 Lanzinger, Barceló (b113) 2023 Bhattacharya, Bishnu, Ghosh, Mishra (b89) 2021; 65 Döring (b62) 2024 Brand, Dell, Husfeldt (b79) 2018 Jerrum, Meeks (b54) 2017; 37 Neuen (b115) 2024; vol. 289 Kasteleyn (b17) 1963; 4 Lokshtanov, Björklund, Saurabh, Zehavi (b81) 2021; 17 Curticapean, Dell, Marx (b26) 2017 McCartin (b25) 2006; 138 Artin (b39) 1948 Karp (b60) 1972 Milo, Shen-Orr, Itzkovitz, Kashtan, Chklovskii, Alon (b8) 2002; 298 Flum, Grohe (b24) 2004; 33 Impagliazzo, Paturi (b29) 2001; 62 Curticapean, Marx (b34) 2014 Montoya, Müller (b99) 2013; 52 Björklund, Dell, Husfeldt (b101) 2015 Curticapean (b106) 2024 Jaeger, Vertigan, Welsh (b4) 1990; 108 Morris, Ritzert, Fey, Hamilton, Lenssen, Rattan, Grohe (b112) 2019 Focke, Roth (b55) 2022 Bressan, Lanzinger, Roth (b40) 2023 Thilikos (b95) 2021; 39 Dell, Grohe, Rattan (b108) 2018; vol. 107 Koutis, Williams (b82) 2016; 59 Döring, Marx, Wellnitz (b59) 2023 Díaz, Serna, Thilikos (b43) 2002; 281 Roth (b61) 2019 Pratt (b80) 2019 Jansen, van der Steenhoven (b96) 2023; vol. 285 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh (b28) 2015 Kowaluk, Lingas, Lundell (b41) 2013; 27 Dalmau, Jonsson (b47) 2004; 329 Valiant, Vazirani (b83) 1986; 47 Dell, Husfeldt, Marx, Taslaman, Wahlen (b21) 2014; 10 Marx (b30) 2010; 6 Jerrum, Sinclair (b3) 1989; 18 Dvorák (b107) 2010; 64 Valiant (b1) 1979; 8 Toda (b5) 1991; 20 Provan, Ball (b18) 1983; 12 Dvorák, Král, Thomas (b73) 2010 Peyerimhoff, Roth, Schmitt, Stix, Vdovina (b103) 2021; vol. 202 Curticapean (b27) 2013; Vol. 7965 Dell, Lapinskas, Meeks (b87) 2022; 51 Curticapean, Dell, Husfeldt (b102) 2021; vol. 204 Jerrum, Meeks (b52) 2015; 7 Kasteleyn (b16) 1961; 27 Curticapean (b20) 2018; 261 Thurley (b93) 2007; vol. 4484 Chen, Chor, Fellows, Huang, Juedes, Kanj, Xia (b37) 2005; 201 Goldberg, Roth (b104) 2024; 86 Grohe, Kreutzer, Siebertz (b71) 2014 Thilikos, Wiederrecht (b14) 2022 Brand (b100) 2022; 176 Curticapean (b117) 2018; vol. 115 Roth, Schmitt, Wellnitz (b86) 2021; Vol. 198 Cai, Lu (b11) 2011; 77 Dyer, Greenhill (b7) 2000; 17 Ahmed, Neville, Rossi, Duffield (b13) 2015 Robertson, Seymour (b48) 1986; 41 Courcelle (b63) 1990 Nesetril, de Mendez (b70) 2012; vol. 28 Haak, Meier, Prakash, Rao (b98) 2023; 85 Grohe (b46) 2007; 54 Jerrum, Meeks (b51) 2015; 81 Arvind (b110) 2016; 120 Bressan, Roth (b92) 2021 Bressan, Goldberg, Meeks, Roth (b74) 2023; vol. 251 Eppstein (b65) 1999; 3 Roth, Schmitt, Wellnitz (b85) 2020 Torunczyk (b75) 2024; vol. 289 Lokshtanov, Misra, Saurabh, Zehavi (b97) 2024; vol. 287 Fomin, Lokshtanov, Saurabh, Pilipczuk, Wrochna (b45) 2018; 14 Adler, Adler (b69) 2014; 36 Valiant (b2) 1979; 8 Dell, Roth, Wellnitz (b36) 2019; Vol. 132 Kim, Serna, Thilikos (b94) 2018; vol. 123 Temperley, Fisher (b15) 1961; 6 Scott, Sorkin (b49) 2007; 4 Meeks (b53) 2016; 198 Dörfler, Roth, Schmitt, Wellnitz (b57) 2019; Vol. 138 Arnborg, Corneil, Proskurowski (b44) 1987; 8 Chen (10.1016/j.cosrev.2025.100837_b37) 2005; 201 Pratt (10.1016/j.cosrev.2025.100837_b80) 2019 Roth (10.1016/j.cosrev.2025.100837_b58) 2020 Chen (10.1016/j.cosrev.2025.100837_b35) 2016 Robertson (10.1016/j.cosrev.2025.100837_b48) 1986; 41 Torunczyk (10.1016/j.cosrev.2025.100837_b76) 2023 Seppelt (10.1016/j.cosrev.2025.100837_b114) 2023; vol. 272 Dell (10.1016/j.cosrev.2025.100837_b21) 2014; 10 Lovász (10.1016/j.cosrev.2025.100837_b42) 2012; vol. 60 Curticapean (10.1016/j.cosrev.2025.100837_b106) 2024 Kasteleyn (10.1016/j.cosrev.2025.100837_b16) 1961; 27 Thurley (10.1016/j.cosrev.2025.100837_b93) 2007; vol. 4484 Arvind (10.1016/j.cosrev.2025.100837_b110) 2016; 120 Provan (10.1016/j.cosrev.2025.100837_b18) 1983; 12 Alon (10.1016/j.cosrev.2025.100837_b78) 1995; 42 Alon (10.1016/j.cosrev.2025.100837_b9) 2008; 24 Scott (10.1016/j.cosrev.2025.100837_b49) 2007; 4 Fomin (10.1016/j.cosrev.2025.100837_b45) 2018; 14 Milo (10.1016/j.cosrev.2025.100837_b8) 2002; 298 Kasteleyn (10.1016/j.cosrev.2025.100837_b17) 1963; 4 Eppstein (10.1016/j.cosrev.2025.100837_b65) 1999; 3 McCartin (10.1016/j.cosrev.2025.100837_b25) 2006; 138 Lokshtanov (10.1016/j.cosrev.2025.100837_b97) 2024; vol. 287 Döring (10.1016/j.cosrev.2025.100837_b59) 2023 Curticapean (10.1016/j.cosrev.2025.100837_b20) 2018; 261 Impagliazzo (10.1016/j.cosrev.2025.100837_b29) 2001; 62 Dyer (10.1016/j.cosrev.2025.100837_b7) 2000; 17 Björklund (10.1016/j.cosrev.2025.100837_b101) 2015 Jaeger (10.1016/j.cosrev.2025.100837_b4) 1990; 108 Valiant (10.1016/j.cosrev.2025.100837_b2) 1979; 8 Roth (10.1016/j.cosrev.2025.100837_b86) 2021; Vol. 198 Roth (10.1016/j.cosrev.2025.100837_b85) 2020 Kreutzer (10.1016/j.cosrev.2025.100837_b72) 2011; vol. 379 Montoya (10.1016/j.cosrev.2025.100837_b99) 2013; 52 Curticapean (10.1016/j.cosrev.2025.100837_b31) 2015 Torunczyk (10.1016/j.cosrev.2025.100837_b75) 2024; vol. 289 Bressan (10.1016/j.cosrev.2025.100837_b40) 2023 Lokshtanov (10.1016/j.cosrev.2025.100837_b23) 2021 Adler (10.1016/j.cosrev.2025.100837_b69) 2014; 36 Peyerimhoff (10.1016/j.cosrev.2025.100837_b103) 2021; vol. 202 Thilikos (10.1016/j.cosrev.2025.100837_b14) 2022 Jerrum (10.1016/j.cosrev.2025.100837_b54) 2017; 37 Marx (10.1016/j.cosrev.2025.100837_b30) 2010; 6 Müller (10.1016/j.cosrev.2025.100837_b84) 2006; vol. 4169 Bressan (10.1016/j.cosrev.2025.100837_b92) 2021 Roth (10.1016/j.cosrev.2025.100837_b61) 2019 Flum (10.1016/j.cosrev.2025.100837_b32) 2006 Artin (10.1016/j.cosrev.2025.100837_b39) 1948 Koutis (10.1016/j.cosrev.2025.100837_b82) 2016; 59 Roth (10.1016/j.cosrev.2025.100837_b56) 2018 Dyer (10.1016/j.cosrev.2025.100837_b10) 2010; 76 Goldberg (10.1016/j.cosrev.2025.100837_b104) 2024; 86 Nešetřil (10.1016/j.cosrev.2025.100837_b68) 2011; 32 Jerrum (10.1016/j.cosrev.2025.100837_b3) 1989; 18 Dell (10.1016/j.cosrev.2025.100837_b108) 2018; vol. 107 Jansen (10.1016/j.cosrev.2025.100837_b96) 2023; vol. 285 Curticapean (10.1016/j.cosrev.2025.100837_b26) 2017 Arvind (10.1016/j.cosrev.2025.100837_b77) 2002 Toda (10.1016/j.cosrev.2025.100837_b5) 1991; 20 Brand (10.1016/j.cosrev.2025.100837_b100) 2022; 176 Cai (10.1016/j.cosrev.2025.100837_b11) 2011; 77 Brand (10.1016/j.cosrev.2025.100837_b79) 2018 Curticapean (10.1016/j.cosrev.2025.100837_b27) 2013; Vol. 7965 Beame (10.1016/j.cosrev.2025.100837_b88) 2020; 16 Cygan (10.1016/j.cosrev.2025.100837_b28) 2015 Tran (10.1016/j.cosrev.2025.100837_b12) 2013; 4 Jerrum (10.1016/j.cosrev.2025.100837_b6) 1997 Dell (10.1016/j.cosrev.2025.100837_b90) 2022 Dell (10.1016/j.cosrev.2025.100837_b36) 2019; Vol. 132 Weisfeiler (10.1016/j.cosrev.2025.100837_b109) 1968; 2 Kowaluk (10.1016/j.cosrev.2025.100837_b41) 2013; 27 Ahmed (10.1016/j.cosrev.2025.100837_b13) 2015 Focke (10.1016/j.cosrev.2025.100837_b55) 2022 Döring (10.1016/j.cosrev.2025.100837_b62) 2024 Brand (10.1016/j.cosrev.2025.100837_b22) 2019; 81 Karp (10.1016/j.cosrev.2025.100837_b60) 1972 Dalmau (10.1016/j.cosrev.2025.100837_b47) 2004; 329 Kim (10.1016/j.cosrev.2025.100837_b94) 2018; vol. 123 Bera (10.1016/j.cosrev.2025.100837_b105) 2022; 69 Göbel (10.1016/j.cosrev.2025.100837_b116) 2024; 2 Haak (10.1016/j.cosrev.2025.100837_b98) 2023; 85 Dvorák (10.1016/j.cosrev.2025.100837_b107) 2010; 64 Valiant (10.1016/j.cosrev.2025.100837_b1) 1979; 8 Lanzinger (10.1016/j.cosrev.2025.100837_b113) 2023 Bressan (10.1016/j.cosrev.2025.100837_b74) 2023; vol. 251 Chen (10.1016/j.cosrev.2025.100837_b38) 2006; 72 Meeks (10.1016/j.cosrev.2025.100837_b53) 2016; 198 Courcelle (10.1016/j.cosrev.2025.100837_b63) 1990 Díaz (10.1016/j.cosrev.2025.100837_b43) 2002; 281 Frick (10.1016/j.cosrev.2025.100837_b66) 2001; 48 Valiant (10.1016/j.cosrev.2025.100837_b83) 1986; 47 Curticapean (10.1016/j.cosrev.2025.100837_b34) 2014 Grohe (10.1016/j.cosrev.2025.100837_b46) 2007; 54 Jerrum (10.1016/j.cosrev.2025.100837_b51) 2015; 81 Neuen (10.1016/j.cosrev.2025.100837_b115) 2024; vol. 289 Dörfler (10.1016/j.cosrev.2025.100837_b57) 2019; Vol. 138 Flum (10.1016/j.cosrev.2025.100837_b24) 2004; 33 Dell (10.1016/j.cosrev.2025.100837_b87) 2022; 51 Curticapean (10.1016/j.cosrev.2025.100837_b117) 2018; vol. 115 Brightwell (10.1016/j.cosrev.2025.100837_b19) 2004 Arnborg (10.1016/j.cosrev.2025.100837_b44) 1987; 8 Lokshtanov (10.1016/j.cosrev.2025.100837_b81) 2021; 17 Dvorák (10.1016/j.cosrev.2025.100837_b73) 2010 Focke (10.1016/j.cosrev.2025.100837_b91) 2022 Thilikos (10.1016/j.cosrev.2025.100837_b95) 2021; 39 Jerrum (10.1016/j.cosrev.2025.100837_b52) 2015; 7 Chen (10.1016/j.cosrev.2025.100837_b50) 2008 Downey (10.1016/j.cosrev.2025.100837_b33) 2013 Curticapean (10.1016/j.cosrev.2025.100837_b102) 2021; vol. 204 Temperley (10.1016/j.cosrev.2025.100837_b15) 1961; 6 Arnborg (10.1016/j.cosrev.2025.100837_b64) 1991; 12 Nesetril (10.1016/j.cosrev.2025.100837_b70) 2012; vol. 28 Barbanchon (10.1016/j.cosrev.2025.100837_b67) 2004; 319 Grohe (10.1016/j.cosrev.2025.100837_b71) 2014 Morris (10.1016/j.cosrev.2025.100837_b112) 2019 Bhattacharya (10.1016/j.cosrev.2025.100837_b89) 2021; 65 Grohe (10.1016/j.cosrev.2025.100837_b111) 2021 |
| References_xml | – start-page: 133 year: 2010 end-page: 142 ident: b73 article-title: Deciding first-order properties for sparse graphs publication-title: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA – start-page: 130 year: 2014 end-page: 139 ident: b34 article-title: Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts publication-title: Proc. of IEEE FOCS – volume: vol. 272 start-page: 82:1 year: 2023 end-page: 82:15 ident: b114 article-title: Logical equivalences, homomorphism indistinguishability, and forbidden minors publication-title: 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 To September 1, 2023, Bordeaux, France – volume: 4 start-page: 287 year: 1963 end-page: 293 ident: b17 article-title: Dimer statistics and phase transitions publication-title: J. Math. Phys. – volume: 72 start-page: 1346 year: 2006 end-page: 1367 ident: b38 article-title: Strong computational lower bounds via parameterized complexity publication-title: J. Comput. System Sci. – volume: 33 start-page: 892 year: 2004 end-page: 922 ident: b24 article-title: The parameterized complexity of counting problems publication-title: SIAM J. Comput. – volume: 10 start-page: 21:1 year: 2014 end-page: 21:32 ident: b21 article-title: Exponential time complexity of the permanent and the tutte polynomial publication-title: ACM Trans. Algorithms – volume: 3 start-page: 1 year: 1999 end-page: 27 ident: b65 article-title: Subgraph isomorphism in planar graphs and related problems publication-title: J. Graph Algorithms Appl. – volume: vol. 289 start-page: 3:1 year: 2024 ident: b75 article-title: Structurally tractable graph classes (invited talk) publication-title: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France – volume: 42 start-page: 844 year: 1995 end-page: 856 ident: b78 article-title: Color-coding publication-title: J. ACM – volume: 16 start-page: 52:1 year: 2020 end-page: 52:27 ident: b88 article-title: Edge estimation with independent set oracles publication-title: ACM Trans. Algorithms – volume: Vol. 7965 start-page: 352 year: 2013 end-page: 363 ident: b27 article-title: Counting matchings of size k is #W[1]-hard publication-title: Proc. of ICALP – start-page: 587 year: 2008 end-page: 596 ident: b50 article-title: Understanding the complexity of induced subgraph isomorphisms publication-title: Proc. of ICALP – volume: 319 start-page: 455 year: 2004 end-page: 482 ident: b67 article-title: On unique graph 3-colorability and parsimonious reductions in the plane publication-title: Theoret. Comput. Sci. – volume: 69 start-page: 23:1 year: 2022 end-page: 23:21 ident: b105 article-title: Counting subgraphs in degenerate graphs publication-title: J. ACM – year: 2013 ident: b33 article-title: Fundamentals of Parameterized Complexity – volume: 32 start-page: 600 year: 2011 end-page: 617 ident: b68 article-title: On nowhere dense graphs publication-title: European J. Combin. – volume: 41 start-page: 92 year: 1986 end-page: 114 ident: b48 article-title: Graph minors. V. Excluding a planar graph publication-title: J. Comb. Theory Ser. B – volume: vol. 285 start-page: 27:1 year: 2023 end-page: 27:15 ident: b96 article-title: Kernelization for counting problems on graphs: Preserving the number of minimum solutions publication-title: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, the Netherlands – volume: Vol. 138 start-page: 26:1 year: 2019 end-page: 26:14 ident: b57 article-title: Counting induced subgraphs: An algebraic approach to #W[1]-hardness publication-title: Proc. of MFCS – volume: vol. 123 start-page: 20:1 year: 2018 end-page: 20:13 ident: b94 article-title: Data-compression for parametrized counting problems on sparse graphs publication-title: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan – start-page: 1 year: 2015 end-page: 10 ident: b13 article-title: Efficient graphlet counting for large networks publication-title: Proc. of IEEE ICDM – year: 2015 ident: b28 article-title: Parameterized Algorithms – year: 2022 ident: b90 article-title: Nearly optimal independence oracle algorithms for edge estimation in hypergraphs – volume: 24 start-page: i241 year: 2008 end-page: i249 ident: b9 article-title: Biomolecular network motif counting and discovery by color coding publication-title: Bioinformatics – start-page: 151 year: 2018 end-page: 164 ident: b79 article-title: Extensor-coding publication-title: Proc. of ACM STOC – year: 2020 ident: b85 article-title: Detecting and counting small subgraphs, and evaluating a parameterized tutte polynomial: Lower bounds via toroidal grids and cayley graph expanders – year: 2004 ident: b19 article-title: Note on counting Eulerian circuits – volume: 59 start-page: 98 year: 2016 end-page: 105 ident: b82 article-title: Algebraic fingerprints for faster algorithms publication-title: Commun. ACM – start-page: 4602 year: 2019 end-page: 4609 ident: b112 article-title: Weisfeiler and Leman go neural: Higher-order graph neural networks publication-title: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, the Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019 – volume: 14 start-page: 34:1 year: 2018 end-page: 34:45 ident: b45 article-title: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth publication-title: ACM Trans. Algorithms – volume: Vol. 132 start-page: 113:1 year: 2019 end-page: 113:15 ident: b36 article-title: Counting answers to existential questions publication-title: Proc. of ICALP – volume: 6 start-page: 1061 year: 1961 end-page: 1063 ident: b15 article-title: Dimer problem in statistical mechanics – an exact result publication-title: Phil. Mag. – start-page: 24:1 year: 2018 end-page: 24:14 ident: b56 article-title: Counting induced subgraphs: A topological approach to #W[1]-hardness publication-title: Proc. of IPEC – volume: 329 start-page: 315 year: 2004 end-page: 323 ident: b47 article-title: The complexity of counting homomorphisms seen from the other side publication-title: Theoret. Comput. Sci. – volume: vol. 251 start-page: 27:1 year: 2023 end-page: 27:14 ident: b74 article-title: Counting subgraphs in somewhere dense graphs publication-title: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA – volume: 51 start-page: 849 year: 2022 end-page: 899 ident: b87 article-title: Approximately counting and sampling small witnesses using a colorful decision oracle publication-title: SIAM J. Comput. – volume: 36 start-page: 322 year: 2014 end-page: 330 ident: b69 article-title: Interpreting nowhere dense graph classes as a classical notion of model theory publication-title: European J. Combin. – volume: 20 start-page: 865 year: 1991 end-page: 877 ident: b5 article-title: PP is as hard as the polynomial-time hierarchy publication-title: SIAM J. Comput. – volume: 4 start-page: 1 year: 2013 end-page: 8 ident: b12 article-title: Counting motifs in the human interactome publication-title: Nat. Commun. – start-page: 210 year: 2017 end-page: 223 ident: b26 article-title: Homomorphisms are a good basis for counting small subgraphs publication-title: Proc. of ACM STOC – volume: 2 start-page: 12 year: 1968 end-page: 16 ident: b109 article-title: The reduction of a graph to canonical form and the algebra which appears therein publication-title: NTI Ser. – volume: 201 start-page: 216 year: 2005 end-page: 231 ident: b37 article-title: Tight lower bounds for certain parameterized NP-hard problems publication-title: Inform. and Comput. – volume: 12 start-page: 308 year: 1991 end-page: 340 ident: b64 article-title: Easy problems for tree-decomposable graphs publication-title: J. Algorithms – start-page: 806 year: 2019 end-page: 823 ident: b80 article-title: Waring rank, parameterized and exact algorithms publication-title: 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019 – volume: 12 start-page: 777 year: 1983 end-page: 788 ident: b18 article-title: The complexity of counting cuts and of computing the probability that a graph is connected publication-title: SIAM J. Comput. – volume: 17 start-page: 26:1 year: 2021 end-page: 26:44 ident: b81 article-title: Approximate counting of publication-title: ACM Trans. Algorithms – start-page: 85 year: 1972 end-page: 103 ident: b60 article-title: Reducibility among combinatorial problems publication-title: Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA – volume: 176 year: 2022 ident: b100 article-title: A note on algebraic techniques for subgraph detection publication-title: Inform. Process. Lett. – start-page: 193 year: 1990 end-page: 242 ident: b63 article-title: Graph rewriting: An algebraic and logic approach publication-title: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) – volume: vol. 4484 start-page: 703 year: 2007 end-page: 714 ident: b93 article-title: Kernelizations for parameterized counting problems publication-title: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings – year: 2021 ident: b111 article-title: Color refinement and its applications publication-title: An Introduction to Lifted Probabilistic Inference – volume: vol. 287 start-page: 77:1 year: 2024 end-page: 77:23 ident: b97 article-title: Kernelization of counting problems publication-title: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 To February 2, 2024, Berkeley, CA, USA – start-page: 89 year: 2014 end-page: 98 ident: b71 article-title: Deciding first-order properties of nowhere dense graphs publication-title: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014 – year: 2023 ident: b113 article-title: On the power of the Weisfeiler-Leman test for graph motif parameters – volume: 64 start-page: 330 year: 2010 end-page: 342 ident: b107 article-title: On recognizing graphs by numbers of homomorphisms publication-title: J. Graph Theory – volume: 81 start-page: 541 year: 2019 end-page: 556 ident: b22 article-title: Fine-grained dichotomies for the Tutte plane and Boolean #CSP publication-title: Algorithmica – volume: vol. 289 start-page: 53:1 year: 2024 end-page: 53:12 ident: b115 article-title: Homomorphism-distinguishing closedness for graphs of bounded tree-width publication-title: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France – start-page: 1069 year: 2022 end-page: 1080 ident: b14 article-title: Killing a vortex publication-title: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022 – start-page: 453 year: 2002 end-page: 464 ident: b77 article-title: Approximation algorithms for some parameterized counting problems publication-title: Proc. of ISAAC – start-page: 482 year: 1997 end-page: 520 ident: b6 article-title: The Markov chain Monte Carlo method: An approach to approximate counting and integration publication-title: Approximation Algorithms for NP-Hard Problems – volume: 17 start-page: 260 year: 2000 end-page: 289 ident: b7 article-title: The complexity of counting graph homomorphisms publication-title: Random Structures Algorithms – year: 2023 ident: b59 article-title: Counting small induced subgraphs with edge-monotone properties – volume: 8 start-page: 277 year: 1987 end-page: 284 ident: b44 article-title: Complexity of finding embeddings in a k-tree publication-title: SIAM J. Algebraic Discret. Methods – year: 2019 ident: b61 article-title: Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications – volume: 6 start-page: 85 year: 2010 end-page: 112 ident: b30 article-title: Can you beat treewidth? publication-title: Theory Comput. – volume: 39 year: 2021 ident: b95 article-title: Compactors for parameterized counting problems publication-title: Comput. Sci. Rev. – volume: 8 start-page: 410 year: 1979 end-page: 421 ident: b2 article-title: The complexity of enumeration and reliability problems publication-title: SIAM J. Comput. – volume: 298 start-page: 824 year: 2002 end-page: 827 ident: b8 article-title: Network motifs: Simple building blocks of complex networks publication-title: Science – volume: 81 start-page: 702 year: 2015 end-page: 716 ident: b51 article-title: The parameterised complexity of counting connected subgraphs and graph motifs publication-title: J. Comput. System Sci. – volume: 48 start-page: 1184 year: 2001 end-page: 1206 ident: b66 article-title: Deciding first-order properties of locally tree-decomposable structures publication-title: J. ACM – volume: 27 start-page: 892 year: 2013 end-page: 909 ident: b41 article-title: Counting and detecting small subgraphs via equations publication-title: SIAM J. Discret. Math. – start-page: 276 year: 2021 end-page: 285 ident: b92 article-title: Exact and approximate pattern counting in degenerate graphs: New algorithms, hardness results, and complexity dichotomies publication-title: Proc. of IEEE FOCS – start-page: 315 year: 2022 end-page: 324 ident: b91 article-title: Approximately counting answers to conjunctive queries with disequalities and negations publication-title: Proc. of ACM PODS – volume: vol. 202 start-page: 84:1 year: 2021 end-page: 84:15 ident: b103 article-title: Parameterized (modular) counting and Cayley graph expanders publication-title: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia – volume: vol. 60 year: 2012 ident: b42 publication-title: Large Networks and Graph Limits – volume: 54 start-page: 1:1 year: 2007 end-page: 1:24 ident: b46 article-title: The complexity of homomorphism and constraint satisfaction problems seen from the other side publication-title: J. ACM – volume: 2 start-page: 86 year: 2024 ident: b116 article-title: The weisfeiler-leman dimension of conjunctive queries publication-title: Proc. ACM Manag. Data – year: 2015 ident: b31 article-title: The Simple, Little and Slow Things Count: On Parameterized Counting Complexity – start-page: 1543 year: 2022 end-page: 1551 ident: b55 article-title: Counting small induced subgraphs with hereditary properties publication-title: Proc. of ACM STOC – volume: vol. 107 start-page: 40:1 year: 2018 end-page: 40:14 ident: b108 article-title: Lovász meets Weisfeiler and Leman publication-title: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic – year: 2006 ident: b32 article-title: Parameterized Complexity Theory – start-page: 1854 year: 2024 end-page: 1871 ident: b106 article-title: Count on CFI graphs for #P-hardness publication-title: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024 – volume: 37 start-page: 965 year: 2017 end-page: 990 ident: b54 article-title: The parameterised complexity of counting even and odd induced subgraphs publication-title: Combinatorica – volume: 4 start-page: 260 year: 2007 end-page: 287 ident: b49 article-title: Linear-programming design and analysis of fast algorithms for Max 2-CSP publication-title: Discrete Optim. – volume: 85 start-page: 2923 year: 2023 end-page: 2961 ident: b98 article-title: Parameterised counting in logspace publication-title: Algorithmica – volume: 52 start-page: 221 year: 2013 end-page: 270 ident: b99 article-title: Parameterized random complexity publication-title: Theory Comput. Syst. – volume: vol. 4169 start-page: 50 year: 2006 end-page: 59 ident: b84 article-title: Randomized approximations of parameterized counting problems publication-title: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings – volume: Vol. 198 start-page: 108:1 year: 2021 end-page: 108:16 ident: b86 article-title: Detecting and counting small subgraphs, and evaluating a parameterized tutte polynomial: Lower bounds via toroidal grids and cayley graph expanders publication-title: Proc. of ICALP – volume: vol. 28 year: 2012 ident: b70 publication-title: Sparsity - Graphs, Structures, and Algorithms – volume: 77 start-page: 41 year: 2011 end-page: 61 ident: b11 article-title: Holographic algorithms: From art to science publication-title: J. Comput. System Sci. – start-page: 1356 year: 2020 end-page: 1367 ident: b58 article-title: Counting small induced subgraphs satisfying monotone properties publication-title: Proc. of IEEE FOCS – volume: 138 start-page: 147 year: 2006 end-page: 182 ident: b25 article-title: Parameterized counting problems publication-title: Ann. Pure Appl. Logic – volume: vol. 379 start-page: 177 year: 2011 end-page: 270 ident: b72 article-title: Algorithmic meta-theorems publication-title: Finite and Algorithmic Model Theory – volume: 261 start-page: 265 year: 2018 end-page: 280 ident: b20 article-title: Block interpolation: A framework for tight exponential-time counting complexity publication-title: Inform. and Comput. – volume: 76 start-page: 267 year: 2010 end-page: 277 ident: b10 article-title: An approximation trichotomy for Boolean #CSP publication-title: J. Comput. System Sci. – volume: vol. 115 start-page: 1:1 year: 2018 end-page: 1:18 ident: b117 article-title: Counting problems in parameterized complexity publication-title: 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland – volume: 27 start-page: 1209 year: 1961 end-page: 1225 ident: b16 article-title: The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice publication-title: Physica – start-page: 542 year: 2023 end-page: 552 ident: b40 article-title: The complexity of pattern counting in directed graphs, parameterised by the outdegree publication-title: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023 – volume: 7 start-page: 11:1 year: 2015 end-page: 11:18 ident: b52 article-title: Some hard families of parameterized counting problems publication-title: TOCT – start-page: 231 year: 2015 end-page: 242 ident: b101 article-title: The parity of set systems under random restrictions with applications to exponential time problems publication-title: Proc. ICALP 2015, Part I – year: 2023 ident: b76 – volume: 62 start-page: 367 year: 2001 end-page: 375 ident: b29 article-title: On the complexity of k-SAT publication-title: J. Comput. System Sci. – volume: 8 start-page: 189 year: 1979 end-page: 201 ident: b1 article-title: The complexity of computing the permanent publication-title: Theoret. Comput. Sci. – volume: 108 start-page: 35 year: 1990 end-page: 53 ident: b4 article-title: On the computational complexity of the Jones and Tutte polynomials publication-title: Math. Proc. Cambridge Philos. Soc. – volume: 120 year: 2016 ident: b110 article-title: The Weisfeiler-Lehman procedure publication-title: Bull. EATCS – year: 2024 ident: b62 – start-page: 315 year: 2016 end-page: 326 ident: b35 article-title: Counting answers to existential positive queries: A complexity classification publication-title: Proc. of ACM PODS – volume: 47 start-page: 85 year: 1986 end-page: 93 ident: b83 article-title: NP is as easy as detecting unique solutions publication-title: Theoret. Comput. Sci. – volume: 281 start-page: 291 year: 2002 end-page: 309 ident: b43 article-title: Counting H-colorings of partial k-trees publication-title: Theoret. Comput. Sci. – volume: 18 start-page: 1149 year: 1989 end-page: 1178 ident: b3 article-title: Approximating the permanent publication-title: SIAM J. Comput. – volume: 198 start-page: 170 year: 2016 end-page: 194 ident: b53 article-title: The challenges of unbounded treewidth in parameterised subgraph counting problems publication-title: Discrete Appl. Math. – volume: 65 start-page: 1165 year: 2021 end-page: 1192 ident: b89 article-title: On triangle estimation using tripartite independent set queries publication-title: Theory Comput. Syst. – start-page: 179 year: 2021 end-page: 198 ident: b23 article-title: Efficient computation of representative weight functions with applications to parameterized counting (extended version) publication-title: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021 – volume: vol. 204 start-page: 34:1 year: 2021 end-page: 34:17 ident: b102 article-title: Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths publication-title: 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference) – year: 1948 ident: b39 publication-title: Galois Theory – volume: 86 start-page: 944 year: 2024 end-page: 1005 ident: b104 article-title: Parameterised and fine-grained subgraph counting, modulo 2 publication-title: Algorithmica – volume: 201 start-page: 216 issue: 2 year: 2005 ident: 10.1016/j.cosrev.2025.100837_b37 article-title: Tight lower bounds for certain parameterized NP-hard problems publication-title: Inform. and Comput. doi: 10.1016/j.ic.2005.05.001 – year: 2015 ident: 10.1016/j.cosrev.2025.100837_b31 – year: 2006 ident: 10.1016/j.cosrev.2025.100837_b32 – volume: 36 start-page: 322 year: 2014 ident: 10.1016/j.cosrev.2025.100837_b69 article-title: Interpreting nowhere dense graph classes as a classical notion of model theory publication-title: European J. Combin. doi: 10.1016/j.ejc.2013.06.048 – volume: vol. 272 start-page: 82:1 year: 2023 ident: 10.1016/j.cosrev.2025.100837_b114 article-title: Logical equivalences, homomorphism indistinguishability, and forbidden minors – volume: Vol. 138 start-page: 26:1 year: 2019 ident: 10.1016/j.cosrev.2025.100837_b57 article-title: Counting induced subgraphs: An algebraic approach to #W[1]-hardness – volume: 298 start-page: 824 issue: 5594 year: 2002 ident: 10.1016/j.cosrev.2025.100837_b8 article-title: Network motifs: Simple building blocks of complex networks publication-title: Science doi: 10.1126/science.298.5594.824 – volume: vol. 60 year: 2012 ident: 10.1016/j.cosrev.2025.100837_b42 – volume: 3 start-page: 1 issue: 3 year: 1999 ident: 10.1016/j.cosrev.2025.100837_b65 article-title: Subgraph isomorphism in planar graphs and related problems publication-title: J. Graph Algorithms Appl. doi: 10.7155/jgaa.00014 – year: 2004 ident: 10.1016/j.cosrev.2025.100837_b19 – start-page: 85 year: 1972 ident: 10.1016/j.cosrev.2025.100837_b60 article-title: Reducibility among combinatorial problems – volume: 261 start-page: 265 year: 2018 ident: 10.1016/j.cosrev.2025.100837_b20 article-title: Block interpolation: A framework for tight exponential-time counting complexity publication-title: Inform. and Comput. doi: 10.1016/j.ic.2018.02.008 – volume: vol. 107 start-page: 40:1 year: 2018 ident: 10.1016/j.cosrev.2025.100837_b108 article-title: Lovász meets Weisfeiler and Leman – volume: 14 start-page: 34:1 issue: 3 year: 2018 ident: 10.1016/j.cosrev.2025.100837_b45 article-title: Fully polynomial-time parameterized computations for graphs and matrices of low treewidth publication-title: ACM Trans. Algorithms doi: 10.1145/3186898 – start-page: 179 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b23 article-title: Efficient computation of representative weight functions with applications to parameterized counting (extended version) – volume: 54 start-page: 1:1 issue: 1 year: 2007 ident: 10.1016/j.cosrev.2025.100837_b46 article-title: The complexity of homomorphism and constraint satisfaction problems seen from the other side publication-title: J. ACM doi: 10.1145/1206035.1206036 – volume: vol. 28 year: 2012 ident: 10.1016/j.cosrev.2025.100837_b70 – volume: 59 start-page: 98 issue: 1 year: 2016 ident: 10.1016/j.cosrev.2025.100837_b82 article-title: Algebraic fingerprints for faster algorithms publication-title: Commun. ACM doi: 10.1145/2742544 – year: 2023 ident: 10.1016/j.cosrev.2025.100837_b113 – volume: vol. 251 start-page: 27:1 year: 2023 ident: 10.1016/j.cosrev.2025.100837_b74 article-title: Counting subgraphs in somewhere dense graphs – volume: 32 start-page: 600 issue: 4 year: 2011 ident: 10.1016/j.cosrev.2025.100837_b68 article-title: On nowhere dense graphs publication-title: European J. Combin. doi: 10.1016/j.ejc.2011.01.006 – volume: 64 start-page: 330 issue: 4 year: 2010 ident: 10.1016/j.cosrev.2025.100837_b107 article-title: On recognizing graphs by numbers of homomorphisms publication-title: J. Graph Theory doi: 10.1002/jgt.20461 – start-page: 542 year: 2023 ident: 10.1016/j.cosrev.2025.100837_b40 article-title: The complexity of pattern counting in directed graphs, parameterised by the outdegree – volume: 319 start-page: 455 issue: 1–3 year: 2004 ident: 10.1016/j.cosrev.2025.100837_b67 article-title: On unique graph 3-colorability and parsimonious reductions in the plane publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2004.02.003 – start-page: 130 year: 2014 ident: 10.1016/j.cosrev.2025.100837_b34 article-title: Complexity of counting subgraphs: Only the boundedness of the vertex-cover number counts – volume: 24 start-page: i241 issue: 13 year: 2008 ident: 10.1016/j.cosrev.2025.100837_b9 article-title: Biomolecular network motif counting and discovery by color coding publication-title: Bioinformatics doi: 10.1093/bioinformatics/btn163 – volume: 198 start-page: 170 year: 2016 ident: 10.1016/j.cosrev.2025.100837_b53 article-title: The challenges of unbounded treewidth in parameterised subgraph counting problems publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2015.06.019 – year: 2020 ident: 10.1016/j.cosrev.2025.100837_b85 – start-page: 315 year: 2022 ident: 10.1016/j.cosrev.2025.100837_b91 article-title: Approximately counting answers to conjunctive queries with disequalities and negations – start-page: 1356 year: 2020 ident: 10.1016/j.cosrev.2025.100837_b58 article-title: Counting small induced subgraphs satisfying monotone properties – start-page: 1543 year: 2022 ident: 10.1016/j.cosrev.2025.100837_b55 article-title: Counting small induced subgraphs with hereditary properties – volume: 65 start-page: 1165 issue: 8 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b89 article-title: On triangle estimation using tripartite independent set queries publication-title: Theory Comput. Syst. doi: 10.1007/s00224-021-10043-y – volume: 48 start-page: 1184 issue: 6 year: 2001 ident: 10.1016/j.cosrev.2025.100837_b66 article-title: Deciding first-order properties of locally tree-decomposable structures publication-title: J. ACM doi: 10.1145/504794.504798 – volume: vol. 287 start-page: 77:1 year: 2024 ident: 10.1016/j.cosrev.2025.100837_b97 article-title: Kernelization of counting problems – start-page: 193 year: 1990 ident: 10.1016/j.cosrev.2025.100837_b63 article-title: Graph rewriting: An algebraic and logic approach – volume: 86 start-page: 944 issue: 4 year: 2024 ident: 10.1016/j.cosrev.2025.100837_b104 article-title: Parameterised and fine-grained subgraph counting, modulo 2 publication-title: Algorithmica doi: 10.1007/s00453-023-01178-0 – year: 2015 ident: 10.1016/j.cosrev.2025.100837_b28 – year: 2023 ident: 10.1016/j.cosrev.2025.100837_b76 – volume: 77 start-page: 41 issue: 1 year: 2011 ident: 10.1016/j.cosrev.2025.100837_b11 article-title: Holographic algorithms: From art to science publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2010.06.005 – start-page: 4602 year: 2019 ident: 10.1016/j.cosrev.2025.100837_b112 article-title: Weisfeiler and Leman go neural: Higher-order graph neural networks – volume: 42 start-page: 844 issue: 4 year: 1995 ident: 10.1016/j.cosrev.2025.100837_b78 article-title: Color-coding publication-title: J. ACM doi: 10.1145/210332.210337 – start-page: 482 year: 1997 ident: 10.1016/j.cosrev.2025.100837_b6 article-title: The Markov chain Monte Carlo method: An approach to approximate counting and integration – volume: 33 start-page: 892 issue: 4 year: 2004 ident: 10.1016/j.cosrev.2025.100837_b24 article-title: The parameterized complexity of counting problems publication-title: SIAM J. Comput. doi: 10.1137/S0097539703427203 – volume: 8 start-page: 189 year: 1979 ident: 10.1016/j.cosrev.2025.100837_b1 article-title: The complexity of computing the permanent publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(79)90044-6 – volume: 120 year: 2016 ident: 10.1016/j.cosrev.2025.100837_b110 article-title: The Weisfeiler-Lehman procedure publication-title: Bull. EATCS – volume: vol. 285 start-page: 27:1 year: 2023 ident: 10.1016/j.cosrev.2025.100837_b96 article-title: Kernelization for counting problems on graphs: Preserving the number of minimum solutions – year: 2024 ident: 10.1016/j.cosrev.2025.100837_b62 – start-page: 276 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b92 article-title: Exact and approximate pattern counting in degenerate graphs: New algorithms, hardness results, and complexity dichotomies – volume: vol. 289 start-page: 53:1 year: 2024 ident: 10.1016/j.cosrev.2025.100837_b115 article-title: Homomorphism-distinguishing closedness for graphs of bounded tree-width – volume: 69 start-page: 23:1 issue: 3 year: 2022 ident: 10.1016/j.cosrev.2025.100837_b105 article-title: Counting subgraphs in degenerate graphs publication-title: J. ACM doi: 10.1145/3520240 – year: 2023 ident: 10.1016/j.cosrev.2025.100837_b59 – volume: 18 start-page: 1149 issue: 6 year: 1989 ident: 10.1016/j.cosrev.2025.100837_b3 article-title: Approximating the permanent publication-title: SIAM J. Comput. doi: 10.1137/0218077 – volume: 85 start-page: 2923 issue: 10 year: 2023 ident: 10.1016/j.cosrev.2025.100837_b98 article-title: Parameterised counting in logspace publication-title: Algorithmica doi: 10.1007/s00453-023-01114-2 – start-page: 453 year: 2002 ident: 10.1016/j.cosrev.2025.100837_b77 article-title: Approximation algorithms for some parameterized counting problems – volume: 4 start-page: 1 issue: 1 year: 2013 ident: 10.1016/j.cosrev.2025.100837_b12 article-title: Counting motifs in the human interactome publication-title: Nat. Commun. doi: 10.1038/ncomms3241 – volume: 176 year: 2022 ident: 10.1016/j.cosrev.2025.100837_b100 article-title: A note on algebraic techniques for subgraph detection publication-title: Inform. Process. Lett. doi: 10.1016/j.ipl.2021.106242 – start-page: 1069 year: 2022 ident: 10.1016/j.cosrev.2025.100837_b14 article-title: Killing a vortex – volume: Vol. 198 start-page: 108:1 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b86 article-title: Detecting and counting small subgraphs, and evaluating a parameterized tutte polynomial: Lower bounds via toroidal grids and cayley graph expanders – volume: 81 start-page: 702 issue: 4 year: 2015 ident: 10.1016/j.cosrev.2025.100837_b51 article-title: The parameterised complexity of counting connected subgraphs and graph motifs publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2014.11.015 – volume: 6 start-page: 1061 issue: 68 year: 1961 ident: 10.1016/j.cosrev.2025.100837_b15 article-title: Dimer problem in statistical mechanics – an exact result publication-title: Phil. Mag. doi: 10.1080/14786436108243366 – volume: 2 start-page: 86 issue: 2 year: 2024 ident: 10.1016/j.cosrev.2025.100837_b116 article-title: The weisfeiler-leman dimension of conjunctive queries publication-title: Proc. ACM Manag. Data doi: 10.1145/3651587 – volume: 2 start-page: 12 issue: 9 year: 1968 ident: 10.1016/j.cosrev.2025.100837_b109 article-title: The reduction of a graph to canonical form and the algebra which appears therein publication-title: NTI Ser. – start-page: 210 year: 2017 ident: 10.1016/j.cosrev.2025.100837_b26 article-title: Homomorphisms are a good basis for counting small subgraphs – year: 2019 ident: 10.1016/j.cosrev.2025.100837_b61 – volume: 27 start-page: 1209 issue: 12 year: 1961 ident: 10.1016/j.cosrev.2025.100837_b16 article-title: The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice publication-title: Physica doi: 10.1016/0031-8914(61)90063-5 – year: 1948 ident: 10.1016/j.cosrev.2025.100837_b39 – volume: 8 start-page: 410 issue: 3 year: 1979 ident: 10.1016/j.cosrev.2025.100837_b2 article-title: The complexity of enumeration and reliability problems publication-title: SIAM J. Comput. doi: 10.1137/0208032 – volume: 47 start-page: 85 issue: 3 year: 1986 ident: 10.1016/j.cosrev.2025.100837_b83 article-title: NP is as easy as detecting unique solutions publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(86)90135-0 – volume: vol. 4169 start-page: 50 year: 2006 ident: 10.1016/j.cosrev.2025.100837_b84 article-title: Randomized approximations of parameterized counting problems – volume: vol. 115 start-page: 1:1 year: 2018 ident: 10.1016/j.cosrev.2025.100837_b117 article-title: Counting problems in parameterized complexity – start-page: 89 year: 2014 ident: 10.1016/j.cosrev.2025.100837_b71 article-title: Deciding first-order properties of nowhere dense graphs – volume: 72 start-page: 1346 issue: 8 year: 2006 ident: 10.1016/j.cosrev.2025.100837_b38 article-title: Strong computational lower bounds via parameterized complexity publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2006.04.007 – start-page: 806 year: 2019 ident: 10.1016/j.cosrev.2025.100837_b80 article-title: Waring rank, parameterized and exact algorithms – year: 2013 ident: 10.1016/j.cosrev.2025.100837_b33 – volume: vol. 204 start-page: 34:1 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b102 article-title: Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths – volume: 10 start-page: 21:1 issue: 4 year: 2014 ident: 10.1016/j.cosrev.2025.100837_b21 article-title: Exponential time complexity of the permanent and the tutte polynomial publication-title: ACM Trans. Algorithms doi: 10.1145/2635812 – start-page: 24:1 year: 2018 ident: 10.1016/j.cosrev.2025.100837_b56 article-title: Counting induced subgraphs: A topological approach to #W[1]-hardness – volume: vol. 379 start-page: 177 year: 2011 ident: 10.1016/j.cosrev.2025.100837_b72 article-title: Algorithmic meta-theorems – year: 2022 ident: 10.1016/j.cosrev.2025.100837_b90 – volume: 62 start-page: 367 issue: 2 year: 2001 ident: 10.1016/j.cosrev.2025.100837_b29 article-title: On the complexity of k-SAT publication-title: J. Comput. System Sci. doi: 10.1006/jcss.2000.1727 – start-page: 231 year: 2015 ident: 10.1016/j.cosrev.2025.100837_b101 article-title: The parity of set systems under random restrictions with applications to exponential time problems – volume: 20 start-page: 865 issue: 5 year: 1991 ident: 10.1016/j.cosrev.2025.100837_b5 article-title: PP is as hard as the polynomial-time hierarchy publication-title: SIAM J. Comput. doi: 10.1137/0220053 – volume: 51 start-page: 849 issue: 4 year: 2022 ident: 10.1016/j.cosrev.2025.100837_b87 article-title: Approximately counting and sampling small witnesses using a colorful decision oracle publication-title: SIAM J. Comput. doi: 10.1137/19M130604X – start-page: 1 year: 2015 ident: 10.1016/j.cosrev.2025.100837_b13 article-title: Efficient graphlet counting for large networks – volume: vol. 4484 start-page: 703 year: 2007 ident: 10.1016/j.cosrev.2025.100837_b93 article-title: Kernelizations for parameterized counting problems – start-page: 587 year: 2008 ident: 10.1016/j.cosrev.2025.100837_b50 article-title: Understanding the complexity of induced subgraph isomorphisms – volume: 281 start-page: 291 issue: 1–2 year: 2002 ident: 10.1016/j.cosrev.2025.100837_b43 article-title: Counting H-colorings of partial k-trees publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(02)00017-8 – volume: vol. 202 start-page: 84:1 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b103 article-title: Parameterized (modular) counting and Cayley graph expanders – volume: vol. 123 start-page: 20:1 year: 2018 ident: 10.1016/j.cosrev.2025.100837_b94 article-title: Data-compression for parametrized counting problems on sparse graphs – year: 2021 ident: 10.1016/j.cosrev.2025.100837_b111 article-title: Color refinement and its applications – volume: 76 start-page: 267 issue: 3–4 year: 2010 ident: 10.1016/j.cosrev.2025.100837_b10 article-title: An approximation trichotomy for Boolean #CSP publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2009.08.003 – volume: 6 start-page: 85 issue: 1 year: 2010 ident: 10.1016/j.cosrev.2025.100837_b30 article-title: Can you beat treewidth? publication-title: Theory Comput. doi: 10.4086/toc.2010.v006a005 – volume: Vol. 7965 start-page: 352 year: 2013 ident: 10.1016/j.cosrev.2025.100837_b27 article-title: Counting matchings of size k is #W[1]-hard – volume: 12 start-page: 777 issue: 4 year: 1983 ident: 10.1016/j.cosrev.2025.100837_b18 article-title: The complexity of counting cuts and of computing the probability that a graph is connected publication-title: SIAM J. Comput. doi: 10.1137/0212053 – volume: 52 start-page: 221 issue: 2 year: 2013 ident: 10.1016/j.cosrev.2025.100837_b99 article-title: Parameterized random complexity publication-title: Theory Comput. Syst. doi: 10.1007/s00224-011-9381-0 – volume: 81 start-page: 541 issue: 2 year: 2019 ident: 10.1016/j.cosrev.2025.100837_b22 article-title: Fine-grained dichotomies for the Tutte plane and Boolean #CSP publication-title: Algorithmica doi: 10.1007/s00453-018-0472-z – volume: 39 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b95 article-title: Compactors for parameterized counting problems publication-title: Comput. Sci. Rev. doi: 10.1016/j.cosrev.2020.100344 – volume: 108 start-page: 35 issue: 1 year: 1990 ident: 10.1016/j.cosrev.2025.100837_b4 article-title: On the computational complexity of the Jones and Tutte polynomials publication-title: Math. Proc. Cambridge Philos. Soc. doi: 10.1017/S0305004100068936 – start-page: 151 year: 2018 ident: 10.1016/j.cosrev.2025.100837_b79 article-title: Extensor-coding – volume: 8 start-page: 277 issue: 2 year: 1987 ident: 10.1016/j.cosrev.2025.100837_b44 article-title: Complexity of finding embeddings in a k-tree publication-title: SIAM J. Algebraic Discret. Methods doi: 10.1137/0608024 – volume: 27 start-page: 892 issue: 2 year: 2013 ident: 10.1016/j.cosrev.2025.100837_b41 article-title: Counting and detecting small subgraphs via equations publication-title: SIAM J. Discret. Math. doi: 10.1137/110859798 – volume: 16 start-page: 52:1 issue: 4 year: 2020 ident: 10.1016/j.cosrev.2025.100837_b88 article-title: Edge estimation with independent set oracles publication-title: ACM Trans. Algorithms doi: 10.1145/3404867 – volume: 7 start-page: 11:1 issue: 3 year: 2015 ident: 10.1016/j.cosrev.2025.100837_b52 article-title: Some hard families of parameterized counting problems publication-title: TOCT doi: 10.1145/2786017 – volume: 329 start-page: 315 issue: 1–3 year: 2004 ident: 10.1016/j.cosrev.2025.100837_b47 article-title: The complexity of counting homomorphisms seen from the other side publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2004.08.008 – volume: 4 start-page: 260 issue: 3–4 year: 2007 ident: 10.1016/j.cosrev.2025.100837_b49 article-title: Linear-programming design and analysis of fast algorithms for Max 2-CSP publication-title: Discrete Optim. doi: 10.1016/j.disopt.2007.08.001 – volume: 17 start-page: 26:1 issue: 3 year: 2021 ident: 10.1016/j.cosrev.2025.100837_b81 article-title: Approximate counting of k-paths: Simpler, deterministic, and in polynomial space publication-title: ACM Trans. Algorithms doi: 10.1145/3461477 – start-page: 1854 year: 2024 ident: 10.1016/j.cosrev.2025.100837_b106 article-title: Count on CFI graphs for #P-hardness – volume: 41 start-page: 92 issue: 1 year: 1986 ident: 10.1016/j.cosrev.2025.100837_b48 article-title: Graph minors. V. Excluding a planar graph publication-title: J. Comb. Theory Ser. B doi: 10.1016/0095-8956(86)90030-4 – start-page: 133 year: 2010 ident: 10.1016/j.cosrev.2025.100837_b73 article-title: Deciding first-order properties for sparse graphs – volume: Vol. 132 start-page: 113:1 year: 2019 ident: 10.1016/j.cosrev.2025.100837_b36 article-title: Counting answers to existential questions – volume: 17 start-page: 260 issue: 3–4 year: 2000 ident: 10.1016/j.cosrev.2025.100837_b7 article-title: The complexity of counting graph homomorphisms publication-title: Random Structures Algorithms doi: 10.1002/1098-2418(200010/12)17:3/4<260::AID-RSA5>3.0.CO;2-W – volume: vol. 289 start-page: 3:1 year: 2024 ident: 10.1016/j.cosrev.2025.100837_b75 article-title: Structurally tractable graph classes (invited talk) – volume: 138 start-page: 147 issue: 1–3 year: 2006 ident: 10.1016/j.cosrev.2025.100837_b25 article-title: Parameterized counting problems publication-title: Ann. Pure Appl. Logic doi: 10.1016/j.apal.2005.06.010 – volume: 12 start-page: 308 issue: 2 year: 1991 ident: 10.1016/j.cosrev.2025.100837_b64 article-title: Easy problems for tree-decomposable graphs publication-title: J. Algorithms doi: 10.1016/0196-6774(91)90006-K – start-page: 315 year: 2016 ident: 10.1016/j.cosrev.2025.100837_b35 article-title: Counting answers to existential positive queries: A complexity classification – volume: 4 start-page: 287 issue: 2 year: 1963 ident: 10.1016/j.cosrev.2025.100837_b17 article-title: Dimer statistics and phase transitions publication-title: J. Math. Phys. doi: 10.1063/1.1703953 – volume: 37 start-page: 965 issue: 5 year: 2017 ident: 10.1016/j.cosrev.2025.100837_b54 article-title: The parameterised complexity of counting even and odd induced subgraphs publication-title: Combinatorica doi: 10.1007/s00493-016-3338-5 |
| SSID | ssj0070056 |
| Score | 2.3682811 |
| SecondaryResourceType | review_article |
| Snippet | A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 100837 |
| SubjectTerms | Counting problems Graph homomorphisms Graph motif parameters Parameterised complexity theory Randomised and approximation algorithms |
| Title | Parameterised counting complexity theory |
| URI | https://dx.doi.org/10.1016/j.cosrev.2025.100837 |
| Volume | 59 |
| WOSCitedRecordID | wos001589232200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 1574-0137 databaseCode: AIEXJ dateStart: 20070801 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0070056 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1dS8MwFA26-eCL3-L8og8-CFJomyVpH4dMVHQMnbK3kqYJuIdubFX2871pkn0wERV8KaWQdLsnvTvN7jkXoQtKmSBCMT9REbyg5CLws1hhHyvKA0mYCiqF9-sD63Tifj_pWln7pGonwIoink6T0b9CDdcAbC2d_QXcs0nhApwD6HAE2OH4I-C7XNdbVRbMUkvWbC-IqnZcTjXpLp0ef-5RYHs7XDmVz3jpL4Onodl9eYRQLW4TRLPKYrd35fQrS-WVIWG6BsXYrrh8aBy6V1KrecsfQGQmujsO3IPoEovYDl42rX7WM-uJgWFBBsF4HdUjRhLIO_XWXbt_734tmfYirTxt7Sdx8saqBm_1Xl_ThwVK0NtBW5bLey2DwS5ak8Ue2nax9Gza3EeXS5B4DhJvDolnIDlALzft3vWtbztU-AJ4cQkLXJAgiwSQQsxwKBSQs5BHeZDTJg9ZTuEBoTTJmfatByqdNbUQWAUiF6HKGMaHqFYMC3mEPMJjwanSOVE0OadZRoJI4lyRiBMpRQP57ounI2NEkroKvUFqApXqQKUmUA3EXHRSu3YMSUoB0G9HHv955AnanC-9U1Qrx-_yDG2Ij_JtMj63yH8Cgu1GYA |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parameterised+counting+complexity+theory&rft.jtitle=Computer+science+review&rft.au=Roth%2C+Marc&rft.date=2026-02-01&rft.pub=Elsevier+Inc&rft.issn=1574-0137&rft.volume=59&rft_id=info:doi/10.1016%2Fj.cosrev.2025.100837&rft.externalDocID=S1574013725001133 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1574-0137&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1574-0137&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1574-0137&client=summon |