Counting small induced subgraphs with hereditary properties-Reference-Cited by-同舟云学术

Counting small induced subgraphs with hereditary properties

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Focke Jacob¹,Roth Marc²

Affiliation:

1. CISPA, Germany

2. University of Oxford, UK

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520008

Reference33 articles.

1. Noga Alon , Phuong Dao , Iman Hajirasouliha , Fereydoun Hormozdiari , and S. Cenk Sahinalp . 2008. Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24, 13 ( 2008 ), 07, i241–i249. issn:1367-4803 https://doi.org/10.1093/bioinformatics/btn163 10.1093/bioinformatics Noga Alon, Phuong Dao, Iman Hajirasouliha, Fereydoun Hormozdiari, and S. Cenk Sahinalp. 2008. Biomolecular network motif counting and discovery by color coding. Bioinformatics, 24, 13 (2008), 07, i241–i249. issn:1367-4803 https://doi.org/10.1093/bioinformatics/btn163

2. Approximation Algorithms for Some Parameterized Counting Problems

3. Counting Answers to Existential Positive Queries

4. Tight lower bounds for certain parameterized NP-hard problems

5. Strong computational lower bounds via parameterized complexity

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Counting Small Induced Subgraphs with Hereditary Properties;SIAM Journal on Computing;2024-03-12

2. Finding and Counting Patterns in Sparse Graphs;2024

3. The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Parameterised Counting in Logspace;Algorithmica;2023-04-21