Shiva Kintali
About
In The Last Decade
Shiva Kintali
7 papers receiving 40 citations
Peers
Comparison fields: 5 of 12
- Management Science and Operations Research 19
- Computational Theory and Mathematics 18
- Economics and Econometrics 17
- Computer Networks and Communications 11
- Artificial Intelligence 11
Countries citing papers authored by Shiva Kintali
This map shows the geographic impact of Shiva Kintali'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 Shiva Kintali with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shiva Kintali more than expected).
Fields of papers citing papers by Shiva Kintali
This network shows the impact of papers produced by Shiva Kintali. 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 Shiva Kintali. The network helps show where Shiva Kintali may publish in the future.
Co-authorship network of co-authors of Shiva Kintali
This figure shows the co-authorship network connecting the top 25 collaborators of Shiva Kintali. A scholar is included among the top collaborators of Shiva Kintali 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 Shiva Kintali. Shiva Kintali is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 12 | |
| 4 | Computing Bounded Path Decompositions in Logspace. | 2 |
| 5 | Realizable paths and the nl vs l problem | 1 |
| 6 | Approximation Algorithms for Directed Width Parameters | 2 |
| 7 | 16 | |
| 8 | A Distributed Protocol for Fractional Stable Paths Problem | 2 |
| 9 | 9 |
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.