Get started
Author

K. Subramani

Observed names: K Subramani, K. SUBRAMANI, Subramani, K.
ORCID: 0000-0001-5821-5117
Observed ORCID: 0000-0001-5821-5117
OpenAlex ID: A5050337397
A faster algorithm for the single source shortest path problem with few distinct positive lengths
2009 · James B. Orlin, Kamesh Madduri, et al. · Journal of Discrete Algorithms · 81
PDF
Resource-Optimal Scheduling Using Priced Timed Automata
2004 · J. I. Rasmussen, Kim G. Larsen, et al. · Lecture notes in computer science · 55
PDF
Optimal Length Resolution Refutations of Difference Constraint Systems
2009 · K. Subramani · Journal of Automated Reasoning · 33
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints
2016 · K. Subramani, Piotr Wojciechowski · Algorithmica · 28
On using priced timed automata to achieve optimal scheduling
2006 · J. I. Rasmussen, K. G. Larsen, et al. · Formal Methods in System Design · 27
A combinatorial algorithm for Horn programs
2013 · R. Chandrasekaran, K. Subramani · Discrete Optimization · 25
PDF
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs
2014 · Bugra Caskurlu, Vahan Mkrtchyan, et al. · Lecture notes in computer science · 24
PDF
Finding read-once resolution refutations in systems of 2CNF clauses
2018 · Hans Kleine Büning, Piotr Wojciechowski, et al. · Theoretical Computer Science · 23
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints
2019 · K. Subramani, Piotr Wojciechowki · Algorithmica · 22
A Specification Framework for Real-Time Scheduling
2002 · K. Subramani · Lecture notes in computer science · 22
On Solving Boolean Combinations of UTVPI Constraints
2007 · Sanjit A. Seshia, K. Subramani, et al. · Journal on Satisfiability Boolean Modeling and Computation · 20
PDF
On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries
2004 · K. Subramani · Mathematical logic quarterly · 20
On a decision procedure for quantified linear programs
2007 · K. Subramani · Annals of Mathematics and Artificial Intelligence · 19
Boolean Functions as Models for Quantified Boolean Formulas
2007 · Hans Kleine Büning, K. Subramani, et al. · Journal of Automated Reasoning · 19
On Boolean Models for Quantified Boolean Horn Formulas
2004 · Hans Kleine Büning, K. Subramani, et al. · Lecture notes in computer science · 19
Analyzing Selected Quantified Integer Programs
2004 · K. Subramani · Lecture notes in computer science · 17
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs
2017 · Bugra Caskurlu, Vahan Mkrtchyan, et al. · SIAM Journal on Discrete Mathematics · 16
Duality in the parametric polytope and its applications to a scheduling problem
2000 · K. Subramani, Ashok K. Agrawala · 16
Improved algorithms for optimal length resolution refutation in difference constraint systems
2011 · K. Subramani, Matthew Williamson, et al. · Formal Aspects of Computing · 14
PDF
An Analysis of Totally Clairvoyant Scheduling
2005 · K. Subramani · Journal of Scheduling · 14
An Analysis of Zero-Clairvoyant Scheduling
2002 · K. Subramani · Lecture notes in computer science · 14
Analytical models for risk-based intrusion response
2013 · Bugra Caskurlu, Ashish Gehani, et al. · Computer Networks · 13
An Analysis of Quantified Linear Programs
2003 · K. Subramani · Lecture notes in computer science · 13
Restricted Cutting Plane Proofs in Horn Constraint Systems
2019 · Hans Kleine Büning, Piotr Wojciechowski, et al. · Lecture notes in computer science · 12
A greedy strategy for detecting negative cost cycles in networks
2004 · K. Subramani, L. Kovalchick · Future Generation Computer Systems · 12
Works count: 208
Citation count: 983
H-index: 16
I10-index: 32
Year
Topic
Type