Arindam Khan

601 total citations
30 papers, 280 citations indexed

About

Arindam Khan is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, Arindam Khan has authored 30 papers receiving a total of 280 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Industrial and Manufacturing Engineering, 10 papers in Computer Networks and Communications and 8 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in Arindam Khan's work include Optimization and Packing Problems (14 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Computational Geometry and Mesh Generation (8 papers). Arindam Khan is often cited by papers focused on Optimization and Packing Problems (14 papers), Advanced Manufacturing and Logistics Optimization (12 papers) and Computational Geometry and Mesh Generation (8 papers). Arindam Khan collaborates with scholars based in India, United States and Germany. Arindam Khan's co-authors include Henrik I. Christensen, Prasad Tetali, Sebastian Pokutta, Nikhil Bansal, Jeanne Bertolli, Cynthia A. Moore, Siddharth Barman, Marek Eliáš, Manoj Prabhakaran and Carl A. Gunter and has published in prestigious journals such as Journal of the American Medical Informatics Association, Discrete Applied Mathematics and Algorithmica.

In The Last Decade

Arindam Khan

28 papers receiving 269 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Arindam Khan India	7	129	86	55	49	46	30	280
Ariel Kulik Israel	6	38 0.3×	145 1.7×	68 1.2×	19 0.4×	37 0.8×	11	254
Ling Gou China	7	196 1.5×	53 0.6×	48 0.9×	20 0.4×	1 0.0×	10	295
V. Zissimopoulos France	11	152 1.2×	230 2.7×	71 1.3×	30 0.6×	99 2.2×	18	432
Claudia Frydman France	9	44 0.3×	31 0.4×	39 0.7×	34 0.7×	2 0.0×	41	202
Juan Fernández-Olivares Spain	10	37 0.3×	64 0.7×	179 3.3×	47 1.0×		34	291
Charles Fleurent Canada	6	245 1.9×	90 1.0×	105 1.9×	17 0.3×	7 0.2×	6	369
Andreas Solti Austria	7	47 0.4×	44 0.5×	81 1.5×	158 3.2×		15	278
Kevin Wayne United States	8	25 0.2×	66 0.8×	33 0.6×	14 0.3×	9 0.2×	18	205
Pierre Schaus Belgium	11	54 0.4×	232 2.7×	123 2.2×	54 1.1×	2 0.0×	43	436
Manoel Campêlo Brazil	9	101 0.8×	29 0.3×	15 0.3×	6 0.1×	7 0.2×	34	253

Countries citing papers authored by Arindam Khan

Since Specialization

Citations

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

Fields of papers citing papers by Arindam Khan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Arindam Khan

This figure shows the co-authorship network connecting the top 25 collaborators of Arindam Khan. A scholar is included among the top collaborators of Arindam Khan 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 Arindam Khan. Arindam Khan 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:

20 of 20 papers shown

Khan, Arindam, et al.. (2023). Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. Algorithmica. 85(9). 2735–2778. 1 indexed citations

Jansen, Klaus, et al.. (2023). Peak Demand Minimization via Sliced Strip Packing. Algorithmica. 85(12). 3649–3679. 1 indexed citations

Barman, Siddharth, et al.. (2023). Finding Fair Allocations under Budget Constraints. Proceedings of the AAAI Conference on Artificial Intelligence. 37(5). 5481–5489. 5 indexed citations

Grandoni, Fabrizio, et al.. (2023). A Tight $$(3/2+\varepsilon )$$-Approximation for Skewed Strip Packing. Algorithmica. 85(10). 3088–3109.

Barman, Siddharth, et al.. (2023). Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. Proceedings of the AAAI Conference on Artificial Intelligence. 37(6). 6762–6769. 3 indexed citations

Barman, Siddharth, et al.. (2022). Universal and Tight Online Algorithms for Generalized-Mean Welfare. Proceedings of the AAAI Conference on Artificial Intelligence. 36(5). 4793–4800. 5 indexed citations

Jansen, Klaus, et al.. (2021). Peak Demand Minimization via Sliced Strip Packing. ArXiv.org. 1 indexed citations

Grandoni, Fabrizio, et al.. (2021). Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

Khan, Arindam, et al.. (2021). Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization. ePrints@IISc (Indian Institute of Science). 34. 2 indexed citations

10.

Grandoni, Fabrizio, et al.. (2020). A Tight (3/2+ε) Approximation for Skewed Strip Packing. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

11.

Khan, Arindam, et al.. (2020). Symbolic execution based feature extraction for detection of malware. 1–6. 4 indexed citations

12.

Peddoju, Sateesh K., et al.. (2017). Design and Analysis of a Modified Remote Attestation Protocol. 13. 578–585. 3 indexed citations

13.

Christensen, Henrik I., Arindam Khan, Sebastian Pokutta, & Prasad Tetali. (2017). Approximation and online algorithms for multidimensional bin packing: A survey. Computer Science Review. 24. 63–79. 130 indexed citations

14.

Khan, Arindam & Mohit Singh. (2015). On Weighted Bipartite Edge Coloring. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

15.

Khan, Arindam & Prasad Raghavendra. (2014). On mimicking networks representing minimum terminal cuts. Information Processing Letters. 114(7). 365–371. 6 indexed citations

16.

Khan, Arindam, et al.. (2013). Diffuse reflection diameter and radius for convex-quadrilateralizable polygons. Discrete Applied Mathematics. 161(10-11). 1496–1505. 2 indexed citations

17.

Pandit, Vinayaka, et al.. (2011). Discovering Bucket Orders from Data.. 107(4). 872–883. 1 indexed citations

18.

Bobba, Rakesh B., Omid Fatemieh, Arindam Khan, et al.. (2010). Attribute-Based Messaging. ACM Transactions on Information and System Security. 13(4). 1–35. 20 indexed citations

19.

Khan, Arindam, et al.. (2010). A cryptographic primitive based authentication scheme for run-time software of embedded systems. 500–504. 2 indexed citations

20.

Khan, Arindam, et al.. (2006). Standardizing Laboratory Data by Mapping to LOINC. Journal of the American Medical Informatics Association. 13(3). 353–355. 37 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