Gaurav Rattan

According to our database, Gaurav Rattan authored at least 20 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Weisfeiler-Leman and Graph Spectra.

Gaurav Rattan, 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.

Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan

ACM Trans. Comput. Theory, 2022

Ordered Subgraph Aggregation Networks.

Chendi Qian, Gaurav Rattan, Floris Geerts, Mathias Niepert, Christopher Morris

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.

Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh

Proceedings of the International Conference on Machine Learning, 2022

Homomorphism Tensors and Linear Equations.

Martin Grohe, Gaurav Rattan, Tim Seppelt

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

2021

Weisfeiler-Leman, Graph Spectra, and Random Walks.

Gaurav Rattan, Tim Seppelt

CoRR, 2021

2020

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

Christopher Morris, Gaurav Rattan, 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.

Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan

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

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

Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe

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

2018

Weisfeiler-Leman meets Homomorphisms.

Holger Dell, Martin Grohe, Gaurav Rattan

CoRR, 2018

Graph Similarity and Approximate Isomorphism.

Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger

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

Lovász Meets Weisfeiler and Leman.

Holger Dell, Martin Grohe, Gaurav Rattan

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

2017

Graph Isomorphism, Color Refinement, and Compactness.

Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky

Comput. Complex., 2017

2016

The Parameterized Complexity of Geometric Graph Isomorphism.

Vikraman Arvind, Gaurav Rattan

Algorithmica, 2016

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

On the Complexity of Noncommutative Polynomial Factorization.

Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan

Electron. Colloquium Comput. Complex., 2015

On Tinhofer's Linear Programming Approach to Isomorphism Testing.

Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

On the Power of Color Refinement.

Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky

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

2014

Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity.

Vikraman Arvind, Gaurav Rattan

Electron. Colloquium Comput. Complex., 2014

The Complexity of Geometric Graph Isomorphism.

Vikraman Arvind, Gaurav Rattan

Electron. Colloquium Comput. Complex., 2014