Gaurav Rattan

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 34

Top Topics

Graph Isomorphism

Linear Programming

Parameterized Complexity

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Markus Anders, Sofia Brenner, Gaurav Rattan
The Complexity of Symmetry Breaking Beyond Lex-Leader. CoRR (2024)
Markus Anders, Sofia Brenner, Gaurav Rattan
satsuma: Structure-based Symmetry Breaking in SAT. CoRR (2024)
Markus Anders, Sofia Brenner, Gaurav Rattan
The Complexity of Symmetry Breaking Beyond Lex-Leader. CP (2024)
Markus Anders, Sofia Brenner, Gaurav Rattan
Satsuma: Structure-Based Symmetry Breaking in SAT. SAT (2024)
Gaurav Rattan, Tim Seppelt
Weisfeiler-Leman and Graph Spectra. SODA (2023)
Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh
SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks. CoRR (2022)
Chendi Qian, Gaurav Rattan, Floris Geerts, Christopher Morris, Mathias Niepert
Ordered Subgraph Aggregation Networks. CoRR (2022)
Martin Grohe, Gaurav Rattan, Tim Seppelt
Homomorphism Tensors and Linear Equations. ICALP (2022)
Chendi Qian, Gaurav Rattan, Floris Geerts, Mathias Niepert, Christopher Morris
Ordered Subgraph Aggregation Networks. NeurIPS (2022)
Christopher Morris, Gaurav Rattan, Sandra Kiefer, Siamak Ravanbakhsh
SpeqNets: Sparsity-aware permutation-equivariant graph networks. ICML (2022)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. ACM Trans. Comput. Theory 14 (2) (2022)
Gaurav Rattan, Tim Seppelt
Weisfeiler-Leman, Graph Spectra, and Random Walks. CoRR (2021)
Martin Grohe, Gaurav Rattan, Tim Seppelt
Homomorphism Tensors and Linear Equations. CoRR (2021)
Christopher Morris, Gaurav Rattan, Petra Mutzel
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings. NeurIPS (2020)
Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe
Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks. AAAI (2019)
Jan Böker, Yijia Chen, Martin Grohe, Gaurav Rattan
The Complexity of Homomorphism Indistinguishability. MFCS (2019)
Holger Dell, Martin Grohe, Gaurav Rattan
Lovász Meets Weisfeiler and Leman. ICALP (2018)
Holger Dell, Martin Grohe, Gaurav Rattan
Weisfeiler-Leman meets Homomorphisms. CoRR (2018)
Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
Graph Similarity and Approximate Isomorphism. CoRR (2018)
Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
Graph Similarity and Approximate Isomorphism. MFCS (2018)
Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks. CoRR (2018)
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
On the complexity of noncommutative polynomial factorization. Inf. Comput. 262 (2018)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
Graph Isomorphism, Color Refinement, and Compactness. Comput. Complex. 26 (3) (2017)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. MFCS (2016)
Vikraman Arvind, Gaurav Rattan
The Parameterized Complexity of Geometric Graph Isomorphism. Algorithmica 75 (2) (2016)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. CoRR (2016)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
Graph Isomorphism, Color Refinement, and Compactness. Electron. Colloquium Comput. Complex. 22 (2015)
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
On the Complexity of Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. 22 (2015)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
Graph Isomorphism, Color Refinement, and Compactness. CoRR (2015)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
On the isomorphism problem for decision trees and decision lists. Theor. Comput. Sci. 590 (2015)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
On the Power of Color Refinement. FCT (2015)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
On Tinhofer's Linear Programming Approach to Isomorphism Testing. MFCS (2) (2015)
Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar
On the Complexity of Noncommutative Polynomial Factorization. MFCS (2) (2015)
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
On the Complexity of Noncommutative Polynomial Factorization. CoRR (2015)
Vikraman Arvind, Gaurav Rattan
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. Electron. Colloquium Comput. Complex. 21 (2014)
Vikraman Arvind, Gaurav Rattan
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. CoRR (2014)
Vikraman Arvind, Gaurav Rattan
The Parameterized Complexity of Geometric Graph Isomorphism. IPEC (2014)
Vikraman Arvind, Gaurav Rattan
The Complexity of Geometric Graph Isomorphism. Electron. Colloquium Comput. Complex. 21 (2014)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
On the Isomorphism Problem for Decision Trees and Decision Lists. FCT (2013)