Spectral Properties of Hypergraph Laplacian and Approximation Algorithms von Chan, T.-H. Hubert, Louis, Anand, Tang, Zhihao Gavin, Zhang, Chenzi

Volltext

Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions von Louis, Anand, Raghavendra, Prasad, Tetali, Prasad, Vempala, Santosh

Volltext

A 3-approximation algorithm for the facility location problem with uniform capacities von Aggarwal, Ankit, Louis, Anand, Bansal, Manisha, Garg, Naveen, Gupta, Neelima, Gupta, Shubham, Jain, Surabhi

Volltext

Independent Sets in Semi-random Hypergraphs von Khanna, Yash, Louis, Anand, Paul, Rameesh

Volltext

On Sparsest Cut and Conductance in Directed Polymatroidal Networks von Chekuri, Chandra, Louis, Anand

Volltext bestellen

New Approximation Bounds for Small-Set Vertex Expansion von Ghoshal, Suprovat, Louis, Anand

Volltext bestellen

Graph Neural Networks for Soft Semi-Supervised Learning on Hypergraphs von Yadati, Naganand, Gao, Tingran, Asoodeh, Shahab, Talukdar, Partha, Louis, Anand

Volltext

Socially Fair Center-Based and Linear Subspace Clustering von Gorantla, Sruthi, Gowda, Kishen N., Deshpande, Amit, Louis, Anand

Volltext

Approximating CSPs with Outliers von Ghoshal, Suprovat, Louis, Anand

Volltext bestellen

Improved linearly ordered colorings of hypergraphs via SDP rounding von Louis, Anand, Newman, Alantha, Ray, Arka

Volltext bestellen

On Sparsest Cut and Conductance in Directed Polymatroidal Networks von Chekuri, Chandra, Anand, Louis

Volltext

Approximation Algorithms and Hardness for Strong Unique Games von Ghoshal, Suprovat, Louis, Anand

Volltext bestellen

Planted Models for the Densest $k$-Subgraph Problem von Khanna, Yash, Louis, Anand

Volltext bestellen

New Approximation Bounds for Small-Set Vertex Expansion von Ghoshal, Suprovat, Anand, Louis

Volltext

Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes von Louis, Anand, Paul, Rameesh, Ray, Arka

Volltext bestellen

Planted Models for $k$-way Edge and Vertex Expansion von Louis, Anand, Venkat, Rakesh

Volltext bestellen

Improved Algorithm for Degree Bounded Survivable Network Design Problem von Anand, Louis, Vishnoi, Nisheeth

Volltext

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All von Panda, Atasi, Louis, Anand, Nimbhorkar, Prajakta

Volltext bestellen

Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs von Kumar, Akash, Louis, Anand, Paul, Rameesh

Volltext bestellen

Sampling Ex-Post Group-Fair Rankings von Gorantla, Sruthi, Deshpande, Amit, Louis, Anand

Volltext bestellen