K. Subramani

968 total citations
65 papers, 217 citations indexed

About

K. Subramani is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, K. Subramani has authored 65 papers receiving a total of 217 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 36 papers in Computer Networks and Communications and 28 papers in Artificial Intelligence. Recurrent topics in K. Subramani's work include Formal Methods in Verification (36 papers), Complexity and Algorithms in Graphs (18 papers) and Logic, programming, and type systems (17 papers). K. Subramani is often cited by papers focused on Formal Methods in Verification (36 papers), Complexity and Algorithms in Graphs (18 papers) and Logic, programming, and type systems (17 papers). K. Subramani collaborates with scholars based in United States, Italy and Greece. K. Subramani's co-authors include James B. Orlin, Kamesh Madduri, Hans Kleine Büning, Kim G. Larsen, Sanjit A. Seshia, Jacob Illum Rasmussen, Randal E. Bryant, Salvatore Ruggieri, Ojas Parekh and Ashish Gehani and has published in prestigious journals such as Neurocomputing, Future Generation Computer Systems and Applied Mathematics and Computation.

In The Last Decade

K. Subramani

44 papers receiving 198 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
K. Subramani United States	8	143	99	95	24	22	65	217
Anton Belov Ireland	8	126 0.9×	160 1.6×	82 0.9×	7 0.3×	13 0.6×	19	236
Stephen M. Majercik United States	8	60 0.4×	220 2.2×	78 0.8×	16 0.7×	8 0.4×	16	253
Andrea Micheli Italy	9	92 0.6×	108 1.1×	84 0.9×	12 0.5×	12 0.5×	27	205
Pablo Rabanal Spain	8	36 0.3×	78 0.8×	44 0.5×	11 0.5×	19 0.9×	21	149
Joachim Kneis Germany	10	154 1.1×	29 0.3×	101 1.1×	9 0.4×	31 1.4×	17	220
Sophie Pinchinat France	10	215 1.5×	139 1.4×	51 0.5×	11 0.5×	4 0.2×	39	292
Roberto Asín‐Achá Chile	8	74 0.5×	73 0.7×	68 0.7×	12 0.5×	5 0.2×	21	188
Romain Jacob Switzerland	7	148 1.0×	75 0.8×	157 1.7×	6 0.3×	40 1.8×	22	257
Ehsan Khamespanah Iran	9	93 0.7×	66 0.7×	55 0.6×	9 0.4×	14 0.6×	28	184
Philippe Codognet France	9	37 0.3×	127 1.3×	137 1.4×	50 2.1×	5 0.2×	24	215

Countries citing papers authored by K. Subramani

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of K. Subramani

This figure shows the co-authorship network connecting the top 25 collaborators of K. Subramani. A scholar is included among the top collaborators of K. Subramani 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 K. Subramani. K. Subramani is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Subramani, K., et al.. (2025). Advancing discrete optimization: novel approaches with dataless neural networks. Journal of Combinatorial Optimization. 50(4).

Subramani, K., et al.. (2025). Exploring cycle cover variants: A dataless neural networks approach. Neurocomputing. 656. 131361–131361.

Subramani, K., et al.. (2024). Designing dataless neural networks for kidney exchange variants. Neural Computing and Applications. 36(35). 22265–22275. 2 indexed citations

Velasquez, Alvaro, et al.. (2023). Optimal Deterministic Controller Synthesis from Steady-State Distributions. Journal of Automated Reasoning. 67(1).

Subramani, K., et al.. (2023). Priority-based bin packing with subset constraints. Discrete Applied Mathematics. 342. 64–75.

Subramani, K., et al.. (2022). Analyzing Read-Once Cutting Plane Proofs in Horn Systems. Journal of Automated Reasoning. 66(2). 239–274.

Velasquez, Alvaro, et al.. (2022). On the complexity of and solutions to the minimum stopping and trapping set problems. Theoretical Computer Science. 915. 26–44. 1 indexed citations

Subramani, K., et al.. (2020). Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective.. 1 indexed citations

Büning, Hans Kleine, et al.. (2018). Finding read-once resolution refutations in systems of 2CNF clauses. Theoretical Computer Science. 729. 42–56. 7 indexed citations

10.

Orlin, James B., et al.. (2017). Randomized algorithms for finding the shortest negative cost cycle in networks. Discrete Applied Mathematics. 236. 387–394. 3 indexed citations

11.

Velasquez, Alvaro, et al.. (2016). The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks. Journal of International Crisis and Risk Communication Research. 27. 126–130.

12.

Subramani, K., et al.. (2015). On the negative cost girth problem in planar networks. Journal of Discrete Algorithms. 35. 40–50. 2 indexed citations

13.

Subramani, K., et al.. (2014). Feasibility checking in Horn constraint systems through a reduction based approach. Theoretical Computer Science. 576. 1–17. 2 indexed citations

14.

Ruggieri, Salvatore, et al.. (2013). On the complexity of quantified linear systems. Theoretical Computer Science. 518. 128–134. 2 indexed citations

15.

Chandrasekaran, R. & K. Subramani. (2013). A combinatorial algorithm for Horn programs. Discrete Optimization. 10(2). 85–101. 4 indexed citations

16.

Ruggieri, Salvatore, et al.. (2012). Computational complexity of inclusion queries over polyhedral sets. 1–8. 1 indexed citations

17.

Orlin, James B., et al.. (2009). A faster algorithm for the single source shortest path problem with few distinct positive lengths. Journal of Discrete Algorithms. 8(2). 189–198. 47 indexed citations

18.

Subramani, K.. (2007). A Zero-Space algorithm for Negative Cost Cycle Detection in networks. Journal of Discrete Algorithms. 5(3). 408–421. 6 indexed citations

19.

Subramani, K., et al.. (2005). Out of order quantifier elimination for Standard Quantified Linear Programs. Journal of Symbolic Computation. 40(6). 1383–1396.

20.

Subramani, K.. (2004). Tractable Fragments of Presburger Arithmetic. Theory of Computing Systems. 38(5). 647–668. 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