Edit Profile (opens in new tab) Subramani, Krishnan Co-Author Distance Author ID: subramani.krishnan Published as: Subramani, K.; Subramani, Krishnan External Links: MGP Documents Indexed: 141 Publications since 1990 Reviewing Activity: 17 Reviews Co-Authors: 47 Co-Authors with 97 Joint Publications 1,290 Co-Co-Authors all top 5 Co-Authors 30 single-authored 47 Wojciechowski, Piotr J. 14 Williamson, Matthew 12 Mkrtchyan, Vahan V. 11 Velasquez, Alvaro 8 Eirinakis, Pavlos 8 Kleine Büning, Hans 7 Caskurlu, Bugra 6 Chandrasekaran, Ramaswamy 5 Desovski, D. 5 Madduri, Kamesh 4 Donovan, Zola 4 Govindaraju, Kameswararao V. 4 Gu, Xiaofeng 3 Parekh, Ojas D. 3 Ruggieri, Salvatore 3 Tauras, C. 2 Argentieri, John 2 Lai, Hong-Jian 2 Larsen, Kim Guldstrand 2 Orlin, James B. 2 Rasmussen, Jacob Illum 2 Shankar, Natarajan 2 Wojciechowki, Piotr 2 Worthington, James 2 Zhao, Xishun 1 Acikalin, Utku Umur 1 Agrawala, Ashok K. 1 Alkhouri, Ismail 1 Atia, George K. 1 Bak, Stanley 1 Balamurali, Saminathan 1 Bryant, Randal E. 1 Chetlur, Malolan 1 Dohmen, Taylor 1 Drager, Steven L. 1 Gutin, Gregory Z. 1 Hashemi, Vahid 1 Hermanns, Holger 1 Jena, Sangram K. 1 Kleine, Büning Hans 1 Liang, Zhiyao 1 Martin, Dale E. 1 Radhakrishnan, Radharamanan 1 Rao, Dhananjai Madhava 1 Segev, Danny 1 Seshia, Sanjit Arunkumar 1 Sheng, Ying 1 Song, Lei 1 Trivedi, Ashutosh 1 Turrini, Andrea 1 Yellajyosula, Kiran all top 5 Serials 7 Theoretical Computer Science 7 Annals of Mathematics and Artificial Intelligence 4 Discrete Applied Mathematics 4 Algorithmica 4 Journal of Automated Reasoning 4 Theory of Computing Systems 4 Journal of Discrete Algorithms 3 Journal of Combinatorial Optimization 3 Discrete Optimization 2 Applied Mathematics and Computation 2 Computing 2 Formal Aspects of Computing 2 Journal of Logic and Computation 2 MSCS. Mathematical Structures in Computer Science 2 Communications in Statistics. Simulation and Computation 2 Nordic Journal of Computing 2 Constraints 2 Journal of Scheduling 2 Journal of Applied Mathematics and Decision Sciences 2 JMMA. Journal of Mathematical Modelling and Algorithms 1 Acta Informatica 1 Information Processing Letters 1 IAPQR Transactions 1 Science of Computer Programming 1 American Journal of Mathematical and Management Sciences 1 Journal of Symbolic Computation 1 International Journal of Parallel Programming 1 SIAM Journal on Discrete Mathematics 1 Journal of Parallel and Distributed Computing 1 JETAI. Journal of Experimental & Theoretical Artificial Intelligence 1 International Journal of Foundations of Computer Science 1 Economic Quality Control 1 International Journal of Computer Mathematics 1 Computational Optimization and Applications 1 Formal Methods in System Design 1 Mathematical Logic Quarterly (MLQ) 1 Journal of Graph Algorithms and Applications 1 Journal of Applied Statistics 1 ACM Transactions on Computational Logic 1 Journal of Applied Logic 1 International Journal of Parallel, Emergent and Distributed Systems 1 Journal of Satisfiability, Boolean Modeling and Computation 1 Discrete Mathematics, Algorithms and Applications all top 5 Fields 105 Computer science (68-XX) 64 Operations research, mathematical programming (90-XX) 20 Mathematical logic and foundations (03-XX) 18 Combinatorics (05-XX) 6 Statistics (62-XX) 3 Information and communication theory, circuits (94-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Probability theory and stochastic processes (60-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 77 Publications have been cited 268 times in 122 Documents Cited by ▼ Year ▼ Optimal length resolution refutations of difference constraint systems. Zbl 1184.68468 Subramani, K. 15 2009 A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints. Zbl 1421.68181 Subramani, K.; Wojciechowki, Piotr 13 2019 A combinatorial algorithm for Horn programs. Zbl 1284.90038 Chandrasekaran, R.; Subramani, K. 12 2013 Selection of chain sampling plans ChSP-1 and ChSP-(0,1) for given acceptable quality level and limiting quality level. Zbl 0800.62627 Govindaraju, K.; Subramani, K. 12 1993 On deciding the non-emptiness of 2SAT polytopes with respect to first order queries. Zbl 1073.68081 Subramani, K. 12 2004 A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. Zbl 1360.68889 Subramani, K.; Wojciechowski, Piotr 11 2017 Finding read-once resolution refutations in systems of 2CNF clauses. Zbl 1435.03086 Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. 10 2018 On partial vertex cover and budgeted maximum coverage problems in bipartite graphs. Zbl 1417.68149 Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K. 9 2014 Restricted cutting plane proofs in Horn constraint systems. Zbl 1435.68303 Kleine Büning, Hans; Wojciechowski, Piotr; Chandrasekaran, R.; Subramani, K. 9 2019 On a decision procedure for quantified linear programs. Zbl 1132.68034 Subramani, K. 9 2007 An analysis of totally clairvoyant scheduling. Zbl 1154.90493 Subramani, K. 8 2005 Partial vertex cover and budgeted maximum coverage in bipartite graphs. Zbl 1376.68051 Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K. 7 2017 Improved algorithms for optimal length resolution refutation in difference constraint systems. Zbl 1259.68261 Subramani, K.; Williamson, Matthew; Gu, Xiaofeng 7 2013 A zero-space algorithm for negative cost cycle detection in networks. Zbl 1149.90314 Subramani, K. 7 2007 On solving Boolean combinations of UTVPI constraints. Zbl 1129.68079 Seshia, Sanjit A.; Subramani, K.; Bryant, Randal E. 7 2007 Resource-optimal scheduling using priced timed automata. Zbl 1126.68461 Rasmussen, J. I.; Larsen, Kim G.; Subramani, K. 7 2004 A faster algorithm for the single source shortest path problem with few distinct positive lengths. Zbl 1186.90119 Orlin, James B.; Madduri, Kamesh; Subramani, K.; Williamson, M. 6 2010 Read-once resolutions in Horn formulas. Zbl 1525.68196 Kleine Büning, Hans; Wojciechowski, P.; Subramani, K. 5 2019 An analysis of zero-clairvoyant scheduling. Zbl 1043.68512 Subramani, K. 5 2002 Boolean functions as models for quantified Boolean formulas. Zbl 1126.03015 Kleine Büning, Hans; Subramani, K.; Zhao, Xishun 5 2007 Randomized algorithms for finding the shortest negative cost cycle in networks. Zbl 1377.05181 Orlin, James B.; Subramani, K.; Wojciechowki, Piotr 4 2018 A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. Zbl 1394.90499 Subramani, K.; Wojciechowski, Piotr 4 2018 The approximability of partial vertex covers in trees. Zbl 1444.68149 Mkrtchyan, Vahan; Parekh, Ojas; Segev, Danny; Subramani, K. 4 2017 On the Shoshan-Zwick algorithm for the all-pairs shortest path problem. Zbl 1358.05274 Eirinakis, Pavlos; Williamson, Matthew; Subramani, K. 4 2017 Feasibility checking in Horn constraint systems through a reduction based approach. Zbl 1312.68231 Subramani, K.; Worthington, James 4 2015 On finding shortest paths in arc-dependent networks. Zbl 1458.90628 Wojciechowski, P.; Williamson, Matthew; Subramani, K. 4 2020 An analysis of partially Clairvoyant scheduling. Zbl 1033.90044 Subramani, K. 4 2003 Analyzing selected quantified integer programs. Zbl 1126.68589 Subramani, K. 4 2004 On Boolean models for quantified Boolean Horn formulas. Zbl 1204.03017 Kleine Büning, Hans; Subramani, K.; Zhao, Xishun 3 2004 A bit-scaling algorithm for integer feasibility in UTVPI constraints. Zbl 1478.68198 Subramani, K.; Wojciechowski, Piotr 3 2016 Optimal length tree-like resolution refutations for 2SAT formulas. Zbl 1367.68114 Subramani, K. 3 2004 On quantified linear implications. Zbl 1319.68102 Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr 3 2014 On using priced timed automata to achieve optimal scheduling. Zbl 1105.68011 Rasmussen, J. I.; Larsen, K. G.; Subramani, K. 3 2006 Cascading random walks. Zbl 1097.68147 Subramani, K. 3 2005 Improved algorithms for detecting negative cost cycles in undirected graphs. Zbl 1248.05198 Gu, Xiaofeng; Madduri, Kamesh; Subramani, K.; Lai, Hong-Jian 3 2009 A combinatorial algorithm for Horn programs. Zbl 1273.90115 Chandrasekaran, R.; Subramani, K. 3 2009 New results on cutting plane proofs for Horn constraint systems. Zbl 07650340 Kleine, Büning Hans; Wojciechowski, Piotr; Subramani, K. 3 2019 On the negative cost girth problem in planar networks. Zbl 1343.05144 Williamson, Matthew; Subramani, K. 2 2015 On clustering without replication in combinatorial circuits. Zbl 1478.94153 Donovan, Zola; Mkrtchyan, Vahan; Subramani, K. 2 2015 Clustering without replication in combinatorial circuits. Zbl 1426.90214 Donovan, Zola; Gutin, Gregory; Mkrtchyan, Vahan; Subramani, K. 2 2019 Tractable fragments of Presburger arithmetic. Zbl 1090.68101 Subramani, K. 2 2005 Empirical analysis of algorithms for the shortest negative cost cycle problem. Zbl 1401.05276 Anderson, Matthew; Williamson, Matthew; Subramani, K. 2 2019 Parametric scheduling – algorithms and complexity. Zbl 1052.68575 Subramani, K. 2 2001 Selection of single sampling attributes plan for given acceptable quality level and limiting quality level involving minimum risks. Zbl 0850.62735 Govindaraju, K.; Subramani, K. 2 1990 Selection of double sampling attributes plan for given acceptable quality level and limiting quality level. Zbl 0850.62743 Govindaraju, K.; Subramani, K. 2 1992 On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls. Zbl 1182.68091 Subramani, K. 2 2009 The complexity of finding read-once NAE-resolution refutations. Zbl 1483.68145 Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. 2 2017 A complexity perspective on entailment of parameterized linear constraints. Zbl 1309.90107 Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr 2 2012 Parameterized algorithms for partial vertex covers in bipartite graphs. Zbl 07601023 Mkrtchyan, Vahan; Petrosyan, Garik; Subramani, K.; Wojciechowski, Piotr 2 2020 A graphical theorem of the alternative for UTVPI constraints. Zbl 1471.68262 Subramani, K.; Wojciechowski, Piotr 2 2015 Compositional bisimulation minimization for interval Markov decision processes. Zbl 1435.68197 Hashemi, Vahid; Hermanns, Holger; Song, Lei; Subramani, K.; Turrini, Andrea; Wojciechowski, Piotr 2 2016 Modified CSP-C continuous sampling plan for consumer protection. Zbl 1121.62324 Balamurali, S.; Subramani, K. 2 2004 Absorbing random walks and the NAE2SAT problem. Zbl 1143.68635 Subramani, K. 2 2008 On clausal equivalence and hull inclusion. Zbl 1257.68082 Subramani, K. 2 2003 An analysis of quantified linear programs. Zbl 1038.90052 Subramani, K. 2 2003 Optimal length tree-like refutations of linear feasibility in UTVPI constraints. Zbl 1446.68143 Wojciechowski, P.; Subramani, K.; Williamson, Matthew 2 2018 On unit read-once resolutions and copy complexity. Zbl 07666355 Wojciechowski, P.; Subramani, K. 2 2020 Parametric scheduling for network constraints. Zbl 0996.68503 Subramani, K. 1 2001 Finding minimum stopping and trapping sets: an integer linear programming approach. Zbl 1404.90121 Velasquez, Alvaro; Subramani, K.; Drager, Steven L. 1 2018 On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. Zbl 1092.90055 Subramani, K.; Desovski, D. 1 2006 On identifying simple and quantified lattice points in the 2SAT polytope. Zbl 1072.68608 Subramani, K. 1 2002 On the complexity of quantified linear systems. Zbl 1358.03051 Ruggieri, Salvatore; Eirinakis, Pavlos; Subramani, K.; Wojciechowski, Piotr 1 2014 On the computational complexity of read once resolution decidability in 2CNF formulas. Zbl 1485.68110 Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. 1 2017 Analyzing unit read-once refutations in difference constraint systems. Zbl 07437039 Subramani, K.; Wojciechowski, Piotr 1 2021 Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm. Zbl 1189.90182 Subramani, K.; Tauras, C.; Madduri, K. 1 2010 Tree-like unit refutations in Horn constraint systems. Zbl 07405990 Subramani, K.; Wojciechowski, Piotr 1 2021 On integer closure in a system of unit two variable per inequality constraints. Zbl 1466.90053 Subramani, K.; Wojciechowski, P. 1 2020 On the approximability of path and cycle problems in arc-dependent networks. Zbl 07683180 Wojciechowski, Piotr; Subramani, K.; Velasquez, Alvaro; Williamson, Matthew 1 2022 Algorithmic analysis of priority-based bin packing. Zbl 07497545 Wojciechowski, Piotr; Subramani, K.; Velasquez, Alvaro; Caskurlu, Bugra 1 2021 An optimal algorithm for computing the integer closure of UTVPI constraints. Zbl 1475.68421 Subramani, K.; Wojciechowski, Piotr 1 2016 A new algorithm for linear and integer feasibility in Horn constraints. Zbl 1302.90126 Subramani, K.; Worthington, James 1 2011 Fast algorithms for the undirected negative cost cycle detection problem. Zbl 1336.05140 Williamson, Matthew; Eirinakis, Pavlos; Subramani, K. 1 2016 Disjoint clustering in combinatorial circuits. Zbl 1503.68216 Donovan, Zola; Subramani, K.; Mkrtchyan, Vahan 1 2019 Out of order quantifier elimination for standard quantified linear programs. Zbl 1125.68142 Subramani, K.; Desovski, D. 1 2005 Absorbing random walks and the NAE2SAT problem. Zbl 1213.68337 Subramani, K.; Gu, Xiaofeng 1 2011 Analyzing read-once cutting plane proofs in Horn systems. Zbl 07538896 Wojciechowski, Piotr; Subramani, K.; Chandrasekaran, R. 1 2022 Analyzing the 3-path vertex cover problem in planar bipartite graphs. Zbl 07722835 Jena, Sangram K.; Subramani, K. 1 2023 Analyzing the 3-path vertex cover problem in planar bipartite graphs. Zbl 07722835 Jena, Sangram K.; Subramani, K. 1 2023 On the approximability of path and cycle problems in arc-dependent networks. Zbl 07683180 Wojciechowski, Piotr; Subramani, K.; Velasquez, Alvaro; Williamson, Matthew 1 2022 Analyzing read-once cutting plane proofs in Horn systems. Zbl 07538896 Wojciechowski, Piotr; Subramani, K.; Chandrasekaran, R. 1 2022 Analyzing unit read-once refutations in difference constraint systems. Zbl 07437039 Subramani, K.; Wojciechowski, Piotr 1 2021 Tree-like unit refutations in Horn constraint systems. Zbl 07405990 Subramani, K.; Wojciechowski, Piotr 1 2021 Algorithmic analysis of priority-based bin packing. Zbl 07497545 Wojciechowski, Piotr; Subramani, K.; Velasquez, Alvaro; Caskurlu, Bugra 1 2021 On finding shortest paths in arc-dependent networks. Zbl 1458.90628 Wojciechowski, P.; Williamson, Matthew; Subramani, K. 4 2020 Parameterized algorithms for partial vertex covers in bipartite graphs. Zbl 07601023 Mkrtchyan, Vahan; Petrosyan, Garik; Subramani, K.; Wojciechowski, Piotr 2 2020 On unit read-once resolutions and copy complexity. Zbl 07666355 Wojciechowski, P.; Subramani, K. 2 2020 On integer closure in a system of unit two variable per inequality constraints. Zbl 1466.90053 Subramani, K.; Wojciechowski, P. 1 2020 A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints. Zbl 1421.68181 Subramani, K.; Wojciechowki, Piotr 13 2019 Restricted cutting plane proofs in Horn constraint systems. Zbl 1435.68303 Kleine Büning, Hans; Wojciechowski, Piotr; Chandrasekaran, R.; Subramani, K. 9 2019 Read-once resolutions in Horn formulas. Zbl 1525.68196 Kleine Büning, Hans; Wojciechowski, P.; Subramani, K. 5 2019 New results on cutting plane proofs for Horn constraint systems. Zbl 07650340 Kleine, Büning Hans; Wojciechowski, Piotr; Subramani, K. 3 2019 Clustering without replication in combinatorial circuits. Zbl 1426.90214 Donovan, Zola; Gutin, Gregory; Mkrtchyan, Vahan; Subramani, K. 2 2019 Empirical analysis of algorithms for the shortest negative cost cycle problem. Zbl 1401.05276 Anderson, Matthew; Williamson, Matthew; Subramani, K. 2 2019 Disjoint clustering in combinatorial circuits. Zbl 1503.68216 Donovan, Zola; Subramani, K.; Mkrtchyan, Vahan 1 2019 Finding read-once resolution refutations in systems of 2CNF clauses. Zbl 1435.03086 Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. 10 2018 Randomized algorithms for finding the shortest negative cost cycle in networks. Zbl 1377.05181 Orlin, James B.; Subramani, K.; Wojciechowki, Piotr 4 2018 A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. Zbl 1394.90499 Subramani, K.; Wojciechowski, Piotr 4 2018 Optimal length tree-like refutations of linear feasibility in UTVPI constraints. Zbl 1446.68143 Wojciechowski, P.; Subramani, K.; Williamson, Matthew 2 2018 Finding minimum stopping and trapping sets: an integer linear programming approach. Zbl 1404.90121 Velasquez, Alvaro; Subramani, K.; Drager, Steven L. 1 2018 A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. Zbl 1360.68889 Subramani, K.; Wojciechowski, Piotr 11 2017 Partial vertex cover and budgeted maximum coverage in bipartite graphs. Zbl 1376.68051 Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K. 7 2017 The approximability of partial vertex covers in trees. Zbl 1444.68149 Mkrtchyan, Vahan; Parekh, Ojas; Segev, Danny; Subramani, K. 4 2017 On the Shoshan-Zwick algorithm for the all-pairs shortest path problem. Zbl 1358.05274 Eirinakis, Pavlos; Williamson, Matthew; Subramani, K. 4 2017 The complexity of finding read-once NAE-resolution refutations. Zbl 1483.68145 Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. 2 2017 On the computational complexity of read once resolution decidability in 2CNF formulas. Zbl 1485.68110 Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. 1 2017 A bit-scaling algorithm for integer feasibility in UTVPI constraints. Zbl 1478.68198 Subramani, K.; Wojciechowski, Piotr 3 2016 Compositional bisimulation minimization for interval Markov decision processes. Zbl 1435.68197 Hashemi, Vahid; Hermanns, Holger; Song, Lei; Subramani, K.; Turrini, Andrea; Wojciechowski, Piotr 2 2016 An optimal algorithm for computing the integer closure of UTVPI constraints. Zbl 1475.68421 Subramani, K.; Wojciechowski, Piotr 1 2016 Fast algorithms for the undirected negative cost cycle detection problem. Zbl 1336.05140 Williamson, Matthew; Eirinakis, Pavlos; Subramani, K. 1 2016 Feasibility checking in Horn constraint systems through a reduction based approach. Zbl 1312.68231 Subramani, K.; Worthington, James 4 2015 On the negative cost girth problem in planar networks. Zbl 1343.05144 Williamson, Matthew; Subramani, K. 2 2015 On clustering without replication in combinatorial circuits. Zbl 1478.94153 Donovan, Zola; Mkrtchyan, Vahan; Subramani, K. 2 2015 A graphical theorem of the alternative for UTVPI constraints. Zbl 1471.68262 Subramani, K.; Wojciechowski, Piotr 2 2015 On partial vertex cover and budgeted maximum coverage problems in bipartite graphs. Zbl 1417.68149 Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K. 9 2014 On quantified linear implications. Zbl 1319.68102 Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr 3 2014 On the complexity of quantified linear systems. Zbl 1358.03051 Ruggieri, Salvatore; Eirinakis, Pavlos; Subramani, K.; Wojciechowski, Piotr 1 2014 A combinatorial algorithm for Horn programs. Zbl 1284.90038 Chandrasekaran, R.; Subramani, K. 12 2013 Improved algorithms for optimal length resolution refutation in difference constraint systems. Zbl 1259.68261 Subramani, K.; Williamson, Matthew; Gu, Xiaofeng 7 2013 A complexity perspective on entailment of parameterized linear constraints. Zbl 1309.90107 Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr 2 2012 A new algorithm for linear and integer feasibility in Horn constraints. Zbl 1302.90126 Subramani, K.; Worthington, James 1 2011 Absorbing random walks and the NAE2SAT problem. Zbl 1213.68337 Subramani, K.; Gu, Xiaofeng 1 2011 A faster algorithm for the single source shortest path problem with few distinct positive lengths. Zbl 1186.90119 Orlin, James B.; Madduri, Kamesh; Subramani, K.; Williamson, M. 6 2010 Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm. Zbl 1189.90182 Subramani, K.; Tauras, C.; Madduri, K. 1 2010 Optimal length resolution refutations of difference constraint systems. Zbl 1184.68468 Subramani, K. 15 2009 Improved algorithms for detecting negative cost cycles in undirected graphs. Zbl 1248.05198 Gu, Xiaofeng; Madduri, Kamesh; Subramani, K.; Lai, Hong-Jian 3 2009 A combinatorial algorithm for Horn programs. Zbl 1273.90115 Chandrasekaran, R.; Subramani, K. 3 2009 On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls. Zbl 1182.68091 Subramani, K. 2 2009 Absorbing random walks and the NAE2SAT problem. Zbl 1143.68635 Subramani, K. 2 2008 On a decision procedure for quantified linear programs. Zbl 1132.68034 Subramani, K. 9 2007 A zero-space algorithm for negative cost cycle detection in networks. Zbl 1149.90314 Subramani, K. 7 2007 On solving Boolean combinations of UTVPI constraints. Zbl 1129.68079 Seshia, Sanjit A.; Subramani, K.; Bryant, Randal E. 7 2007 Boolean functions as models for quantified Boolean formulas. Zbl 1126.03015 Kleine Büning, Hans; Subramani, K.; Zhao, Xishun 5 2007 On using priced timed automata to achieve optimal scheduling. Zbl 1105.68011 Rasmussen, J. I.; Larsen, K. G.; Subramani, K. 3 2006 On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. Zbl 1092.90055 Subramani, K.; Desovski, D. 1 2006 An analysis of totally clairvoyant scheduling. Zbl 1154.90493 Subramani, K. 8 2005 Cascading random walks. Zbl 1097.68147 Subramani, K. 3 2005 Tractable fragments of Presburger arithmetic. Zbl 1090.68101 Subramani, K. 2 2005 Out of order quantifier elimination for standard quantified linear programs. Zbl 1125.68142 Subramani, K.; Desovski, D. 1 2005 On deciding the non-emptiness of 2SAT polytopes with respect to first order queries. Zbl 1073.68081 Subramani, K. 12 2004 Resource-optimal scheduling using priced timed automata. Zbl 1126.68461 Rasmussen, J. I.; Larsen, Kim G.; Subramani, K. 7 2004 Analyzing selected quantified integer programs. Zbl 1126.68589 Subramani, K. 4 2004 On Boolean models for quantified Boolean Horn formulas. Zbl 1204.03017 Kleine Büning, Hans; Subramani, K.; Zhao, Xishun 3 2004 Optimal length tree-like resolution refutations for 2SAT formulas. Zbl 1367.68114 Subramani, K. 3 2004 Modified CSP-C continuous sampling plan for consumer protection. Zbl 1121.62324 Balamurali, S.; Subramani, K. 2 2004 An analysis of partially Clairvoyant scheduling. Zbl 1033.90044 Subramani, K. 4 2003 On clausal equivalence and hull inclusion. Zbl 1257.68082 Subramani, K. 2 2003 An analysis of quantified linear programs. Zbl 1038.90052 Subramani, K. 2 2003 An analysis of zero-clairvoyant scheduling. Zbl 1043.68512 Subramani, K. 5 2002 On identifying simple and quantified lattice points in the 2SAT polytope. Zbl 1072.68608 Subramani, K. 1 2002 Parametric scheduling – algorithms and complexity. Zbl 1052.68575 Subramani, K. 2 2001 Parametric scheduling for network constraints. Zbl 0996.68503 Subramani, K. 1 2001 Selection of chain sampling plans ChSP-1 and ChSP-(0,1) for given acceptable quality level and limiting quality level. Zbl 0800.62627 Govindaraju, K.; Subramani, K. 12 1993 Selection of double sampling attributes plan for given acceptable quality level and limiting quality level. Zbl 0850.62743 Govindaraju, K.; Subramani, K. 2 1992 Selection of single sampling attributes plan for given acceptable quality level and limiting quality level involving minimum risks. Zbl 0850.62735 Govindaraju, K.; Subramani, K. 2 1990 all cited Publications top 5 cited Publications all top 5 Cited by 152 Authors 62 Subramani, Krishnan 30 Wojciechowski, Piotr J. 9 Williamson, Matthew 8 Mkrtchyan, Vahan V. 7 Eirinakis, Pavlos 5 Kleine Büning, Hans 5 Velasquez, Alvaro 4 Chandrasekaran, Ramaswamy 3 Caskurlu, Bugra 3 Desovski, D. 3 Gu, Xiaofeng 3 Kimura, Kei 3 Lorenz, Ulf 3 Ruggieri, Salvatore 2 Bonnet, Edouard 2 Donovan, Zola 2 Droste, Manfred 2 Fahrenberg, Uli 2 Goerigk, Marc 2 Hartisch, Michael 2 Legay, Axel 2 Maculan, Nelson F. 2 Parekh, Ojas D. 2 Paschos, Vangelis Th. 2 Quaas, Karin 2 Sudholt, Dirk 2 Thyssen, Christian 2 Wojciechowki, Piotr 2 Wolf, Jan 2 Zhao, Xishun 1 Abate, Alessandro 1 Abraham, Ittai 1 Acikalin, Utku Umur 1 Aljazzar, Husain 1 Asahiro, Yuichi 1 Badings, Thom S. 1 Baier, Christel 1 Bandyapadhyay, Sayan 1 Banik, Aritra 1 Bazgan, Cristina 1 Béchennec, Jean-Luc 1 Bentz, Cédric 1 Bernabeu, Antoine 1 Berndt, Sebastian 1 Bhargava, Nikhil 1 Bhore, Sujoy Kumar 1 Biere, Armin 1 Bošnački, Dragan 1 Briday, Mikaël 1 Bruns, Florian 1 Bubeck, Uwe 1 Cabello, Sergio 1 Castro de Andrade, Rafael 1 Chawdhary, Aziem 1 Chiplunkar, Ashish 1 da Mota, Benoit 1 da Silva, Murilo V. G. 1 de Lima, Alane M. 1 Di Puglia Pugliese, Luigi 1 Duan, Ran 1 Edelkamp, Stefan 1 Ederer, Thorsten 1 Escoffier, Bruno 1 Faucou, Sébastien 1 Fehnker, Ansgar 1 Foucaud, Florent 1 Furukawa, Tetsuya 1 Garavel, Hubert 1 Giannopoulou, Archontia C. 1 Gu, Yong 1 Guerriero, Francesca 1 Gutin, Gregory Z. 1 Hamm, Thekla 1 Haouari, Mohamed 1 Herbst, Alexander D. 1 Heule, Marijn J. H. 1 Ibrahim, Mamane Souley 1 Ignatyev, Alexey A. 1 Ikegami, Keiichi 1 Jain, Chinmay 1 Janota, Mikoláš 1 Jansen, Klaus 1 Jansen, Nils 1 Jantsch, Simon 1 Jiang, Haitao 1 Jonsson, Peter 1 Kalra, Tushar 1 King, Andy 1 Klein, Joachim 1 Knust, Sigrid 1 Krishna, Shankara Narayanan 1 Lackner, Martin 1 Lagerkvist, Victor 1 Lai, Hong-Jian 1 Lang, Frédéric 1 Larsen, Kim Guldstrand 1 Lassota, Alexandra 1 Le Bodic, Pierre 1 Lime, Didier 1 Madduri, Kamesh ...and 52 more Authors all top 5 Cited in 40 Serials 13 Theoretical Computer Science 7 Annals of Mathematics and Artificial Intelligence 6 Discrete Applied Mathematics 6 Algorithmica 5 Journal of Automated Reasoning 4 Theory of Computing Systems 4 Discrete Optimization 3 Constraints 3 Journal of Combinatorial Optimization 3 Journal of Graph Algorithms and Applications 3 Journal of Discrete Algorithms 2 Acta Informatica 2 Artificial Intelligence 2 Applied Mathematics and Computation 2 Computers & Operations Research 2 Annals of Operations Research 2 Computational Optimization and Applications 2 Formal Methods in System Design 1 SIAM Journal on Computing 1 Science of Computer Programming 1 Journal of Symbolic Computation 1 International Journal of Parallel Programming 1 SIAM Journal on Discrete Mathematics 1 Formal Aspects of Computing 1 JETAI. Journal of Experimental & Theoretical Artificial Intelligence 1 MSCS. Mathematical Structures in Computer Science 1 International Journal of Foundations of Computer Science 1 Discrete Event Dynamic Systems 1 International Journal of Computer Mathematics 1 The Journal of Artificial Intelligence Research (JAIR) 1 INFORMS Journal on Computing 1 Journal of Scheduling 1 Journal of Applied Mathematics and Decision Sciences 1 Optimization and Engineering 1 RAIRO. Operations Research 1 OR Spectrum 1 JMMA. Journal of Mathematical Modelling and Algorithms 1 International Journal of Parallel, Emergent and Distributed Systems 1 Optimization Letters 1 EURO Journal on Computational Optimization all top 5 Cited in 9 Fields 85 Computer science (68-XX) 55 Operations research, mathematical programming (90-XX) 27 Combinatorics (05-XX) 18 Mathematical logic and foundations (03-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 2 Systems theory; control (93-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Statistics (62-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year