h1

 

Forschungsinteressen

Algorithmen und Komplexität (Graphisomorphie), Maschinenlernen (Graphen Kernels, neuronale Graphenetzwerke)

 

Lebenslauf

Lebenslauf (auf Englisch)

 

Lehre

Semester	Lehrveranstaltung
Sommersemester 2018	Algorithmische Lerntheorie
Wintersemester 2017/2018	Foundations of Data Science

 

Publikationen

Titel	Autor*innen	Erschienen in
Weisfeiler and Leman go spares: Towards scalable higher-order graph embeddings	Christopher Morris, Gaurav Rattan, Petra Mutzel	Advances in Neural Information Processing Systems 33: Annual Conferences on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual
The Complexity of Homomorphism Distinguishability	Jan Boeker, Yijia Chen, Martin Grohe, Gaurav Rattan	Proceedings of the 44rd International Symposium on Mathematical Foundations of Computer Science, 2019.
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks	Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, Martin Grohe	Proceedings of the 33rd AAAI Conference on Artificial Intelligence, 2019.
Graph Similarity and Approximate Isomorphism	Martin Grohe, Gaurav Rattan and Gerhard J. Woeginger.	In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), 2018
Lovasz meets Weisfeiler and Leman	Holger Dell, Martin Grohe and Gaurav Rattan.	In 45th International Colloquium on Automata, Languages, and Programming (ICALP), 2018.
Graph Isomorphism, Color Refinement and Compactness.	Vikraman Arvind, Johannes Koebler, Gaurav Rattan and Oleg Verbitsky.	Computational Complexity, 2017.
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.	Vikraman Arvind, Frank Fuhlbrueck, Johannes Koebler, Sebastian Kuhnert and Gaurav Rattan.	In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
The Parameterized Complexity of Geometric Graph Isomorphism.	Vikraman Arvind and Gaurav Rattan.	Algorithmica, 2016.
On Tinhofer's Linear Programming Approach to Isomorphism Testing.	Vikraman Arvind, Johannes Koebler, Gaurav Rattan and Oleg Verbitsky.	In 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2015
On the Power of Color Refinement.	Vikraman Arvind, Johannes Koebler, Gaurav Rattan and Oleg Verbitsky.	In Fundamentals of Computation Theory (FCT), 2015
On the Isomorphism Problem for Decision Trees and Decision Lists.	Vikraman Arvind, Johannes Kobler, Sebastian Kuhnert, Gaurav Rattan and Yadu Vasudev.	Theoretical Computer Science, 2015.
On the Complexity of Noncommutative Polynomial Factorization.	Vikraman Arvind, Pushkar S. Joglekar and Gaurav Rattan.	In 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2015
The Parameterized Complexity of Geometric Graph Isomorphism.	Vikraman Arvind and Gaurav Rattan.	In 9th International Symposium on Parameterized and Exact Computation (IPEC), 2014.
On the Isomorphism Problem for Decision Trees and Decision Lists.	Vikraman Arvind, Johannes Koebler, Sebastian Kuhnert, Gaurav Rattan and Yadu Vasudev.	In Fundamentals of Computation Theory (FCT), 2013.