Amitabh Basu

1.1k total citations
45 papers, 332 citations indexed

About

Amitabh Basu is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Artificial Intelligence. According to data from OpenAlex, Amitabh Basu has authored 45 papers receiving a total of 332 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 11 papers in Numerical Analysis and 10 papers in Artificial Intelligence. Recurrent topics in Amitabh Basu's work include Complexity and Algorithms in Graphs (12 papers), Advanced Optimization Algorithms Research (10 papers) and Computational Geometry and Mesh Generation (8 papers). Amitabh Basu is often cited by papers focused on Complexity and Algorithms in Graphs (12 papers), Advanced Optimization Algorithms Research (10 papers) and Computational Geometry and Mesh Generation (8 papers). Amitabh Basu collaborates with scholars based in United States, Italy and Switzerland. Amitabh Basu's co-authors include Joseph S. B. Mitchell, Michele Conforti, Gérard Cornuéjols, Matthias Köppe, Giacomo Zambelli, Jie Gao, Kipp Martin, Marco Di Summa, Tamás Budavári and Pierre Bonami and has published in prestigious journals such as The Astrophysical Journal, Monthly Notices of the Royal Astronomical Society and Pattern Recognition.

In The Last Decade

Amitabh Basu

42 papers receiving 306 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Amitabh Basu United States 10 100 61 61 54 51 45 332
Donald K. Wagner United States 9 170 1.7× 64 1.0× 93 1.5× 69 1.3× 140 2.7× 32 403
Manabu Shirosaki Japan 5 59 0.6× 116 1.9× 18 0.3× 28 0.5× 37 0.7× 20 441
Gábor Pataki United States 11 216 2.2× 68 1.1× 62 1.0× 60 1.1× 53 1.0× 19 515
Christian Michelot France 11 155 1.6× 110 1.8× 19 0.3× 33 0.6× 29 0.6× 27 446
L. G. Casado Spain 14 238 2.4× 115 1.9× 54 0.9× 92 1.7× 98 1.9× 60 511
Giacomo Zambelli Italy 10 232 2.3× 135 2.2× 67 1.1× 33 0.6× 50 1.0× 24 410
Ehl Emile Aarts Netherlands 6 76 0.8× 125 2.0× 42 0.7× 104 1.9× 75 1.5× 18 363
Evanthia Papadopoulou United States 12 84 0.8× 51 0.8× 93 1.5× 15 0.3× 66 1.3× 50 461
Imre Bárány Hungary 17 167 1.7× 35 0.6× 49 0.8× 74 1.4× 35 0.7× 61 857
M. Sharir United States 11 153 1.5× 59 1.0× 21 0.3× 36 0.7× 45 0.9× 13 477

Countries citing papers authored by Amitabh Basu

Since Specialization
Citations

This map shows the geographic impact of Amitabh Basu'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 Amitabh Basu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amitabh Basu more than expected).

Fields of papers citing papers by Amitabh Basu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Amitabh Basu. 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 Amitabh Basu. The network helps show where Amitabh Basu may publish in the future.

Co-authorship network of co-authors of Amitabh Basu

This figure shows the co-authorship network connecting the top 25 collaborators of Amitabh Basu. A scholar is included among the top collaborators of Amitabh Basu 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 Amitabh Basu. Amitabh Basu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Basu, Amitabh, et al.. (2024). Information complexity of mixed-integer convex optimization. Mathematical Programming. 210(1-2). 3–45.
2.
Cheng, Hongyu, et al.. (2023). Neural networks with linear threshold activations: structure and algorithms. Mathematical Programming. 206(1-2). 333–356. 2 indexed citations
3.
Basu, Amitabh, et al.. (2023). Fast Globally Optimal Catalog Matching using MIQCP. The Astronomical Journal. 166(4). 174–174.
4.
Basu, Amitabh, et al.. (2022). Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II. COMBINATORICA. 42(S1). 971–996. 2 indexed citations
5.
Nguyen, Tu, Amitabh Basu, & Tamás Budavári. (2022). Globally Optimal and Scalable N-way Matching of Astronomy Catalogs. The Astronomical Journal. 163(6). 296–296. 1 indexed citations
6.
Basu, Amitabh, et al.. (2021). Split cuts in the plane. Research Padua Archive (University of Padua). 2 indexed citations
7.
Basu, Amitabh, et al.. (2021). Towards Lower Bounds on the Depth of ReLU Neural Networks. Research Padua Archive (University of Padua). 2 indexed citations
8.
Basu, Amitabh, et al.. (2018). Convergence guarantees for RMSProp and ADAM in non-convex optimization and their comparison to Nesterov acceleration on autoencoders.. arXiv (Cornell University). 16 indexed citations
9.
Basu, Amitabh, Michele Conforti, Gérard Cornuéjols, & Giacomo Zambelli. (2018). Maximal Lattice-Free Convex Sets in Linear Subspaces. Figshare. 4 indexed citations
10.
Basu, Amitabh, Gérard Cornuéjols, & François Margot. (2018). Intersection Cuts with Infinite Split Rank. Figshare.
11.
Averkov, Gennadiy, et al.. (2018). Approximation of Corner Polyhedra with Families of Intersection Cuts. SIAM Journal on Optimization. 28(1). 904–929. 1 indexed citations
12.
Arora, Ashish, et al.. (2017). Critical Points Of An Autoencoder Can Provably Recover Sparsely Used Overcomplete Dictionaries.. arXiv (Cornell University). 2 indexed citations
13.
Basu, Amitabh, et al.. (2016). Strong duality and sensitivity analysis in semi-infinite linear programming. Mathematical Programming. 161(1-2). 451–485. 7 indexed citations
14.
Budavári, Tamás & Amitabh Basu. (2016). PROBABILISTIC CROSS-IDENTIFICATION IN CROWDED FIELDS AS AN ASSIGNMENT PROBLEM. The Astronomical Journal. 152(4). 86–86. 4 indexed citations
15.
Basu, Amitabh, et al.. (2014). Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming. Mathematics of Operations Research. 40(1). 146–170. 7 indexed citations
16.
Basu, Amitabh, et al.. (2013). On Chubanov's Method for Linear Programming. INFORMS journal on computing. 26(2). 336–350. 5 indexed citations
17.
Basu, Amitabh, et al.. (2012). Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The\n One-Dimensional Case. eScholarship (California Digital Library). 7 indexed citations
18.
Basu, Amitabh, Michele Conforti, Gérard Cornuéjols, & Giacomo Zambelli. (2010). A counterexample to a conjecture of Gomory and Johnson. Mathematical Programming. 133(1-2). 25–38. 14 indexed citations
19.
Basu, Amitabh, et al.. (2009). Geometric algorithms for optimal airspace design and air traffic controller workload balancing. ACM Journal of Experimental Algorithmics. 14. 42 indexed citations
20.
Basu, Amitabh. (1969). On Some Tests for Several Linear Relations. Journal of the Royal Statistical Society Series B (Statistical Methodology). 31(1). 65–71. 9 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

Rankless by CCL
2026