Sledovat
Anand Louis
Anand Louis
Indian Institute of Science
E-mailová adresa ověřena na: iisc.ac.in
Název
Citace
Citace
Rok
HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs
N Yadati, M Nimishakavi, P Yadav, V Nitin, A Louis, P Talukdar
Advances in Neural Information Processing Systems, 1509-1520, 2019
144*2019
Many sparse cuts via higher eigenvalues
A Louis, P Raghavendra, P Tetali, S Vempala
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
802012
Spectral properties of hypergraph laplacian and approximation algorithms
THH Chan, A Louis, ZG Tang, C Zhang
Journal of the ACM (JACM) 65 (3), 1-48, 2018
602018
Hypergraph markov operators, eigenvalues and approximation algorithms
A Louis
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
532015
A 3-approximation algorithm for the facility location problem with uniform capacities
A Aggarwal, A Louis, M Bansal, N Garg, N Gupta, S Gupta, S Jain
Mathematical Programming 141 (1), 527-547, 2013
512013
The complexity of approximating vertex expansion
A Louis, P Raghavendra, S Vempala
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 360-369, 2013
372013
A 3-approximation for facility location with uniform capacities
A Aggarwal, L Anand, M Bansal, N Garg, N Gupta, S Gupta, S Jain
Integer Programming and Combinatorial Optimization, 149-162, 2010
322010
Algorithmic extensions of Cheeger’s inequality to higher eigenvalues and partitions
A Louis, P Raghavendra, P Tetali, S Vempala
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
292011
Approximation algorithm for sparsest k-partitioning
A Louis, K Makarychev
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
272014
Linear programming hierarchies suffice for directed Steiner tree
Z Friggstad, J Könemann, Y Kun-Ko, A Louis, M Shadravan, M Tulsiani
International Conference on Integer Programming and Combinatorial …, 2014
262014
Improved algorithm for degree bounded survivable network design problem
A Louis, NK Vishnoi
Scandinavian Workshop on Algorithm Theory, 408-419, 2010
192010
Approximation algorithms for hypergraph small set expansion and small set vertex expansion
A Louis, Y Makarychev
arXiv preprint arXiv:1404.4575, 2014
162014
Accelerated newton iteration for roots of black box polynomials
A Louis, SS Vempala
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
13*2016
NHP: Neural Hypergraph Link Prediction
N Yadati, V Nitin, M Nimishakavi, P Yadav, A Louis, P Talukdar
Proceedings of the 29th ACM International Conference on Information …, 2020
112020
Group Fairness for Knapsack Problems
D Patel, A Khan, A Louis
arXiv preprint arXiv:2006.07832, 2020
112020
On Euclidean k-Means Clustering with alpha-Center Proximity
A Deshpande, A Louis, A Singh
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
8*2019
Approximation Algorithms for Hypergraph Small-Set Expansion and Small-Set Vertex Expansion
A Louis, Y Makarychev
Theory of Computing 12 (1), 1-25, 2016
82016
Cut-Matching Games on Directed Graphs
A Louis
Arxiv preprint arXiv:1010.1047, 2010
82010
On the Problem of Underranking in Group-Fair Ranking
S Gorantla, A Deshpande, A Louis
International Conference on Machine Learning, 3777-3787, 2021
6*2021
Semi-Random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
A Louis, R Venkat
arXiv preprint arXiv:1805.09747, 2018
62018
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20