Counting (with) homomorphisms

Projekter: Projekt › Forskning

  • 9 Konferencebidrag i proceedings
  • 3 Tidsskriftartikel
Filter
Konferencebidrag i proceedings

Søgeresultater

  • 2026

    Symmetric Algebraic Circuits and Homomorphism Polynomials

    Dawar, A., Pago, B. & Seppelt, T., jan. 2026, LIPIcs, Volume 362, ITCS 2026. Shubhangi, S. (red.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 362. s. 46:1--46:15 15 s.

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang
  • 2025

    Can You Link Up With Treewidth?

    Curticapean, R.-C., Döring, S., Neuen, D. & Wang, J., 24 feb. 2025, Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science. Beyersdorff, O., Pilipczuk, M., Pimentel, E. & Kim Thắn, N. (red.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 327. 24 s. 28. (Leibniz International Proceedings in Informatics (LIPIcs), Bind 327).

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang

  • Counting Small Induced Subgraphs: Hardness via Fourier Analysis

    Curticapean, R.-C. & Neuen, D., 2025, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, s. 3677 - 3695 19 s.

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang

  • Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial

    Curticapean, R.-C., Döring, S. & Neuen, D., 1 okt. 2025, Proceedings of the 33rd Annual European Symposium on Algorithms. s. 96:2 - 96:16 16 s. 96

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang

  • Fast Deterministic Chromatic Number under the Asymptotic Rank Conjecture

    Curticapean, R.-C., Björklund, A., Husfeldt, T., Kaski, P. & Pratt, K., 1 jan. 2025, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. s. 2804-2818 15 s.

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang

  • Monotone Bounded-Depth Complexity of Homomorphism Polynomials

    C. S., B., Curticapean, R.-C., Chen, S. & Dwivedi, P., 20 aug. 2025, Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 345. s. 19:1--19:18 18 s. 19

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang

  • NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability

    Kar, P. N., Roberson, D. E., Seppelt, T. & Zeman, P., 2025, International Colloquium on Automata, Languages, and Programming (ICALP). Bind 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). s. 1-19 19 s.

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang

  • Which Graph Motif Parameters Count?

    Bläser, M., Curticapean, R.-C., Dörfler, J. & Ikenmeyer, C., 20 aug. 2025, Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science. 18 s.

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang
  • 2024

    Count on CFI graphs for #P-hardness

    Curticapean, R.-C., 2024, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024. Society for Industrial and Applied Mathematics, s. 1854 - 1871

    Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

    Åben adgang
    Fil