Gaurav Rattan
Gaurav Rattan
Verified email at informatik.rwth-aachen.de - Homepage
Title
Cited by
Cited by
Year
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
3502019
Lov\'asz Meets Weisfeiler and Leman
H Dell, M Grohe, G Rattan
arXiv preprint arXiv:1802.08876, 2018
352018
On the power of color refinement
V Arvind, J Köbler, G Rattan, O Verbitsky
International Symposium on Fundamentals of Computation Theory, 339-350, 2015
312015
Graph isomorphism, color refinement, and compactness
V Arvind, J Köbler, G Rattan, O Verbitsky
arXiv preprint arXiv:1502.01255, 2015
192015
Graph similarity and approximate isomorphism
M Grohe, G Rattan, GJ Woeginger
arXiv preprint arXiv:1802.08509, 2018
152018
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
C Morris, G Rattan, P Mutzel
arXiv preprint arXiv:1904.01543, 2019
112019
On Tinhofer’s linear programming approach to isomorphism testing
V Arvind, J Köbler, G Rattan, O Verbitsky
International Symposium on Mathematical Foundations of Computer Science, 26-37, 2015
102015
On the complexity of noncommutative polynomial factorization
V Arvind, P Joglekar, G Rattan
Information and Computation 262, 22-39, 2018
72018
The parameterized complexity of geometric graph isomorphism
V Arvind, G Rattan
Algorithmica 75 (2), 258-276, 2016
72016
The complexity of homomorphism indistinguishability
J Böker, Y Chen, M Grohe, G Rattan
44th International Symposium on Mathematical Foundations of Computer Science …, 2019
62019
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
52015
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
12016
Weisfeiler--Leman, Graph Spectra, and Random Walks
G Rattan, T Seppelt
arXiv preprint arXiv:2103.02972, 2021
2021
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS
V Arvind, G Rattan, F Fuhlbrück, J Köbler, S Kuhnert, M Baartse, K Meer, ...
2016
Some geometrical and vertex partitioning techniques for graph isomorphism [HBNI Th105]
G Rattan
IMSc, 2016
2016
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity
V Arvind, G Rattan
arXiv preprint arXiv:1408.3510, 2014
2014
The Complexity of Geometric Graph Isomorphism.
V Arvind, G Rattan
Electron. Colloquium Comput. Complex. 21, 70, 2014
2014
The Parameterized Complexity of Geometric Graph Isomorphism
G Rattan
The system can't perform the operation now. Try again later.
Articles 1–18