![]() | Review waiting, please be patient.
This may take 3 months or more, since drafts are reviewed in no specific order. There are 2,934 pending submissions waiting for review.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
Reviewer tools
|
Submission declined on 6 April 2025 by Sophisticatedevening (talk). This submission's references do not show that the subject qualifies for a Wikipedia article—that is, they do not show significant coverage (not just passing mentions) about the subject in published, reliable, secondary sources that are independent of the subject (see the guidelines on the notability of people). Before any resubmission, additional references meeting these criteria should be added (see technical help and learn about mistakes to avoid when addressing this issue). If no additional references exist, the subject is not suitable for Wikipedia.
Where to get help
How to improve a draft
You can also browse Wikipedia:Featured articles and Wikipedia:Good articles to find examples of Wikipedia's best writing on topics similar to your proposed article. Improving your odds of a speedy review To improve your odds of a faster review, tag your draft with relevant WikiProject tags using the button below. This will let reviewers know a new draft has been submitted in their area of interest. For instance, if you wrote about a female astronomer, you would want to add the Biography, Astronomy, and Women scientists tags. Editor resources
This draft has been resubmitted and is currently awaiting re-review. | ![]() |
Arindam Khan is an Indian computer scientist who works as an Associate Professor at Indian Institute of Science[1]. His research concerns computational geometry, online algorithms, and approximation algorithms.
He studied in Uttarpara Govt. High School [2]. He graduated from IIT Kharagpur in 2009, earned a bachelor's and a master's degree in computer science and engineering. He completed his doctorate in 2015 at the Georgia Institute of Technology, Atlanta under the supervision of Prasad Tetali. His Erdős number is 2 via Prasad Tetali [3].
Arindam is renowned for his work on geometric approximation algorithms and has given improved approximation algorithms for many fundamental problems in multidimensional packing and covering, such as Knapsack problem [4], Strip packing problem [5], Guillotine cutting [6], Maximum disjoint set [7], etc. He is also an author of an influential survey on bin packing [8].
His breakthrough research on the maximum independent set of rectangles was mentioned as one of the top results in theory research in India in the Communications of the ACM (CACM) [9]. Another seminal result on bin packing, where he made progress on celebrated Kenyon's Best-Fit bin packing conjecture after three decades, was mentioned in SIGACT news [10], [11].
He is a recipient of the Best Paper Award in 45th International Symposium on Mathematical Foundations of Computer Science [12], prestigious Google India Research Award [13], and Prof. Priti Shankar Teaching Award [14]. He has served in the program committee of top-tier computer science conferences, including Symposium on Computational Geometry (SOCG) 2023 [15], ACM-SIAM Symposium on Discrete Algorithms (SODA) 2025 [16] and 2026 [17].
Arindam is also popular for science communication and one of the most followed computer scientists in the world on LinkedIn with more than 20,000 followers (and also thousands of followers on Twitter and Quora) [18].
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search