Counting (with) homomorphisms

Project Information

CountHom

Grant agreement ID: 101077083

DOI

10.3030/101077083

EC signature date 6 February 2023

Start date 1 April 2023

End date 31 March 2028

Funded under

• European Research Council (ERC)

Total cost

€ 1 500 000,01

EU contribution

€ 1 500 000,00

Coordinated by

UNIVERSITAET REGENSBURG
Germany

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (8)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial

Author(s): Radu Curticapean, Simon Döring, Daniel Neuen
Published in: 33rd Annual European Symposium on Algorithms (ESA 2025), 2025
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.ESA.2025.96

Which Graph Motif Parameters Count?

Author(s): Markus Bläser, Radu Curticapean, Julian Dörfler, Christian Ikenmeyer
Published in: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), 2025
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.MFCS.2025.23

Counting Small Induced Subgraphs: Hardness via Fourier Analysis

Author(s): Radu Curticapean, Daniel Neuen
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.48550/ARXIV.2407.07051

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees

Author(s): Sandra Kiefer, Daniel Neuen
Published in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Publisher: ACM
DOI: 10.48550/ARXIV.2402.03274

Monotone Bounded-Depth Complexity of Homomorphism Polynomials

Author(s): C. S. Bhargav, Shiteng Chen, Radu Curticapean, Prateek Dwivedi
Published in: 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), 2025
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.MFCS.2025.19

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture

Author(s): Andreas Björklund, Radu Curticapean, Thore Husfeldt, Petteri Kaski, Kevin Pratt
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.48550/ARXIV.2404.04987

Can You Link Up With Treewidth?

Author(s): Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang
Published in: 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 2025
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.48550/ARXIV.2410.02606

"Count on CFI graphs for #P-hardness"

Author(s): Radu Curticapean
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.48550/ARXIV.2305.04767

Peer reviewed articles (2)

Homomorphism Tensors and Linear Equations

Author(s): Martin Grohe, Gaurav Rattan, Tim Seppelt
Published in: Advances in Combinatorics, 2025, ISSN 2517-5599
Publisher: Alliance of Diamond Open Access Journals
DOI: 10.19086/AIC.2025.4

Counting vanishing matrix-vector products

Author(s): Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
Published in: Theoretical Computer Science, Issue 1021, 2024, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/J.TCS.2024.114877