K. Subramani Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. [Citation Graph (0, 0)][DBLP] ADHOC-NOW, 2005, pp:320-333 [Conf]
K. Subramani On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. [Citation Graph (0, 0)][DBLP] AISC, 2002, pp:217-230 [Conf]
K. Subramani On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. [Citation Graph (0, 0)][DBLP] ASIAN, 2002, pp:57-65 [Conf]
K. Subramani, Dejan Desovski On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science (1), 2005, pp:180-187 [Conf]
K. Subramani, Lisa Kovalchick Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. [Citation Graph (0, 0)][DBLP] International Conference on Computational Science, 2003, pp:377-387 [Conf]
K. Subramani Totally Clairvoyant Scheduling with Relative Timing Constraints. [Citation Graph (0, 0)][DBLP] VMCAI, 2006, pp:398-411 [Conf]
K. Subramani A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling. [Citation Graph (0, 0)][DBLP] Comput. J., 2005, v:48, n:3, pp:259-272 [Journal]
K. Subramani On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2004, v:50, n:3, pp:281-292 [Journal]
K. Subramani Periodic Linear Programming with applications to real-time scheduling. [Citation Graph (0, 0)][DBLP] Mathematical Structures in Computer Science, 2005, v:15, n:2, pp:383-406 [Journal]
K. Subramani Tractable Fragments of Presburger Arithmetic. [Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2005, v:38, n:5, pp:647-668 [Journal]