Anand Louis

801 total citations
15 papers, 197 citations indexed

About

Anand Louis is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Vision and Pattern Recognition. According to data from OpenAlex, Anand Louis has authored 15 papers receiving a total of 197 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 5 papers in Artificial Intelligence and 3 papers in Computer Vision and Pattern Recognition. Recurrent topics in Anand Louis's work include Complexity and Algorithms in Graphs (6 papers), Advanced Graph Theory Research (3 papers) and Complex Network Analysis Techniques (3 papers). Anand Louis is often cited by papers focused on Complexity and Algorithms in Graphs (6 papers), Advanced Graph Theory Research (3 papers) and Complex Network Analysis Techniques (3 papers). Anand Louis collaborates with scholars based in United States, India and United Kingdom. Anand Louis's co-authors include Madhav Nimishakavi, Prateek Yadav, Naganand Yadati, Partha Talukdar, Vikram Nitin, Santosh Vempala, Zhihao Gavin Tang, Chenzi Zhang, T-H. Hubert Chan and Prasad Raghavendra and has published in prestigious journals such as Journal of the ACM, Mathematical Programming and Theory of Computing.

In The Last Decade

Anand Louis

14 papers receiving 193 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Anand Louis United States	7	97	66	64	37	28	15	197
Darren Strash United States	7	83 0.9×	69 1.0×	67 1.0×	34 0.9×	8 0.3×	18	200
Rupkumar Mahapatra India	8	58 0.6×	59 0.9×	45 0.7×	32 0.9×	12 0.4×	17	201
Yon Dourisboure France	5	76 0.8×	70 1.1×	120 1.9×	29 0.8×	12 0.4×	5	216
Agnes Radl Germany	8	61 0.6×	69 1.0×	72 1.1×	23 0.6×	17 0.6×	15	218
Virginia Vassilevska United States	8	46 0.5×	120 1.8×	11 0.2×	20 0.5×	9 0.3×	13	186
Ali Pinar United States	3	83 0.9×	32 0.5×	148 2.3×	43 1.2×	13 0.5×	4	205
Daniel Cullina United States	10	220 2.3×	42 0.6×	28 0.4×	85 2.3×	61 2.2×	25	298
Luděk Kučera Czechia	8	102 1.1×	177 2.7×	20 0.3×	19 0.5×	20 0.7×	35	303
Matthew J. Rattigan United States	8	139 1.4×	16 0.2×	162 2.5×	34 0.9×	24 0.9×	15	262
V. Arvind India	11	236 2.4×	305 4.6×	14 0.2×	27 0.7×	16 0.6×	86	398

Countries citing papers authored by Anand Louis

Since Specialization

Citations

This map shows the geographic impact of Anand Louis's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anand Louis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anand Louis more than expected).

Fields of papers citing papers by Anand Louis

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anand Louis. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anand Louis. The network helps show where Anand Louis may publish in the future.

Co-authorship network of co-authors of Anand Louis

This figure shows the co-authorship network connecting the top 25 collaborators of Anand Louis. A scholar is included among the top collaborators of Anand Louis based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anand Louis. Anand Louis is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

15 of 15 papers shown

1.

Deshpande, Amit, et al.. (2023). Sampling Ex-Post Group-Fair Rankings. 409–417.

2.

Deshpande, Amit, et al.. (2020). Ranking for Individual and Group Fairness Simultaneously.. arXiv (Cornell University). 1 indexed citations

3.

Yadati, Naganand, Vikram Nitin, Madhav Nimishakavi, et al.. (2020). NHP: Neural Hypergraph Link Prediction. 1705–1714. 49 indexed citations

4.

Yadati, Naganand, Madhav Nimishakavi, Prateek Yadav, et al.. (2019). HyperGCN: A New Method For Training Graph Convolutional Networks on Hypergraphs. ePrints@IISc (Indian Institute of Science). 32. 1509–1520. 26 indexed citations

5.

Yadati, Naganand, Madhav Nimishakavi, Prateek Yadav, Anand Louis, & Partha Talukdar. (2018). HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification.. arXiv (Cornell University). 12 indexed citations

6.

Deshpande, Amit, et al.. (2018). On Euclidean $k$-Means Clustering with $\alpha$-Center Proximity. arXiv (Cornell University). 2087–2095. 1 indexed citations

7.

Yadati, Naganand, Vikram Nitin, Madhav Nimishakavi, et al.. (2018). Link Prediction in Hypergraphs using Graph Convolutional Networks. 6 indexed citations

8.

Chan, T-H. Hubert, Anand Louis, Zhihao Gavin Tang, & Chenzi Zhang. (2018). Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. Journal of the ACM. 65(3). 1–48. 32 indexed citations

9.

Louis, Anand & Yury Makarychev. (2016). . Theory of Computing. 12(1). 1–25. 4 indexed citations

10.

Louis, Anand & Santosh Vempala. (2016). Accelerated Newton Iteration for Roots of Black Box Polynomials. 5 indexed citations

11.

Louis, Anand. (2015). Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms. 713–722. 21 indexed citations

12.

Louis, Anand & Yury Makarychev. (2014). Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 339–355. 2 indexed citations

13.

Louis, Anand, Prasad Raghavendra, & Santosh Vempala. (2013). The Complexity of Approximating Vertex Expansion. 360–369. 18 indexed citations

14.

Louis, Anand & Konstantin Makarychev. (2013). Approximation Algorithm for Sparsest k-Partitioning. 1244–1255. 3 indexed citations

15.

Louis, Anand, et al.. (2012). A 3-approximation algorithm for the facility location problem with uniform capacities. Mathematical Programming. 141(1-2). 527–547. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact