Gaurav Rattan

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