×

zbMATH — the first resource for mathematics

Subramani, Krishnan

Compute Distance To:
Author ID: subramani.krishnan Recent zbMATH articles by "Subramani, Krishnan"
Published as: Subramani, K.; Subramani, Krishnan
External Links: MGP · Wikidata
Documents Indexed: 107 Publications since 1990
Reviewing Activity: 9 Reviews

Publications by Year

Citations contained in zbMATH

56 Publications have been cited 147 times in 85 Documents Cited by Year
On a decision procedure for quantified linear programs. Zbl 1132.68034
Subramani, K.
8
2007
An analysis of totally clairvoyant scheduling. Zbl 1154.90493
Subramani, K.
8
2005
A zero-space algorithm for negative cost cycle detection in networks. Zbl 1149.90314
Subramani, K.
7
2007
On deciding the non-emptiness of 2SAT polytopes with respect to first order queries. Zbl 1073.68081
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
Optimal length resolution refutations of difference constraint systems. Zbl 1184.68468
Subramani, K.
6
2009
On partial vertex cover and budgeted maximum coverage problems in bipartite graphs. Zbl 1417.68149
Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K.
5
2014
Improved algorithms for optimal length resolution refutation in difference constraint systems. Zbl 1259.68261
Subramani, K.; Williamson, Matthew; Gu, Xiaofeng
5
2013
On solving Boolean combinations of UTVPI constraints. Zbl 1129.68079
Seshia, Sanjit A.; Subramani, K.; Bryant, Randal E.
5
2007
Resource-optimal scheduling using priced timed automata. Zbl 1126.68461
Rasmussen, J. I.; Larsen, Kim G.; Subramani, K.
5
2004
An analysis of zero-clairvoyant scheduling. Zbl 1043.68512
Subramani, K.
5
2002
A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. Zbl 1360.68889
Subramani, K.; Wojciechowski, Piotr
4
2017
A combinatorial algorithm for Horn programs. Zbl 1284.90038
Chandrasekaran, R.; Subramani, K.
4
2013
Boolean functions as models for quantified Boolean formulas. Zbl 1126.03015
Kleine Büning, Hans; Subramani, K.; Zhao, Xishun
4
2007
An analysis of partially Clairvoyant scheduling. Zbl 1033.90044
Subramani, K.
4
2003
On quantified linear implications. Zbl 1319.68102
Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr
3
2014
A combinatorial algorithm for Horn programs. Zbl 1273.90115
Chandrasekaran, R.; Subramani, K.
3
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
Cascading random walks. Zbl 1097.68147
Subramani, K.
3
2005
On Boolean models for quantified Boolean Horn formulas. Zbl 1204.03017
Kleine Büning, Hans; Subramani, K.; Zhao, Xishun
3
2004
Finding read-once resolution refutations in systems of 2CNF clauses. Zbl 1435.03086
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K.
2
2018
Randomized algorithms for finding the shortest negative cost cycle in networks. Zbl 1377.05181
Orlin, James B.; Subramani, K.; Wojciechowki, Piotr
2
2018
Partial vertex cover and budgeted maximum coverage in bipartite graphs. Zbl 1376.68051
Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K.
2
2017
A graphical theorem of the alternative for UTVPI constraints. Zbl 06545735
Subramani, K.; Wojciechowski, Piotr
2
2015
On clustering without replication in combinatorial circuits. Zbl 06539324
Donovan, Zola; Mkrtchyan, Vahan; Subramani, K.
2
2015
On the negative cost girth problem in planar networks. Zbl 1343.05144
Williamson, Matthew; Subramani, K.
2
2015
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls. Zbl 1182.68091
Subramani, K.
2
2009
Tractable fragments of Presburger arithmetic. Zbl 1090.68101
Subramani, K.
2
2005
Analyzing selected quantified integer programs. Zbl 1126.68589
Subramani, K.
2
2004
On clausal equivalence and hull inclusion. Zbl 1257.68082
Subramani, K.
2
2003
Parametric scheduling – algorithms and complexity. Zbl 1052.68575
Subramani, K.
2
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.
2
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
Disjoint clustering in combinatorial circuits. Zbl 07173532
Donovan, Zola; Subramani, K.; Mkrtchyan, Vahan
1
2019
Clustering without replication in combinatorial circuits. Zbl 1426.90214
Donovan, Zola; Gutin, Gregory; Mkrtchyan, Vahan; Subramani, K.
1
2019
Empirical analysis of algorithms for the shortest negative cost cycle problem. Zbl 1401.05276
Anderson, Matthew; Williamson, Matthew; Subramani, K.
1
2019
The complexity of finding read-once NAE-resolution refutations. Zbl 07084730
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K.
1
2017
On the computational complexity of Read once resolution decidability in 2CNF formulas. Zbl 06721530
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K.
1
2017
On the Shoshan-Zwick algorithm for the all-pairs shortest path problem. Zbl 1358.05274
Eirinakis, Pavlos; Williamson, Matthew; Subramani, K.
1
2017
The approximability of partial vertex covers in trees. Zbl 1444.68149
Mkrtchyan, Vahan; Parekh, Ojas; Segev, Danny; Subramani, K.
1
2017
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
1
2015
A complexity perspective on entailment of parameterized linear constraints. Zbl 1309.90107
Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr
1
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
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
Absorbing random walks and the NAE2SAT problem. Zbl 1143.68635
Subramani, K.
1
2008
On using priced timed automata to achieve optimal scheduling. Zbl 1105.68011
Rasmussen, J. I.; Larsen, K. G.; Subramani, K.
1
2006
On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. Zbl 1092.90055
Subramani, K.; Desovski, D.
1
2006
Out of order quantifier elimination for standard quantified linear programs. Zbl 1125.68142
Subramani, K.; Desovski, D.
1
2005
Optimal length tree-like resolution refutations for 2SAT formulas. Zbl 1367.68114
Subramani, K.
1
2004
Modified CSP-C continuous sampling plan for consumer protection. Zbl 1121.62324
Balamurali, S.; Subramani, K.
1
2004
An analysis of quantified linear programs. Zbl 1038.90052
Subramani, K.
1
2003
On identifying simple and quantified lattice points in the 2SAT polytope. Zbl 1072.68608
Subramani, K.
1
2002
Parametric scheduling for network constraints. Zbl 0996.68503
Subramani, K.
1
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.
1
1990
Disjoint clustering in combinatorial circuits. Zbl 07173532
Donovan, Zola; Subramani, K.; Mkrtchyan, Vahan
1
2019
Clustering without replication in combinatorial circuits. Zbl 1426.90214
Donovan, Zola; Gutin, Gregory; Mkrtchyan, Vahan; Subramani, K.
1
2019
Empirical analysis of algorithms for the shortest negative cost cycle problem. Zbl 1401.05276
Anderson, Matthew; Williamson, Matthew; Subramani, K.
1
2019
Finding read-once resolution refutations in systems of 2CNF clauses. Zbl 1435.03086
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K.
2
2018
Randomized algorithms for finding the shortest negative cost cycle in networks. Zbl 1377.05181
Orlin, James B.; Subramani, K.; Wojciechowki, Piotr
2
2018
A combinatorial certifying algorithm for linear feasibility in UTVPI constraints. Zbl 1360.68889
Subramani, K.; Wojciechowski, Piotr
4
2017
Partial vertex cover and budgeted maximum coverage in bipartite graphs. Zbl 1376.68051
Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K.
2
2017
The complexity of finding read-once NAE-resolution refutations. Zbl 07084730
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K.
1
2017
On the computational complexity of Read once resolution decidability in 2CNF formulas. Zbl 06721530
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K.
1
2017
On the Shoshan-Zwick algorithm for the all-pairs shortest path problem. Zbl 1358.05274
Eirinakis, Pavlos; Williamson, Matthew; Subramani, K.
1
2017
The approximability of partial vertex covers in trees. Zbl 1444.68149
Mkrtchyan, Vahan; Parekh, Ojas; Segev, Danny; Subramani, K.
1
2017
Fast algorithms for the undirected negative cost cycle detection problem. Zbl 1336.05140
Williamson, Matthew; Eirinakis, Pavlos; Subramani, K.
1
2016
A graphical theorem of the alternative for UTVPI constraints. Zbl 06545735
Subramani, K.; Wojciechowski, Piotr
2
2015
On clustering without replication in combinatorial circuits. Zbl 06539324
Donovan, Zola; Mkrtchyan, Vahan; Subramani, K.
2
2015
On the negative cost girth problem in planar networks. Zbl 1343.05144
Williamson, Matthew; Subramani, K.
2
2015
Feasibility checking in Horn constraint systems through a reduction based approach. Zbl 1312.68231
Subramani, K.; Worthington, James
1
2015
On partial vertex cover and budgeted maximum coverage problems in bipartite graphs. Zbl 1417.68149
Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas; Subramani, K.
5
2014
On quantified linear implications. Zbl 1319.68102
Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr
3
2014
Improved algorithms for optimal length resolution refutation in difference constraint systems. Zbl 1259.68261
Subramani, K.; Williamson, Matthew; Gu, Xiaofeng
5
2013
A combinatorial algorithm for Horn programs. Zbl 1284.90038
Chandrasekaran, R.; Subramani, K.
4
2013
A complexity perspective on entailment of parameterized linear constraints. Zbl 1309.90107
Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr
1
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.
6
2009
A combinatorial algorithm for Horn programs. Zbl 1273.90115
Chandrasekaran, R.; Subramani, K.
3
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
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.
1
2008
On a decision procedure for quantified linear programs. Zbl 1132.68034
Subramani, K.
8
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.
5
2007
Boolean functions as models for quantified Boolean formulas. Zbl 1126.03015
Kleine Büning, Hans; Subramani, K.; Zhao, Xishun
4
2007
On using priced timed automata to achieve optimal scheduling. Zbl 1105.68011
Rasmussen, J. I.; Larsen, K. G.; Subramani, K.
1
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.
7
2004
Resource-optimal scheduling using priced timed automata. Zbl 1126.68461
Rasmussen, J. I.; Larsen, Kim G.; Subramani, K.
5
2004
On Boolean models for quantified Boolean Horn formulas. Zbl 1204.03017
Kleine Büning, Hans; Subramani, K.; Zhao, Xishun
3
2004
Analyzing selected quantified integer programs. Zbl 1126.68589
Subramani, K.
2
2004
Optimal length tree-like resolution refutations for 2SAT formulas. Zbl 1367.68114
Subramani, K.
1
2004
Modified CSP-C continuous sampling plan for consumer protection. Zbl 1121.62324
Balamurali, S.; Subramani, K.
1
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.
1
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.
2
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.
1
1990
all top 5

Cited by 117 Authors

46 Subramani, Krishnan
14 Wojciechowski, Piotr J.
7 Eirinakis, Pavlos
7 Williamson, Matthew
6 Kleine Büning, Hans
4 Mkrtchyan, Vahan V.
3 Chandrasekaran, Ramaswamy
3 Desovski, D.
3 Gu, Xiaofeng
3 Ruggieri, Salvatore
2 Caskurlu, Bugra
2 Fahrenberg, Uli
2 Kimura, Kei
2 Legay, Axel
2 Lorenz, Ulf
2 Maculan, Nelson F.
2 Parekh, Ojas
2 Paschos, Vangelis Th.
2 Sudholt, Dirk
2 Thyssen, Christian
2 Wojciechowki, Piotr
2 Wolf, Jan
2 Zhao, Xishun
1 Abraham, Ittai
1 Aljazzar, Husain
1 Anderson, Matthew W.
1 Asahiro, Yuichi
1 Aslam, Muhammad Saeed
1 Bazgan, Cristina
1 Bentz, Cédric
1 Bhargava, Nikhil
1 Biere, Armin
1 Bonnet, Edouard
1 Bošnački, Dragan
1 Bruns, Florian
1 Bubeck, Uwe
1 Castro de Andrade, Rafael
1 Chawdhary, Aziem
1 Chiplunkar, Ashish
1 da Mota, Benoit
1 Di Puglia Pugliese, Luigi
1 Donovan, Zola
1 Droste, Manfred
1 Edelkamp, Stefan
1 Ederer, Thorsten
1 Escoffier, Bruno
1 Fehnker, Ansgar
1 Foucaud, Florent
1 Furukawa, Tetsuya
1 Giannopoulou, Archontia C.
1 Goerigk, Marc
1 Govindaraju, Kameswararao V.
1 Guerriero, Francesca
1 Gutin, Gregory Z.
1 Haouari, Mohamed
1 Heule, Marijn J. H.
1 Ibrahim, Mamane Souley
1 Ignatyev, Alexey A.
1 Ikegami, Keiichi
1 Jain, Chinmay
1 Janota, Mikoláš
1 Kalra, Tushar
1 Khan, Khushnoor
1 King, Andy
1 Knust, Sigrid
1 Krishna, Shankara Narayanan
1 Lai, Hong-Jian
1 Larsen, Kim Guldstrand
1 Le Bodic, Pierre
1 Li, Chunzhi
1 Madduri, Kamesh
1 Makino, Kazuhisa
1 Marques-Silva, João P.
1 Marquis, Pierre
1 Marzouk, Ahmed M.
1 Mathew, Rogers
1 McGregor, Andrew
1 Mertzios, George B.
1 Minoux, Michel Andre
1 Miyano, Eiji
1 Moreno-Centeno, Erick
1 Mrad, Mehdi
1 Mukherjee, Sathi
1 Neiman, Ofer
1 Niedermeier, Rolf
1 Opfer, Thomas
1 Orlin, James B.
1 Overton, Michael L.
1 Pal, Sudebkumar Prasant
1 Pandey, Vijay
1 Quaas, Karin
1 Robbins, Edward L.
1 Sangeetha, V.
1 Saraiva, Rommel Dias
1 Schöbel, Anita
1 Schuppan, Viktor
1 Schwind, Nicolas
1 Segev, Danny
1 Seidl, Martina
1 Shankar, Natarajan
...and 17 more Authors
all top 5

Cited in 43 Serials

10 Theoretical Computer Science
5 Discrete Applied Mathematics
4 Algorithmica
4 Annals of Mathematics and Artificial Intelligence
3 Journal of Automated Reasoning
3 Journal of Combinatorial Optimization
3 Journal of Discrete Algorithms
2 Acta Informatica
2 Artificial Intelligence
2 Applied Mathematics and Computation
2 Computational Optimization and Applications
2 Constraints
2 Discrete Optimization
1 SIAM Journal on Computing
1 Science of Computer Programming
1 Journal of Symbolic Computation
1 International Journal of Parallel Programming
1 Computers & Operations Research
1 SIAM Journal on Discrete Mathematics
1 Formal Aspects of Computing
1 Annals of Operations Research
1 JETAI. Journal of Experimental & Theoretical Artificial Intelligence
1 MSCS. Mathematical Structures in Computer Science
1 International Journal of Foundations of Computer Science
1 Economic Quality Control
1 Communications in Statistics. Simulation and Computation
1 International Journal of Computer Mathematics
1 Mathematical Programming. Series A. Series B
1 Formal Methods in System Design
1 INFORMS Journal on Computing
1 Theory of Computing Systems
1 Journal of Scheduling
1 Journal of Applied Mathematics and Decision Sciences
1 Journal of Graph Algorithms and Applications
1 Discrete Dynamics in Nature and Society
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 Journal of Statistical Theory and Practice
1 EURO Journal on Computational Optimization
1 Journal of Mathematics

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.