The following pages link to Gaurav Rattan (Q309785):
Displaying 15 items.
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- On the complexity of noncommutative polynomial factorization (Q1784944) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- On the Isomorphism Problem for Decision Trees and Decision Lists (Q2842768) (← links)
- The Parameterized Complexity of Geometric Graph Isomorphism (Q2946007) (← links)
- On Tinhofer’s Linear Programming Approach to Isomorphism Testing (Q2946374) (← links)
- On the Power of Color Refinement (Q2947892) (← links)
- The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs (Q4608571) (← links)
- Lov\'asz Meets Weisfeiler and Leman (Q5002713) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- The Complexity of Homomorphism Indistinguishability (Q5092416) (← links)
- Weisfeiler--Leman and Graph Spectra (Q6362126) (← links)
- Homomorphism Tensors and Linear Equations (Q6507663) (← links)
- Homomorphism tensors and linear equations (Q6560866) (← links)
