Gaurav Rattan

Orcid: 0000-0002-5095-860X

According to our database1, Gaurav Rattan authored at least 22 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Satsuma: Structure-Based Symmetry Breaking in SAT.
Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing, 2024

The Complexity of Symmetry Breaking Beyond Lex-Leader.
Proceedings of the 30th International Conference on Principles and Practice of Constraint Programming, 2024

2023
Weisfeiler-Leman and Graph Spectra.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.
ACM Trans. Comput. Theory, 2022

Ordered Subgraph Aggregation Networks.
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.
Proceedings of the International Conference on Machine Learning, 2022

Homomorphism Tensors and Linear Equations.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Weisfeiler-Leman, Graph Spectra, and Random Walks.
CoRR, 2021

2020
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings.
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.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Weisfeiler and Leman Go Neural: Higher-Order Graph Neural Networks.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Weisfeiler-Leman meets Homomorphisms.
CoRR, 2018

Graph Similarity and Approximate Isomorphism.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Lovász Meets Weisfeiler and Leman.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Graph Isomorphism, Color Refinement, and Compactness.
Comput. Complex., 2017

2016
The Parameterized Complexity of Geometric Graph Isomorphism.
Algorithmica, 2016

2015
On the isomorphism problem for decision trees and decision lists.
Theor. Comput. Sci., 2015

On the Complexity of Noncommutative Polynomial Factorization.
Electron. Colloquium Comput. Complex., 2015

On Tinhofer's Linear Programming Approach to Isomorphism Testing.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

On the Power of Color Refinement.
Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

2014
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity.
Electron. Colloquium Comput. Complex., 2014

The Complexity of Geometric Graph Isomorphism.
Electron. Colloquium Comput. Complex., 2014


  Loading...