Marco Bressan 0002, Marc Roth. Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 276-285, IEEE, 2021. [doi]
@inproceedings{0002R21-2,
title = {Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies},
author = {Marco Bressan 0002 and Marc Roth},
year = {2021},
doi = {10.1109/FOCS52979.2021.00036},
url = {https://doi.org/10.1109/FOCS52979.2021.00036},
researchr = {https://researchr.org/publication/0002R21-2},
cites = {0},
citedby = {0},
pages = {276-285},
booktitle = {62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022},
publisher = {IEEE},
isbn = {978-1-6654-2055-6},
}