Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
K. Subramani
2010 – today
- 2013
[j40]R. Chandrasekaran, K. Subramani: A combinatorial algorithm for Horn programs. Discrete Optimization 10(2): 85-101 (2013)- [j39]K. Subramani, Matthew Williamson, Xiaofeng Gu: Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Asp. Comput. 25(2): 319-341 (2013)
- [i1]Bugra Caskurlu, K. Subramani: On Partial Vertex Cover on Bipartite Graphs and Trees. CoRR abs/1304.5934 (2013)
- 2012
- [j38]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski: A complexity perspective on entailment of parameterized linear constraints. Constraints 17(4): 461-487 (2012)
- [c30]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr J. Wojciechowski: Computational complexity of inclusion queries over polyhedral sets. ISAIM 2012
- 2011
- [j37]K. Subramani, Xiaofeng Gu: Absorbing random walks and the NAE2SAT problem. Int. J. Comput. Math. 88(3): 452-467 (2011)
- [j36]Natarajan Shankar, K. Subramani: A mechanical verification of the stressing algorithm for negative cost cycle detection in networks. Sci. Comput. Program. 76(7): 609-626 (2011)
- [c29]Ashish Gehani, Lee Zaniewski, K. Subramani: Algorithmic Aspects of Risk Management. Formal Modeling: Actors, Open Systems, Biological Systems 2011: 262-276
- [c28]K. Subramani, James Worthington: A New Algorithm for Linear and Integer Feasibility in Horn Constraints. CPAIOR 2011: 215-229
- 2010
- [j35]K. Subramani, C. Tauras, Kamesh Madduri: Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm. Applied Mathematics and Computation 215(10): 3563-3575 (2010)
- [j34]K. Subramani, Kamesh Madduri: Two-level heaps: a new priority queue structure with applications to the single source shortest path problem. Computing 90(3-4): 113-130 (2010)
- [j33]James B. Orlin, Kamesh Madduri, K. Subramani, Matthew Williamson: A faster algorithm for the single source shortest path problem with few distinct positive lengths. J. Discrete Algorithms 8(2): 189-198 (2010)
2000 – 2009
- 2009
- [j32]K. Subramani, Hong-Jian Lai, Xiaofeng Gu: Random walks for selected boolean implication and equivalence problems. Acta Inf. 46(2): 155-168 (2009)
- [j31]K. Subramani: On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls. JAMDS 2009 (2009)
- [j30]K. Subramani: Optimal Length Resolution Refutations of Difference Constraint Systems. J. Autom. Reasoning 43(2): 121-137 (2009)
- [j29]K. Subramani: On memoryless provers and insincere verifiers. J. Exp. Theor. Artif. Intell. 21(3): 217-231 (2009)
- [c27]K. Subramani, Kamesh Madduri: Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. COCOA 2009: 186-196
- [c26]Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai: Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. FAW 2009: 40-50
- [c25]
- 2008
- [j28]K. Subramani, Kiran Yellajyosula, A. Osman: Distributed algorithms for partially clairvoyant dispatchers. Cluster Computing 11(2): 115-131 (2008)
- [j27]K. Subramani: Computing inversion pair cardinality through partition-based sorting. Computing 83(1): 41-54 (2008)
- [j26]K. Subramani, Kiran Yellajyosula: On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers. International Journal of Parallel Programming 36(4): 386-411 (2008)
- [j25]K. Subramani, Kamesh Madduri: A Randomized Queueless Algorithm for Breadth-First Search. I. J. Comput. Appl. 15(3): 177-186 (2008)
- [j24]K. Subramani, C. Tauras, David Owen: Fault Tolerant Sorting - Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm. J. Math. Model. Algorithms 7(3): 255-276 (2008)
- [c24]
- 2007
- [j23]K. Subramani: On a decision procedure for quantified linear programs. Ann. Math. Artif. Intell. 51(1): 55-77 (2007)
- [j22]K. Subramani: A polynomial time algorithm for Zero-Clairvoyant scheduling. J. Applied Logic 5(4): 667-680 (2007)
- [j21]Hans Kleine Büning, K. Subramani, Xishun Zhao: Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reasoning 39(1): 49-75 (2007)
- [j20]K. Subramani: A Zero-Space algorithm for Negative Cost Cycle Detection in networks. J. Discrete Algorithms 5(3): 408-421 (2007)
- [j19]Sanjit A. Seshia, K. Subramani, Randal E. Bryant: On Solving Boolean Combinations of UTVPI Constraints. JSAT 3(1-2): 67-90 (2007)
- [j18]K. Subramani, Dejan Desovski: An empirical analysis of algorithms for partially Clairvoyant scheduling. IJPEDS 22(5): 331-353 (2007)
- [c23]K. Subramani, Kamesh Madduri: Accomplishing Approximate FCFS Fairness Without Queues. HiPC 2007: 540-551
- [c22]
- 2006
- [j17]K. Subramani, Dejan Desovski: On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. Applied Mathematics and Computation 173(1): 273-305 (2006)
- [j16]K. Subramani, C. Tauras: An approximation algorithm for state minimization in 2-MDFAs. Formal Asp. Comput. 18(4): 421-431 (2006)
- [j15]Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani: On using priced timed automata to achieve optimal scheduling. Formal Methods in System Design 29(1): 97-114 (2006)
- [j14]K. Subramani, John Argentieri: Chain Programming over Difference Constraints. Nord. J. Comput. 13(4): 309-327 (2006)
- [c21]K. Subramani, John Argentieri: Analyzing Chain Programs over Difference Constraints. TAMC 2006: 171-180
- [c20]
- 2005
- [j13]K. Subramani: A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling. Comput. J. 48(3): 259-272 (2005)
- [j12]K. Subramani, Lisa Kovalchick: A greedy strategy for detecting negative cost cycles in networks. Future Generation Comp. Syst. 21(4): 607-623 (2005)
- [j11]
- [j10]K. Subramani: Partially clairvoyant scheduling for aggregate constraints. JAMDS 9(4): 225-240 (2005)
- [j9]K. Subramani, Dejan Desovski: Out of order quantifier elimination for Standard Quantified Linear Programs. J. Symb. Comput. 40(6): 1383-1396 (2005)
- [j8]K. Subramani: Periodic Linear Programming with applications to real-time scheduling. Mathematical Structures in Computer Science 15(2): 383-406 (2005)
- [j7]K. Subramani: Tractable Fragments of Presburger Arithmetic. Theory Comput. Syst. 38(5): 647-668 (2005)
- [j6]
- [j5]K. Subramani: Erratum: An Analysis of Totally Clairvoyant Scheduling. J. Scheduling 8(6): 551-552 (2005)
- [c19]K. Subramani: Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks. ADHOC-NOW 2005: 320-333
- [c18]K. Subramani, Dejan Desovski: A New Verification Procedure for Partially Clairvoyant Scheduling. FORMATS 2005: 127-141
- [c17]K. Subramani, Dejan Desovski: On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks. International Conference on Computational Science (1) 2005: 180-187
- 2004
- [j4]K. Subramani: On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries. Math. Log. Q. 50(3): 281-292 (2004)
- [j3]K. Subramani: Optimal length tree-like resolution refutations for 2SAT formulas. ACM Trans. Comput. Log. 5(2): 316-320 (2004)
- [c16]
- [c15]
- [c14]K. Subramani, Kiran Yellajyosula: A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers. HiPC 2004: 111-122
- [c13]K. Subramani, Kiran Yellajyosula, A. Osman: Distributed Algorithms for Partially Clairvoyant Dispatchers. IPDPS 2004
- [c12]Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani: Resource-Optimal Scheduling Using Priced Timed Automata. TACAS 2004: 220-235
- 2003
- [j2]K. Subramani: An Analysis of Partially Clairvoyant Scheduling. J. Math. Model. Algorithms 2(2): 97-119 (2003)
- [c11]
- [c10]K. Subramani, Lisa Kovalchick: Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem. International Conference on Computational Science 2003: 377-387
- [c9]
- [c8]Hans Kleine Büning, K. Subramani, Xishun Zhao: On Boolean Models for Quantified Boolean Horn Formulas. SAT 2003: 93-104
- 2002
- [c7]K. Subramani: On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope. AISC 2002: 217-230
- [c6]K. Subramani: On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas. ASIAN 2002: 57-65
- [c5]
- [c4]
- 2001
- [j1]K. Subramani: A polyhedral projection procedure for Q2SAT. Electronic Notes in Discrete Mathematics 9: 369-375 (2001)
- [c3]
- [c2]
- 2000
- [c1]K. Subramani, Ashok K. Agrawala: A Dual Interpretation of "Standard Constraints" in Parametric Scheduling. FTRTFT 2000: 121-133
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-05 20:48 CEST by the dblp team