Author of the publication

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

, , and . Advances in Neural Information Processing Systems, 33, page 21824--21840. Curran Associates, Inc., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Parameterized Complexity of Geometric Graph Isomorphism., and . IPEC, volume 8894 of Lecture Notes in Computer Science, page 51-62. Springer, (2014)Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity., and . Electron. Colloquium Comput. Complex., (2014)The Complexity of Geometric Graph Isomorphism., and . Electron. Colloquium Comput. Complex., (2014)Weisfeiler-Leman and Graph Spectra., and . SODA, page 2268-2285. SIAM, (2023)Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks., , , , , , and . CoRR, (2018)The Parameterized Complexity of Geometric Graph Isomorphism., and . Algorithmica, 75 (2): 258-276 (2016)The Complexity of Homomorphism Indistinguishability., , , and . MFCS, volume 138 of LIPIcs, page 54:1-54:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs., , , , and . ACM Trans. Comput. Theory, 14 (2): 9:1-9:26 (2022)Homomorphism Tensors and Linear Equations., , and . ICALP, volume 229 of LIPIcs, page 70:1-70:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the complexity of noncommutative polynomial factorization., , and . Inf. Comput., (2018)