Counting (with) homomorphisms

Informazioni relative al progetto

CountHom

ID dell’accordo di sovvenzione: 101077083

DOI

10.3030/101077083

Data della firma CE 6 Febbraio 2023

Data di avvio 1 Aprile 2023

Data di completamento 31 Marzo 2028

Finanziato da

• European Research Council (ERC)

Costo totale

€ 1 500 000,01

Contributo UE

€ 1 500 000,00

Coordinato da

UNIVERSITAET REGENSBURG
Germany

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (15)

Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial

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

Which Graph Motif Parameters Count?

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

Faster Convolutions: Yates and Strassen Revisited

Autori: Cornelius Brand, Radu Curticapean, Baitian Li, Kevin Pratt
Pubblicato in: 2026 SIAM Symposium on Simplicity in Algorithms (SOSA), 2026
Editore: Society for Industrial and Applied Mathematics
DOI: 10.48550/ARXIV.2505.22410

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability

Autori: Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman
Pubblicato in: 52nd International Colloquium on Automata, Languages, and Programming, ICALP 2025, 2025
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.48550/ARXIV.2407.10635

Counting Small Induced Subgraphs: Hardness via Fourier Analysis

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

Parameterized Complexity of MinCSP over the Point Algebra

Autori: Osipov, George; Pilipczuk, Marcin; Wahlström, Magnus
Pubblicato in: 32nd Annual European Symposium on Algorithms (ESA 2024), 2024
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.ESA.2024.93

Symmetric Algebraic Circuits and Homomorphism Polynomials

Autori: Anuj Dawar, Benedikt Pago, Tim Seppelt
Pubblicato in: 17th Innovations in Theoretical Computer Science Conference, ITCS 2026, 2026
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.ITCS.2026.46

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

Autori: Sandra Kiefer, Daniel Neuen
Pubblicato in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Editore: ACM
DOI: 10.48550/ARXIV.2402.03274

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing

Autori: Marek Černý, Tim Seppelt
Pubblicato in: 43rd International Symposium on Theoretical Aspects of Computer Science (STACS 2026), 2026
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.STACS.2026.25

Monotone Bounded-Depth Complexity of Homomorphism Polynomials

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

Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture

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

Sink-free orientations: a local sampler with applications

Autori: Konrad Anand, Graham Freifeld, Heng Guo, Chunyang Wang, Jiaheng Wang
Pubblicato in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2025, 2025
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.APPROX/RANDOM.2025.60

Rapid mixing of the flip chain over non-crossing spanning trees

Autori: Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo, Mark Jerrum, Jiaheng Wang
Pubblicato in: 41st International Symposium on Computational Geometry, SoCG 2025, 2025
Editore: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.4230/LIPICS.SOCG.2025.8

Can You Link Up With Treewidth?

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

"Count on CFI graphs for #P-hardness"

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

Peer reviewed articles (3)

Homomorphism Tensors and Linear Equations

Autori: Martin Grohe, Gaurav Rattan, Tim Seppelt
Pubblicato in: Advances in Combinatorics, 2025, ISSN 2517-5599
Editore: Alliance of Diamond Open Access Journals
DOI: 10.19086/AIC.2025.4

Counting vanishing matrix-vector products

Autori: Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica
Pubblicato in: Theoretical Computer Science, Numero 1021, 2024, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/J.TCS.2024.114877

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability

Autori: Prem Nigam Kar; David E. Roberson; Tim Seppelt; Peter Zeman
Pubblicato in: Quantum, 2026, ISSN 2521-327X
Editore: Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
DOI: 10.48550/ARXIV.2407.10635