T. K. Satish Kumar

3.8k total citations
131 papers, 1.9k citations indexed

About

T. K. Satish Kumar is a scholar working on Signal Processing, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, T. K. Satish Kumar has authored 131 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 52 papers in Signal Processing, 44 papers in Computer Networks and Communications and 44 papers in Computer Vision and Pattern Recognition. Recurrent topics in T. K. Satish Kumar's work include Speech and Audio Processing (35 papers), Robotic Path Planning Algorithms (32 papers) and Advanced Adaptive Filtering Techniques (24 papers). T. K. Satish Kumar is often cited by papers focused on Speech and Audio Processing (35 papers), Robotic Path Planning Algorithms (32 papers) and Advanced Adaptive Filtering Techniques (24 papers). T. K. Satish Kumar collaborates with scholars based in United States, India and Israel. T. K. Satish Kumar's co-authors include Sven Koenig, Hang Ma, Nora Ayanian, Jiaoyang Li, Wolfgang Hönig, Liron Cohen, Glenn Wagner, James A. Preiss, Gaurav S. Sukhatme and Ariel Felner and has published in prestigious journals such as SHILAP Revista de lepidopterología, Artificial Intelligence and Journal of the Optical Society of America A.

In The Last Decade

T. K. Satish Kumar

114 papers receiving 1.8k citations

Peers

T. K. Satish Kumar
Guni Sharon United States
Daniel Harabor Australia
Mark H. Overmars Netherlands
Adi Botea Ireland
Nora Ayanian United States
Yuan Zhou China
Amanda Prorok United Kingdom
Guni Sharon United States
T. K. Satish Kumar
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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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.

All Works

20 of 20 papers shown
1.
Kumar, T. K. Satish, et al.. (2024). Design of a Rapid Injury Response System in a Smart Factory. Procedia CIRP. 128. 787–792. 1 indexed citations
2.
Kumar, T. K. Satish, et al.. (2024). Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem. Proceedings of the International Conference on Automated Planning and Scheduling. 34. 484–488.
3.
White, Malcolm C. A., Kushal Sharma, Ang Li, T. K. Satish Kumar, & Nori Nakata. (2023). Classifying seismograms using the FastMap algorithm and support-vector machines. Communications Engineering. 2(1). 2 indexed citations
4.
Li, Jiaoyang, et al.. (2022). Multi-agent path finding with mutex propagation. Artificial Intelligence. 311. 103766–103766. 13 indexed citations
5.
Oftelie, Lindsay Bassman, Sahil Gulania, Rongpeng Li, et al.. (2020). Domain-specific compilers for dynamic simulations of quantum materials on quantum computers. Quantum Science and Technology. 6(1). 14007–14007. 6 indexed citations
6.
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
11.
Ma, Hang, Glenn Wagner, Ariel Felner, et al.. (2018). Multi-Agent Path Finding with Deadlines: Preliminary Results. Adaptive Agents and Multi-Agents Systems. 2004–2006. 1 indexed citations
12.
Ma, Hang, et al.. (2017). Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 13(1). 270–272. 15 indexed citations
13.
Ma, Hang, Jiaoyang Li, T. K. Satish Kumar, & Sven Koenig. (2017). Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks. Adaptive Agents and Multi-Agents Systems. 837–845. 110 indexed citations
14.
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
19.
Kumar, T. K. Satish, et al.. (2007). RSTM : A Relaxed Consistency Software Transactional Memory for Multicores. International Conference on Parallel Architectures and Compilation Techniques. 428–428. 5 indexed citations
20.
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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026