Author:
Arvind V.,Raman Venkatesh
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. N. Alon, R. Yuster and U. Zwick, “Color-Coding”, Journal of the Association for Computing Machinery, 42(4) (1995) 844–856.
2. H. Bodlaender, “A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth”, SI AM J. Computing 25 (1996) 1305–1317.
3. R. G. Downey and M. R. Fellows, Parameterized Complexity, Springer-Verlag, 1998.
4. U. Feige and J. Kilian, “On Limited versus Polynomial Nondeterminism”, Chicago Journal of Theoretical Computer Science, March (1997).
5. H. Fernau, “Parameterized Enumeration”, to appear in the Proceedings of COCOON 2002.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Random Graph Matching at Otter’s Threshold via Counting Chandeliers;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. 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
3. Counting small induced subgraphs with hereditary properties;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. Approximate Counting CSP Seen from the Other Side;ACM Transactions on Computation Theory;2020-06-30