logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Back
K

K. Subramani

West Virginia University

17H-index
218Paper Count
968Citation Count
Published Papers 13
Publication Date
logo
Maximum Path Sets in Trees
errREACHABILITY PROBLEMS, RP 2025
IF0
err2026-01-01
err0
PREAI
errSubramani, A.; Subramani, K.; Restanio, Jacob
errShare
errSave
Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems
errLOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2025, PT I
IF0
err2026-01-01
err0
PREAI
errWojciechowski, P.; Subramani, K.
errShare
errSave
Dual layered Janus nonwovens with asymmetric wettability for efficient directional moisture transport
errColloids and Surfaces A: Physicochemical and Engineering Aspects
IF5.4
err2025-11-05
err0
PREAI
errKumaresan Subramani; Sollazhagan Nataraj; Porika Anirudh Naik; Rengasamy Raju Seenivasan; Harun Venkatesan
errShare
errSave
Advancing discrete optimization: novel approaches with dataless neural networks
errJournal of Combinatorial Optimization
IF1.1
err2025-11-02
err0
PREAI
errJena, Sangram K.; Subramani, K.; Velasquez, Alvaro
errShare
errSave
Computational and approximation complexities of MINNAESAT variants
errDISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
IF0.4
err2025-11-01
err0
PREAI
errJena, Sangram K.; Subramani, K.
errShare
errSave
Exploring cycle cover variants: A dataless neural networks approach
errNeurocomputing
IF6.5
err2025-09-02
err0
PREAI
errSangram K. Jena; K. Subramani; Alvaro Velasquez
errShare
errSave
Arc-dependent networks: theoretical insights and a computational study
errANNALS OF OPERATIONS RESEARCH
IF4.5
err2024-04-09
err0
PREAI
errVelasquez, Alvaro; Wojciechowski, P.; Subramani, K.; Williamson, Matthew
errShare
errSave
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
errCOMPUTING
IF2.8
err2010-08-11
err2
PREAI
errSubramani, K.; Madduri, Kamesh
errShare
errSave
Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm
errAPPLIED MATHEMATICS AND COMPUTATION
IF3.4
err2010-01-01
err2
PREAI
errSubramani, K.; Tauras, C.; Madduri, K.
errShare
errSave
Computing inversion pair cardinality through partition-based sorting
errCOMPUTING
IF2.8
err2008-09-03
err0
PREAI
errSubramani, K.
errShare
errSave
Distributed algorithms for partially clairvoyant dispatchers
errCLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS
IF4.1
err2007-08-17
err0
PREAI
errSubramani, K.; Yellajyosula, Kiran; Osman, A.
errShare
errSave
On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
errAPPLIED MATHEMATICS AND COMPUTATION
IF3.4
err2006-02-01
err1
PREAI
errSubramani, K; Desovski, D
errShare
errSave
A greedy strategy for detecting negative cost cycles in networks
errFUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE
IF6.1
err2005-04-01
err7
PREAI
errSubramani, K; Kovalchick, L
errShare
errSave

Research Directions

No research directions
Co-authors
Cooperation Journals
S
S.K. Nataraj
H-index: 44 · Papers: 220
K
Kamesh Madduri
H-index: 28 · Papers: 201
A
Alvaro Velasquez
H-index: 18 · Papers: 225
H
Harun Venkatesan
H-index: 16 · Papers: 37
A
Addin Osman
H-index: 8 · Papers: 20
View more