Skip to main content
Go to the home page of the European Commission (opens in new window)
English English
CORDIS - EU research results
CORDIS

Symmetry and Similarity

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

Simulating Logspace-Recursion with Logarithmic Quantifier Depth (opens in new window)

Author(s): van Bergerem, Steffen; Grohe, Martin; Kiefer, Sandra; Oeljeklaus, Luca Frédéric Tilmann
Published in: 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) : 26 – 29 June 2023, Boston, USA, 2023<br/>38. Annual ACM/IEEE Symposium on Logic in Computer Science, LICS, Boston, MA, USA, 2023-06-26 - 2023-06-29, 2023
Publisher: IEEE
DOI: 10.48550/arxiv.2304.12948

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability (opens in new window)

Author(s): Lichter, Moritz; Pago, Benedikt Thomas; Seppelt, Tim Frederik
Published in: 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano, Alexandra Silva<br/>32. EACSL Annual Conference on Computer Science Logic, CSL 2024, Naples, Italy, 2024-02-19 - 2024-02-23, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arXiv.2308.05693

An Algorithmic Meta Theorem for Homomorphism Indistinguishability (opens in new window)

Author(s): Seppelt, Tim Frederik
Published in: 49th International Symposium on Mathematical Foundations of Computer Science, 2024
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arXiv.2402.08989

The Complexity of Homomorphism Reconstructibility (opens in new window)

Author(s): Böker, Jan Wilhelm; Härtel, Louis; Runde, Nina Katrin; Seppelt, Tim Frederik; Standke, Christoph
Published in: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), 2023
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
DOI: 10.48550/arxiv.2310.09009

Position: Future Directions in the Theory of Graph Machine Learning

Author(s): Christopher Morris, Fabrizio Frasca, Nadav Dym, Haggai Maron, Ismail Ilkan Ceylan, Ron Levie, Derek Lim, Michael M. Bronstein, Martin Grohe, Stefanie Jegelka
Published in: 41st International Conference on Machine Learning, 2024
Publisher: MLR Press

The Descriptive Complexity of Graph Neural Networks (opens in new window)

Author(s): Grohe, Martin
Published in: Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023
Publisher: IEEE
DOI: 10.48550/arxiv.2303.04613

Are Targeted Messages More Effective? (opens in new window)

Author(s): Martin Grohe, Eran Rosenbluth
Published in: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024
Publisher: ACM
DOI: 10.48550/arXiv.2403.06817

Fine-grained Expressivity of Graph Neural Networks

Author(s): Böker, Jan; Levie, Ron; Huang, Ningyuan; Villar, Soledad; Morris, Christopher
Published in: Advances in Neural Information Processing Systems, 2023
Publisher: MLR Press

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements (opens in new window)

Author(s): Grohe, Martin; Lichter, Moritz; Neuen, Daniel; Schweitzer, Pascal
Published in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023
Publisher: IEEE
DOI: 10.48550/arxiv.2308.11970

The Iteration Number of the Weisfeiler-Leman Algorithm (opens in new window)

Author(s): Martin Grohe, Moritz Lichter, Daniel Neuen
Published in: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2024
Publisher: IEEE
DOI: 10.48550/arXiv.2301.13317

Isomorphism for Tournaments of Small Twin Width (opens in new window)

Author(s): Martin Grohe and Daniel Neuen
Published in: Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
DOI: 10.48550/arXiv.2312.02048

Some Thoughts on Graph Similarity (opens in new window)

Author(s): Martin Grohe
Published in: Principles of Verification: Cycling the Probabilistic Landscape: Essays Dedicated to Joost-Pieter Katoen on the Occasion of His 60th Birthday, Part I, 2024
Publisher: Springer
DOI: 10.48550/ARXIV.2411.10182

WL meet VC

Author(s): Morris, Christopher; Geerts, Floris; Tönshoff, Jan; Grohe, Martin
Published in: Proceedings of the 40th International Conference on Machine Learning (PMLR), 2023, Honolulu, Hawaii, USA., 2023
Publisher: MLR Press

Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth (opens in new window)

Author(s): Fluck, Eva; Seppelt, Tim Frederik; Spitzer, Gian Luca
Published in: 32nd EACSL Annual Conference on Computer Science Logic : CSL 2024, February 19–23, 2024, Naples, Italy / edited by Aniello Murano, Alexandra Silvapages, 2023
Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.48550/arxiv.2308.06044

Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark (opens in new window)

Author(s): Jan Tönshoff, Martin Ritzert, Eran Rosenbluth, Martin Grohe
Published in: Transactions on Machine Learning Research, 2024, ISSN 2835-8856
Publisher: MLR Press
DOI: 10.48550/ARXIV.2309.00367

Logical equivalences, homomorphism indistinguishability, and forbidden minors (opens in new window)

Author(s): Tim Seppelt
Published in: Information and Computation, Issue 301, 2024, ISSN 0890-5401
Publisher: Elsevier BV
DOI: 10.48550/arXiv.2302.11290

Weisfeiler-Leman Indistinguishability of Graphons (opens in new window)

Author(s): Jan Böker
Published in: The Electronic Journal of Combinatorics, Issue 30, 2023, ISSN 1077-8926
Publisher: The Electronic Journal of Combinatorics
DOI: 10.37236/10973

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability (opens in new window)

Author(s): David E. Roberson, Tim Seppelt
Published in: TheoretiCS, Issue Volume 3, 2024, ISSN 2751-4838
Publisher: Centre pour la Communication Scientifique Directe (CCSD)
DOI: 10.46298/theoretics.24.20

The Parameterized Complexity of Learning Monadic Second-Order Logic (opens in new window)

Author(s): van Bergerem, Steffen; Grohe, Martin; Runde, Nina
Published in: 2023
Publisher: arxiv.org
DOI: 10.48550/arxiv.2309.10489

Computational complexity of the Weisfeiler-Leman dimension (opens in new window)

Author(s): Lichter, Moritz; Raßmann, Simon; Schweitzer, Pascal
Published in: 2024
Publisher: arxiv.org
DOI: 10.48550/arxiv.2402.11531

Structural Node Embeddings with Homomorphism Counts (opens in new window)

Author(s): Wolf, Hinrikus; Oeljeklaus, Luca Frédéric Tilmann; Kühner, Pascal; Grohe, Martin
Published in: 2023
Publisher: arxiv.org
DOI: 10.48550/arxiv.2308.15283

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism (opens in new window)

Author(s): Christoph Berkholz and Moritz Lichter and Harry Vinall-Smeeth
Published in: 2024
Publisher: arxiv.org
DOI: 10.48550/ARXIV.2407.17947

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems (opens in new window)

Author(s): Moritz Lichter and Benedikt Pago
Published in: 2024
Publisher: arxiv.org
DOI: 10.48550/ARXIV.2407.09097

Searching for OpenAIRE data...

There was an error trying to search data from OpenAIRE

No results available

My booklet 0 0