| A faster algorithm for the single source shortest path problem with few distinct positive lengths JB Orlin, K Madduri, K Subramani, M Williamson Journal of Discrete Algorithms 8 (2), 189-198, 2010 | 102 | 2010 |
| Resource-optimal scheduling using priced timed automata JI Rasmussen, KG Larsen, K Subramani Tools and Algorithms for the Construction and Analysis of Systems: 10th …, 2004 | 78 | 2004 |
| Optimal length resolution refutations of difference constraint systems K Subramani Journal of Automated Reasoning 43 (2), 121-137, 2009 | 34 | 2009 |
| On partial vertex cover and budgeted maximum coverage problems in bipartite graphs B Caskurlu, V Mkrtchyan, O Parekh, K Subramani IFIP International Conference on Theoretical Computer Science, 13-26, 2014 | 32 | 2014 |
| On using priced timed automata to achieve optimal scheduling JI Rasmussen, KG Larsen, K Subramani Formal Methods in System Design 29, 97-114, 2006 | 32 | 2006 |
| Boolean functions as models for quantified boolean formulas H Kleine Büning, K Subramani, X Zhao Journal of Automated Reasoning 39 (1), 49-75, 2007 | 28 | 2007 |
| A combinatorial certifying algorithm for linear feasibility in UTVPI constraints K Subramani, P Wojciechowski Algorithmica 78, 166-208, 2017 | 26 | 2017 |
| A specification framework for real-time scheduling K Subramani International Conference on Current Trends in Theory and Practice of …, 2002 | 26 | 2002 |
| Analyzing selected quantified integer programs K Subramani International Joint Conference on Automated Reasoning, 342-356, 2004 | 25 | 2004 |
| On solving boolean combinations of UTVPI constraints SA Seshia, K Subramani, RE Bryant Journal on Satisfiability, Boolean Modeling and Computation 3 (1-2), 67-90, 2007 | 24 | 2007 |
| On boolean models for quantified boolean Horn formulas H Kleine Büning, K Subramani, X Zhao International Conference on Theory and Applications of Satisfiability …, 2003 | 24 | 2003 |
| A combinatorial algorithm for Horn programs R Chandrasekaran, K Subramani Discrete Optimization 10 (2), 85-101, 2013 | 23 | 2013 |
| On a decision procedure for quantified linear programs K Subramani Annals of Mathematics and Artificial Intelligence 51 (1), 55-77, 2007 | 23 | 2007 |
| A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints K Subramani, P Wojciechowki Algorithmica 81, 2765-2794, 2019 | 22 | 2019 |
| Finding read-once resolution refutations in systems of 2CNF clauses HK Büning, P Wojciechowski, K Subramani Theoretical Computer Science 729, 42-56, 2018 | 21 | 2018 |
| Duality in the Parametric Polytope and its Applications to a Scheduling Problem K Subramani University of Maryland, College Park, 2000 | 20 | 2000 |
| On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries K Subramani Mathematical Logic Quarterly: Mathematical Logic Quarterly 50 (3), 281-292, 2004 | 19 | 2004 |
| An analysis of totally clairvoyant scheduling K Subramani Journal of Scheduling 8 (2), 113-133, 2005 | 17 | 2005 |
| An analysis of quantified linear programs K Subramani International Conference on Discrete Mathematics and Theoretical Computer …, 2003 | 17 | 2003 |
| An analysis of partially clairvoyant scheduling K Subramani Journal of Mathematical Modelling and Algorithms 2, 97-119, 2003 | 17 | 2003 |
