K. Subramani
Impact in
-
- Formal Methods in Verification
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Formal Methods in Verification 36
- Complexity and Algorithms in Graphs 18
- Advanced Graph Theory Research 13
-
- Constraint Satisfaction and Optimization 16
- Optimization and Search Problems 12
- Co-authors
- James B. Orlin (2 shared papers)Kamesh Madduri (3 shared papers)Hans Kleine Büning (3 shared papers)Kim G. Larsen (1 shared paper)Jacob Illum Rasmussen (1 shared paper)Randal E. Bryant (1 shared paper)Sanjit A. Seshia (1 shared paper)Ojas Parekh (2 shared papers)
- Journals
- Theoretical Computer Science (5 papers)Discrete Applied Mathematics (4 papers)Journal of Automated Reasoning (4 papers)Journal of Combinatorial Optimization (4 papers)Theory of Computing Systems (3 papers)
- Partner nations
- United StatesItalyGermany
In The Last Decade
K. Subramani
46 papers receiving 202 citations
Peers
Comparison fields: 5 of 34
- Computational Theory and Mathematics 143
- Software 20
- Computer Networks and Communications 98
- Artificial Intelligence 99
- Hardware and Architecture 19
Countries citing papers authored by K. Subramani
This map shows the geographic impact of K. Subramani'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 K. Subramani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites K. Subramani more than expected).
Fields of papers citing papers by K. Subramani
This network shows the impact of papers produced by K. Subramani. 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 K. Subramani. The network helps show where K. Subramani may publish in the future.
Co-authors
The 20 scholars most cited alongside K. Subramani, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 66 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 47 | |
| 2 | 2007 | 12 | |
| 3 | 2009 | 11 | |
| 4 | 2006 | 10 | |
| 5 | 2007 | 10 | |
| 6 | 2004 | 9 | |
| 7 | 2017 | 8 | |
| 8 | 2018 | 7 | |
| 9 | 2005 | 7 | |
| 10 | 2007 | 7 | |
| 11 | 2013 | 7 | |
| 12 | 2019 | 6 | |
| 13 | 2007 | 6 | |
| 14 | 2009 | 5 | |
| 15 | 2016 | 5 | |
| 16 | 2011 | 5 | |
| 17 | 2004 | 5 | |
| 18 | 2013 | 4 | |
| 19 | 2005 | 4 | |
| 20 | 2017 | 3 |
About K. Subramani
K. Subramani is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Hardware and Architecture and Signal Processing, having authored 66 papers that have together received 221 indexed citations. Recurring topics across this work include Formal Methods in Verification (36 papers), Complexity and Algorithms in Graphs (18 papers), Logic, programming, and type systems (17 papers), Constraint Satisfaction and Optimization (16 papers), Advanced Graph Theory Research (13 papers), Optimization and Search Problems (12 papers), Real-Time Systems Scheduling (8 papers) and Data Management and Algorithms (5 papers). The work is most often cited by research in Computational Theory and Mathematics (143 citations), Software (20 citations), Computer Networks and Communications (98 citations), Artificial Intelligence (99 citations) and Hardware and Architecture (19 citations). K. Subramani has collaborated with scholars based in United States, Italy and Germany. Frequent co-authors include James B. Orlin, Kamesh Madduri, Hans Kleine Büning, Kim G. Larsen, Jacob Illum Rasmussen, Randal E. Bryant, Sanjit A. Seshia, Ojas Parekh, Alvaro Velasquez and R. Chandrasekaran. Their work appears in journals such as Theoretical Computer Science, Discrete Applied Mathematics, Journal of Automated Reasoning, Journal of Combinatorial Optimization and Theory of Computing Systems.
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.