Citations per year, relative to T. K. Satish Kumar T. K. Satish Kumar (= 1×)
peers
Guni Sharon
Countries citing papers authored by T. K. Satish Kumar
Since
Specialization
Citations
This map shows the geographic impact of T. K. Satish 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 T. K. Satish Kumar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites T. K. Satish Kumar more than expected).
Fields of papers citing papers by T. K. Satish Kumar
This network shows the impact of papers produced by T. K. Satish 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 T. K. Satish Kumar. The network helps show where T. K. Satish Kumar may publish in the future.
Co-authorship network of co-authors of T. K. Satish Kumar
This figure shows the co-authorship network connecting the top 25 collaborators of T. K. Satish Kumar.
A scholar is included among the top collaborators of T. K. Satish 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 T. K. Satish Kumar. T. K. Satish Kumar is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kumar, T. K. Satish, et al.. (2019). Top K Hypotheses Selection on a Knowledge Graph.. The Florida AI Research Society. 136–139.
7.
Fioretto, Ferdinando, Hong Xu, Sven Koenig, & T. K. Satish Kumar. (2018). Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems..
8.
Hönig, Wolfgang, James A. Preiss, T. K. Satish Kumar, Gaurav S. Sukhatme, & Nora Ayanian. (2018). Trajectory Planning for Quadrotor Swarms. IEEE Transactions on Robotics. 34(4). 856–869.193 indexed citations
9.
Nakajima, Masaru, Hong Xu, Sven Koenig, & T. K. Satish Kumar. (2018). Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach..
10.
Xu, Hong, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, & T. K. Satish Kumar. (2018). The Buss Reduction for the k-Weighted Vertex Cover Problem..1 indexed citations
Kumar, T. K. Satish. (2016). Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems..4 indexed citations
15.
Kumar, T. K. Satish, Marcello Cirillo, & Sven Koenig. (2013). On the Traveling Salesman Problem with Simple Temporal Constraints.7 indexed citations
16.
Kumar, T. K. Satish. (2008). Lifting Techniques for Weighted Constraint Satisfaction Problems..7 indexed citations
17.
Nelson, Blaine & T. K. Satish Kumar. (2008). CircuitTSAT: a solver for large instances of the disjunctive temporal problem. International Conference on Automated Planning and Scheduling. 232–239.3 indexed citations
18.
Kumar, T. K. Satish. (2007). Fast (incremental) algorithms for useful classes of simple temporal problems with preferences. International Joint Conference on Artificial Intelligence. 1954–1959.1 indexed citations
Kumar, T. K. Satish & Stuart Russell. (2006). On some tractable cases of logical filtering. International Conference on Automated Planning and Scheduling. 83–92.3 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.