Gaurav Rattan

Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

The Complexity of Symmetry Breaking Beyond Lex-Leader.

[BibT_eX]

[DOI]

Markus Anders

Sofia Brenner

Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023

Weisfeiler-Leman and Graph Spectra.

[BibT_eX]

[DOI]

Tim Seppelt

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2022

Ordered Subgraph Aggregation Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

SpeqNets: Sparsity-aware permutation-equivariant graph networks.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Homomorphism Tensors and Linear Equations.

[BibT_eX]

[DOI]

Tim Seppelt

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Weisfeiler-Leman, Graph Spectra, and Random Walks.

[BibT_eX]

[DOI]

Tim Seppelt

CoRR, 2021

2020

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings.

[BibT_eX]

[DOI]

Christopher Morris

Petra Mutzel

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

The Complexity of Homomorphism Indistinguishability.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Weisfeiler-Leman meets Homomorphisms.

[BibT_eX]

[DOI]

Holger Dell

CoRR, 2018

Graph Similarity and Approximate Isomorphism.

[BibT_eX]

[DOI]

Gerhard J. Woeginger

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Lovász Meets Weisfeiler and Leman.

[BibT_eX]

[DOI]

Holger Dell

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Graph Isomorphism, Color Refinement, and Compactness.

[BibT_eX]

[DOI]

Comput. Complex., 2017

2016

The Parameterized Complexity of Geometric Graph Isomorphism.

[BibT_eX]

[DOI]

Algorithmica, 2016

2015

On the isomorphism problem for decision trees and decision lists.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On the Complexity of Noncommutative Polynomial Factorization.

[BibT_eX]

[DOI]

Pushkar S. Joglekar

Electron. Colloquium Comput. Complex., 2015

On Tinhofer's Linear Programming Approach to Isomorphism Testing.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

On the Power of Color Refinement.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014

Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

The Complexity of Geometric Graph Isomorphism.

[BibT_eX]

[DOI]