Gaurav Rattan

Available identifiers

zbMath Open rattan.gauravMaRDI QIDQ309785

List of research outcomes

Publication	Date of Publication	Type
The Complexity of Homomorphism Indistinguishability	2022-07-21	Paper
Graph Similarity and Approximate Isomorphism	2021-08-04	Paper
Lov\'asz Meets Weisfeiler and Leman	2021-07-28	Paper
Weisfeiler--Leman and Graph Spectra	2021-03-04	Paper
On the complexity of noncommutative polynomial factorization	2018-09-27	Paper
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs	2018-03-21	Paper
Graph isomorphism, color refinement, and compactness	2017-10-18	Paper
The parameterized complexity of geometric graph isomorphism	2016-09-07	Paper
On the Power of Color Refinement	2015-09-29	Paper
On the complexity of noncommutative polynomial factorization	2015-09-16	Paper
On Tinhofer’s Linear Programming Approach to Isomorphism Testing	2015-09-16	Paper
The Parameterized Complexity of Geometric Graph Isomorphism	2015-09-15	Paper
On the isomorphism problem for decision trees and decision lists	2015-06-10	Paper
On the Isomorphism Problem for Decision Trees and Decision Lists	2013-08-16	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Gaurav Rattan