The Complexity of Geometric Graph Isomorphism. - Vikraman Arvind; Gaurav Rattan (Electron. Colloquium Comput. Complex., 2014)

Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. - Vikraman Arvind; Gaurav Rattan (Electron. Colloquium Comput. Complex., 2014)

On the Power of Color Refinement. - Vikraman Arvind; Johannes Köbler; Gaurav Rattan; Oleg Verbitsky 001 (FCT, 2015)

On Tinhofer's Linear Programming Approach to Isomorphism Testing. - Vikraman Arvind; Johannes Köbler; Gaurav Rattan; Oleg Verbitsky 001 (MFCS (2), 2015)

On the Complexity of Noncommutative Polynomial Factorization. - Vikraman Arvind; Pushkar S. Joglekar; Gaurav Rattan (Electron. Colloquium Comput. Complex., 2015)

On the isomorphism problem for decision trees and decision lists. - Vikraman Arvind; Johannes Köbler; Sebastian Kuhnert; Gaurav Rattan; Yadu Vasudev (Theor. Comput. Sci., 2015)

The Parameterized Complexity of Geometric Graph Isomorphism. - Vikraman Arvind; Gaurav Rattan (Algorithmica, 2016)

Graph Isomorphism, Color Refinement, and Compactness. - Vikraman Arvind; Johannes Köbler; Gaurav Rattan; Oleg Verbitsky 001 (Comput. Complex., 2017)

Lovász Meets Weisfeiler and Leman. - Holger Dell; Martin Grohe; Gaurav Rattan (ICALP, 2018)

Graph Similarity and Approximate Isomorphism. - Martin Grohe; Gaurav Rattan; Gerhard J. Woeginger (MFCS, 2018)

Weisfeiler-Leman meets Homomorphisms. - Holger Dell; Martin Grohe; Gaurav Rattan (CoRR, 2018)

Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks. - Christopher Morris 001; Martin Ritzert; Matthias Fey; William L. Hamilton; Jan Eric Lenssen; Gaurav Rattan; Martin Grohe (AAAI, 2019)

The Complexity of Homomorphism Indistinguishability. - Jan Böker; Yijia Chen 001; Martin Grohe; Gaurav Rattan (MFCS, 2019)

Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. - Christopher Morris 001; Gaurav Rattan; Petra Mutzel (NeurIPS, 2020)

Weisfeiler-Leman, Graph Spectra, and Random Walks. - Gaurav Rattan; Tim Seppelt (CoRR, 2021)

Homomorphism Tensors and Linear Equations. - Martin Grohe; Gaurav Rattan; Tim Seppelt (ICALP, 2022)

SpeqNets: Sparsity-aware permutation-equivariant graph networks. - Christopher Morris 001; Gaurav Rattan; Sandra Kiefer; Siamak Ravanbakhsh (ICML, 2022)

Ordered Subgraph Aggregation Networks. - Chendi Qian; Gaurav Rattan; Floris Geerts; Mathias Niepert; Christopher Morris 001 (NeurIPS, 2022)

The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. - Vikraman Arvind; Frank Fuhlbrück; Johannes Köbler; Sebastian Kuhnert; Gaurav Rattan (ACM Trans. Comput. Theory, 2022)

Weisfeiler-Leman and Graph Spectra. - Gaurav Rattan; Tim Seppelt (SODA, 2023)

The Complexity of Symmetry Breaking Beyond Lex-Leader. - Markus Anders; Sofia Brenner; Gaurav Rattan (CP, 2024)

Satsuma: Structure-Based Symmetry Breaking in SAT. - Markus Anders; Sofia Brenner; Gaurav Rattan (SAT, 2024)