Gaurav Rattan
Gaurav Rattan
Assistant Professor, University of Twente
Verified email at - Homepage
Cited by
Cited by
Weisfeiler and leman go neural: Higher-order graph neural networks
C Morris, M Ritzert, M Fey, WL Hamilton, JE Lenssen, G Rattan, M Grohe
Proceedings of the AAAI conference on artificial intelligence 33 (01), 4602-4609, 2019
Weisfeiler and leman go sparse: Towards scalable higher-order graph embeddings
C Morris, G Rattan, P Mutzel
Advances in Neural Information Processing Systems 33, 21824-21840, 2020
Lov\'asz Meets Weisfeiler and Leman
H Dell, M Grohe, G Rattan
arXiv preprint arXiv:1802.08876, 2018
On the power of color refinement
V Arvind, J Köbler, G Rattan, O Verbitsky
Fundamentals of Computation Theory: 20th International Symposium, FCT 2015 …, 2015
Ordered subgraph aggregation networks
C Qian, G Rattan, F Geerts, M Niepert, C Morris
Advances in Neural Information Processing Systems 35, 21030-21045, 2022
Speqnets: Sparsity-aware permutation-equivariant graph networks
C Morris, G Rattan, S Kiefer, S Ravanbakhsh
International Conference on Machine Learning, 16017-16042, 2022
Graph similarity and approximate isomorphism
M Grohe, G Rattan, GJ Woeginger
arXiv preprint arXiv:1802.08509, 2018
Graph isomorphism, color refinement, and compactness
V Arvind, J Köbler, G Rattan, O Verbitsky
computational complexity 26, 627-685, 2017
Homomorphism tensors and linear equations
M Grohe, G Rattan, T Seppelt
arXiv preprint arXiv:2111.11313, 2021
Weisfeiler-Leman and graph spectra
G Rattan, T Seppelt
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
The complexity of homomorphism indistinguishability
J Böker, Y Chen, M Grohe, G Rattan
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
On Tinhofer’s linear programming approach to isomorphism testing
V Arvind, J Köbler, G Rattan, O Verbitsky
Mathematical Foundations of Computer Science 2015: 40th International …, 2015
On the complexity of noncommutative polynomial factorization
V Arvind, P Joglekar, G Rattan
Information and Computation 262, 22-39, 2018
The parameterized complexity of geometric graph isomorphism
V Arvind, G Rattan
Algorithmica 75, 258-276, 2016
On the isomorphism problem for decision trees and decision lists
V Arvind, J Köbler, S Kuhnert, G Rattan, Y Vasudev
Theoretical Computer Science 590, 38-54, 2015
The parameterized complexity of fixing number and vertex individualization in graphs
V Arvind, F Fuhlbrück, J Köbler, S Kuhnert, G Rattan
arXiv preprint arXiv:1606.04383, 2016
The Complexity of Geometric Graph Isomorphism
V Arvind, G Rattan
Electron. Colloquium Comput. Complex., 2014
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
V Arvind, F Fuhlbrueck, J Koebler, S Kuhnert, G Rattan
ACM Transactions on Computation Theory (TOCT) 14 (2), 1-26, 2022
Ordered subgraph aggregation networks
F Geerts, C Qian, G Rattan, M Niepert, C Morris
Thirty-Sixth Conference on Neural Information Processing Systems (NeurIPS …, 2022
Some geometrical and vertex partitioning techniques for graph isomorphism [HBNI Th105]
G Rattan
The Institute of Mathematical Sciences, 2016
The system can't perform the operation now. Try again later.
Articles 1–20