This map shows the geographic impact of Akshat Kumar'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 Akshat Kumar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Akshat Kumar more than expected).
This network shows the impact of papers produced by Akshat Kumar. 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 Akshat Kumar. The network helps show where Akshat Kumar may publish in the future.
Co-authorship network of co-authors of Akshat Kumar
This figure shows the co-authorship network connecting the top 25 collaborators of Akshat Kumar.
A scholar is included among the top collaborators of Akshat Kumar 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 Akshat Kumar. Akshat Kumar is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Nguyen, Thien Huu, Akshat Kumar, Hoong Chuin Lau, & Daniel Sheldon. (2016). Approximate inference using DC programming for collective graphical models. International Conference on Artificial Intelligence and Statistics. 51. 685–693.4 indexed citations
9.
Kumar, Akshat, et al.. (2015). Probabilistic inference based message-passing for resource constrained DCOPs. Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University). 411–417.5 indexed citations
10.
Kumar, Akshat, et al.. (2015). Message Passing for Collective Graphical Models. Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University). 853–861.17 indexed citations
11.
Sheldon, Daniel, et al.. (2013). Approximate Inference in Collective Graphical Models. Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University). 28(3). 1004–1012.22 indexed citations
12.
Wu, Xiaojian, Akshat Kumar, Daniel Sheldon, & Shlomo Zilberstein. (2013). Parameter learning for latent network diffusion. Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University). 2923–2930.5 indexed citations
13.
Yeoh, William, Akshat Kumar, & Shlomo Zilberstein. (2013). Automated generation of interaction graphs for value-factored dec-POMDPs. International Joint Conference on Artificial Intelligence. 411–417.1 indexed citations
14.
Kumar, Akshat, Shlomo Zilberstein, & Marc Toussaint. (2012). Message Passing Algorithms for MAP Estimation Using DC Programming. Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University). 22. 656–664.4 indexed citations
Kumar, Akshat, Adrian Petcu, & Boi Faltings. (2008). H-DPOP: using hard constraints for search space pruning in DCOP. Institutional Knowledge (InK) - Institutional Knowledge at Singapore Management University (Singapore Management University). 1. 325–330.11 indexed citations
20.
Kumar, Akshat, Adrian Petcu, & Boi Faltings. (2007). H-DPOP: Using Hard Constraints to Prune the Search Space. Infoscience (Ecole Polytechnique Fédérale de Lausanne).7 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.