activity
20092023
most citedHyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs

203 citations · 288 across the 21 of their papers we have counts for

collaborators
Showing 2019Show all

3 papers · 1 filter

cs.DS2019

Planted Models for -way Edge and Vertex Expansion

Anand Louis, Rakesh Venkat

Graph partitioning problems are a central topic of study in algorithms and complexity theory. Edge expansion and vertex expansion, two popular graph partitioning objectives, seek a…

cs.DS2019

Approximation Algorithms for Partially Colorable Graphs

Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury

Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For and $k \in \m…

cs.LG2019★ 2 cited

Stability of Linear Structural Equation Models of Causal Inference

Karthik Abinav Sankararaman, Anand Louis, Navin Goyal

We consider the numerical stability of the parameter recovery problem in Linear Structural Equation Model ($\LSEM$) of causal inference. A long line of work starting from Wright (1…