Logik
und Theorie
diskreter Systeme

Informatik 7

 

Dr. Gaurav Rattan

Post-doctoral Researcher,
Logic and Theory of Discrete Systems,
Lehrstuhl fur Informatik 7,
RWTH Aachen

 

 

 Kontakt

Anschrift RWTH Aachen, Lehrstuhl für Informatik 7, 52074 Aachen
Büro Raum 4118, Ahornstr. 55, 52074 Aachen
Telefon +49 (241) 80 21714
E-Mail rattan(at)informatik.rwth-aachen.de
Sprechstunde nach Vereinbarung

My Curriculum Vitae.  

Please find a complete list of my publications here (at the bottom of this page). 

Research 

Algorithms and Complexity (The Graph Isomorphism Problem). 

Machine Learning (Graph Classification, Graph Kernels). 

Academic Visits

Participated in an Alexander von Humboldt Foundation funded project 
from 2012-2015, with yearly travel support for visiting Humboldt University, Berlin.

Teaching (Co-Instructor) Algorithmic Learning Theory, 2018 (RWTH Aachen) 
(Assistant) Foundations of Data Science, 2017-18 (RWTH Aachen) 
Brief Bio Post-doctoral Researcher at i7 RWTH Aachen (2017 - current) 
Ph.D.The Institute of Mathematical Sciences, Chennai, India (2010-2016) 
M.Sc.The Institute of Mathematical Sciences, Chennai, India (2010-2012) 
B.Tech.IIT Bombay (2004-2008)  

Recent Publications

 

Lovasz meets Weisfeiler-Leman.
Holger Dell, Martin Grohe and Gaurav Rattan. 
ICALP, 2018 (to appear)
arXiv

Graph Similarity and Approximate Isomorphism. 
Martin Grohe, Gaurav Rattan and Gerhard J. Woeginger. 
MFCS, 2018 (to appear).
arXiv 

Graph Isomorphism, Color Refinement and Compactness. 
Vikraman Arvind, Johannes Koebler, Gaurav Rattan and Oleg Verbitsky. 
Computational Complexity, 2017.
arXiv

 

 


 

 PUBLICATIONS (also listed at DBLP)

 

JOURNALS

Graph Isomorphism, Color Refinement and Compactness. 
Vikraman Arvind, Johannes Koebler, Gaurav Rattan and Oleg Verbitsky. 
Computational Complexity, 2017.
arXiv

The Parameterized Complexity of Geometric Graph Isomorphism. 
Vikraman Arvind and Gaurav Rattan. 
Algorithmica, 2016.
arXiv

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. 

 

CONFERENCES

Graph Similarity and Approximate Isomorphism.
Martin Grohe, Gaurav Rattan and Gerhard J. Woeginger.
In 43rd International Symposium on Mathematical Foundations of Computer Science (to appear)
MFCS, 2018 .
arXiv

Lovasz meets Weisfeiler and Leman.
Holger Dell, Martin Grohe and Gaurav Rattan.
In 45th International Colloquium on Automata, Languages, and Programming
ICALP, 2018 (to appear).
arXiv

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.
arXiv

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.
arXiv

On the Power of Color Refinement.
Vikraman Arvind, Johannes Koebler, Gaurav Rattan and Oleg Verbitsky.
In Fundamentals of Computation Theory
FCT, 2015.
arXiv

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.
arXiv

The Parameterized Complexity of Geometric Graph Isomorphism.
Vikraman Arvind and Gaurav Rattan.
In 9th International Symposium on Parameterized and Exact Computation
IPEC, 2014.
ECCC

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.

 

THESES Some Geometrical and Vertex-Partitioning Techniques for Graph Isomorphism.
Doctoral Thesis, 2016.

Spectral Algorithms for Unique Games.
Master's Thesis, 2012.

 

Datenschutzerklaerung