GAURAV RATTAN
Post-Doctoral Researcher
Dept. of Mathematics
TU Darmstadt
My research interests are
Graph Representation Learning
Logic and Complexity of Graph Problems
Email: rattan [AT] mathematik [dot] tu-darmstadt [dot] de
RESEARCH PROJECTS
Frameworks for Measuring Graph Similarity (2019 - 2022)
DFG Principal Investigator Grant
funding body: German Research Foundation (DFG)
CONFERENCES, proceedings
Weisfeiler-Leman and Graph Spectra (pdf, arxiv)
with Tim Seppelt
SODA 2023
Ordered Subgraph Aggregation Networks (pdf, arxiv, conf-video)
with Chendi Qian, Floris Geerts, Christopher Morris and Mathias Niepert
NeurIPS 2022
Homomorphism Tensors and Linear Equations (pdf, arxiv)
with Martin Grohe and Tim Seppelt
ICALP 2022
SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks (pdf, arxiv)
with Christopher Morris, Sandra Kiefer and Siamak Ravanbaksh
ICML 2022
Weisfeiler and Leman Go Sparse: Towards Scalable Higher-Order Graph Embeddings (pdf, arxiv)
with Christopher Morris and Petra Mutzel
NeurIPS 2020
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks (pdf, arxiv)
with Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, and Martin Grohe.
AAAI 2019
Lovasz Meets Weisfeiler and Leman (pdf, arxiv)
with Holger Dell and Martin Grohe.
ICALP 2018
Graph Isomorphism, Color Refinement and Compactness (pdf, arxiv)
with V. Arvind, Johannes Koebler and Oleg Verbitsky.
Computational Complexity, 2017