default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Subramani 0001
Person information
- affiliation: West Virginia University, Morgantown, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c83]A. Subramani, K. Subramani, Piotr Wojciechowski, Sangram K. Jena:
The MASEMPR Problem and Its Applications in Logistics. CALDAM 2025: 331-342- [c82]Piotr Wojciechowski, K. Subramani:
Dag-Like Unit Refutations in UTVPI Constraint Systems. WALCOM 2025: 377-392 - 2024
- [j94]Alvaro Velasquez, Piotr Wojciechowski, K. Subramani
, Matthew D. Williamson:
Arc-dependent networks: theoretical insights and a computational study. Ann. Oper. Res. 338(2): 1101-1126 (2024) - [j93]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu:
Priority-based bin packing with subset constraints. Discret. Appl. Math. 342: 64-75 (2024) - [j92]Piotr Wojciechowski, K. Subramani:
Proving the infeasibility of Horn formulas through read-once resolution. Discret. Appl. Math. 354: 131-145 (2024) - [j91]Stanley Bak, Taylor Dohmen, K. Subramani, Ashutosh Trivedi, Alvaro Velasquez, Piotr Wojciechowski:
The hexatope and octatope abstract domains for neural network verification. Formal Methods Syst. Des. 64(1): 178-199 (2024) - [j90]Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
Approximation Algorithms for Partial Vertex Covers in Trees. Int. J. Found. Comput. Sci. 35(4): 387-407 (2024) - [j89]K. Subramani, Piotr Wojciechowski:
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective. Math. Struct. Comput. Sci. 34(3): 227-243 (2024) - [j88]Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. Theory Comput. Syst. 68(1): 122-143 (2024) - [j87]K. Subramani, Piotr Wojciechowski, Alvaro Velasquez:
Farkas Bounds on Horn Constraint Systems. Theory Comput. Syst. 68(2): 227-249 (2024) - [j86]Sangram K. Jena, K. Subramani, Alvaro Velasquez:
Designing dataless neural networks for kidney exchange variants. Neural Comput. Appl. 36(35): 22265-22275 (2024) - [c81]Sangram Kishor Jena, K. Subramani, Alvaro Velasquez:
A Differential Approach for Several NP-hard Optimization Problems. ISAIM 2024: 68-80 - [c80]K. Subramani, Piotr Wojciechowski:
On the Computational Complexities of Finding Selected Refutations of Linear Programs. ISAIM 2024: 81-93 - [c79]Piotr Wojciechowski, K. Subramani:
A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems. LOPSTR 2024: 99-114 - [c78]Cody Klingler, K. Subramani:
An Empirical Evaluation of Algorithms for Simple Stochastic Games. MIWAI (1) 2024: 284-296 - 2023
- [j85]K. Subramani, Piotr Wojciechowski:
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling. Algorithmica 85(2): 610-637 (2023) - [j84]Utku Umur Acikalin, Bugra Çaskurlu, K. Subramani:
Security-Aware Database Migration Planning. Constraints An Int. J. 28(3): 472-505 (2023) - [j83]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez:
Reachability in choice networks. Discret. Optim. 48(Part 1): 100761 (2023) - [j82]K. Subramani, Piotr Wojciechowski:
Optimal length cutting plane refutations of integer programs. Discret. Optim. 50: 100806 (2023) - [j81]Alvaro Velasquez, K. Subramani, Piotr Wojciechowski:
Reachability problems in interval-constrained and cardinality-constrained graphs. Discret. Math. Algorithms Appl. 15(4): 2250110:1-2250110:26 (2023) - [j80]Alvaro Velasquez, Ismail Alkhouri, K. Subramani, Piotr Wojciechowski, George K. Atia:
Optimal Deterministic Controller Synthesis from Steady-State Distributions. J. Autom. Reason. 67(1): 7 (2023) - [j79]K. Subramani, Piotr Wojciechowski:
Unit Read-once Refutations for Systems of Difference Constraints. Theory Comput. Syst. 67(4): 877-899 (2023) - [c77]K. Subramani, Piotr Wojciechowski:
Optimal Length Cutting Plane Refutations of Integer Programs. CALDAM 2023: 15-27 - [c76]Sangram Kishor Jena, K. Subramani, Alvaro Velasquez:
Differentiable Discrete Optimization Using Dataless Neural Networks. COCOA (2) 2023: 3-15 - [c75]K. Subramani, Piotr Wojciechowski:
Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints. COCOA (2) 2023: 377-389 - [c74]K. Subramani, Piotr Wojciechowski:
Unit Refutations of Difference Constraint Systems. ECAI 2023: 2226-2233 - [c73]Stanley Bak, Taylor Dohmen, K. Subramani, Ashutosh Trivedi, Alvaro Velasquez, Piotr Wojciechowski:
The Octatope Abstract Domain for Verification of Neural Networks. FM 2023: 454-472 - [c72]Piotr Wojciechowski, K. Subramani:
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. SOFSEM 2023: 313-327 - 2022
- [j78]K. Subramani, Piotr Wojciechowski:
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas. Ann. Math. Artif. Intell. 90(1): 3-29 (2022) - [j77]Piotr Wojciechowski, K. Subramani:
On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems. Ann. Math. Artif. Intell. 90(10): 979-998 (2022) - [j76]Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On the analysis of optimization problems in arc-dependent networks. Discret. Optim. 45: 100729 (2022) - [j75]Piotr Wojciechowski, K. Subramani, R. Chandrasekaran:
Analyzing Read-Once Cutting Plane Proofs in Horn Systems. J. Autom. Reason. 66(2): 239-274 (2022) - [j74]K. Subramani, Piotr Wojciechowski, Ying Sheng:
Read-once refutations in Horn constraint systems: an algorithmic approach. J. Log. Comput. 32(4): 667-696 (2022) - [j73]Alvaro Velasquez, K. Subramani, Piotr Wojciechowski:
On the complexity of and solutions to the minimum stopping and trapping set problems. Theor. Comput. Sci. 915: 26-44 (2022) - [c71]K. Subramani, Piotr Wojciechowski, Alvaro Velasquez:
New Results in Priority-Based Bin Packing. ALGOCLOUD 2022: 58-72 - [c70]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson:
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. CALDAM 2022: 292-304 - [c69]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez:
Analyzing the Reachability Problem in Choice Networks. CPAIOR 2022: 408-423 - [c68]K. Subramani, Piotr Wojciechowski:
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. LFCS 2022: 327-345 - [c67]Sangram Kishor Jena, K. Subramani:
Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs. TAMC 2022: 103-115 - [c66]K. Subramani, Piotr Wojciechowski:
On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems. TAMC 2022: 293-304 - 2021
- [j72]Piotr Wojciechowski, K. Subramani, Matthew D. Williamson:
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discret. Appl. Math. 305: 272-294 (2021) - [j71]K. Subramani, Piotr Wojciechowski:
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems. Theor. Comput. Sci. 883: 1-18 (2021) - [j70]Piotr Wojciechowski, K. Subramani:
Copy complexity of Horn formulas with respect to unit read-once resolution. Theor. Comput. Sci. 890: 70-86 (2021) - [c65]Utku Umur Acikalin, Bugra Çaskurlu, Piotr Wojciechowski, K. Subramani:
New Results on Test-Cost Minimization in Database Migration. ALGOCLOUD 2021: 38-55 - [c64]Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu:
Algorithmic Analysis of Priority-Based Bin Packing. CALDAM 2021: 359-372 - [c63]K. Subramani, Piotr Wojciechowski, Alvaro Velasquez:
On the Copy Complexity of Width 3 Horn Constraint Systems. FroCoS 2021: 63-78 - [c62]K. Subramani, Piotr Wojciechowski:
Analyzing Unit Read-Once Refutations in Difference Constraint Systems. JELIA 2021: 147-161 - [c61]K. Subramani, Piotr Wojciechowski:
Tree-Like Unit Refutations in Horn Constraint Systems. LATA 2021: 226-237 - 2020
- [j69]K. Subramani, Piotr Wojciechowski:
On integer closure in a system of unit two variable per inequality constraints. Ann. Math. Artif. Intell. 88(10): 1101-1118 (2020) - [j68]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. Math. Struct. Comput. Sci. 30(7): 736-751 (2020) - [j67]Zola Donovan, K. Subramani, Vahan V. Mkrtchyan:
Analyzing Clustering and Partitioning Problems in Selected VLSI Models. Theory Comput. Syst. 64(7): 1242-1272 (2020) - [j66]Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Analyzing fractional Horn constraint systems. Theor. Comput. Sci. 844: 142-153 (2020) - [c60]Piotr Wojciechowski, K. Subramani:
On Unit Read-Once Resolutions and Copy Complexity. COCOA 2020: 273-288 - [c59]K. Subramani, Piotr Wojciechowski:
Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective. ISAIM 2020 - [c58]Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
On Finding Shortest Paths in Arc-Dependent Networks. ISCO 2020: 249-260 - [c57]Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski:
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. IWOCA 2020: 395-408
2010 – 2019
- 2019
- [j65]K. Subramani, Piotr Wojciechowski:
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. Algorithmica 81(7): 2765-2794 (2019) - [j64]Matthew Anderson, Matthew D. Williamson, K. Subramani:
Empirical analysis of algorithms for the shortest negative cost cycle problem. Discret. Appl. Math. 253: 167-184 (2019) - [j63]Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani:
Clustering without replication in combinatorial circuits. J. Comb. Optim. 38(2): 481-501 (2019) - [c56]K. Subramani, Piotr Wojciechowski:
A Graphical Analysis of Integer Infeasibility in UTVPI Constraints. AI*IA 2019: 223-234 - [c55]K. Subramani, Bugra Çaskurlu, Utku Umur Acikalin:
Security-Aware Database Migration Planning. ALGOCLOUD 2019: 103-121 - [c54]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
Read-Once Resolutions in Horn Formulas. FAW 2019: 100-110 - [c53]Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani:
Restricted Cutting Plane Proofs in Horn Constraint Systems. FroCos 2019: 149-164 - [c52]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
New Results on Cutting Plane Proofs for Horn Constraint Systems. FSTTCS 2019: 43:1-43:14 - [c51]Zola Donovan, K. Subramani, Vahan Mkrtchyan:
Disjoint Clustering in Combinatorial Circuits. IWOCA 2019: 201-213 - [c50]K. Subramani, Piotr Wojciechowski:
Read-Once Certification of Linear Infeasibility in UTVPI Constraints. TAMC 2019: 578-593 - [i5]Vahan Mkrtchyan, Garik Petrosyan, K. Subramani:
Parameterized algorithms for Partial vertex covers in bipartite graphs. CoRR abs/1904.12011 (2019) - 2018
- [j62]James B. Orlin, K. Subramani, Piotr Wojciechowski:
Randomized algorithms for finding the shortest negative cost cycle in networks. Discret. Appl. Math. 236: 387-394 (2018) - [j61]K. Subramani, Piotr Wojciechowski:
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. J. Comb. Optim. 35(2): 389-408 (2018) - [j60]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan:
On approximating optimal weight "no"-certificates in weighted difference constraint systems. J. Comb. Optim. 36(2): 329-345 (2018) - [j59]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
Finding read-once resolution refutations in systems of 2CNF clauses. Theor. Comput. Sci. 729: 42-56 (2018) - [c49]K. Subramani, Piotr Wojciechowski, Zachary Santer, Matthew Anderson:
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. AAIM 2018: 111-123 - [c48]K. Subramani, Bugra Çaskurlu, Alvaro Velasquez:
Minimization of Testing Costs in Capacity-Constrained Database Migration. ALGOCLOUD 2018: 1-12 - [c47]Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski:
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. CALDAM 2018: 45-58 - [c46]Piotr Wojciechowski, K. Subramani, Matthew D. Williamson:
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. FAW 2018: 300-314 - [c45]Alvaro Velasquez, K. Subramani, Steven L. Drager:
Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach. ISCO 2018: 402-415 - 2017
- [j58]K. Subramani, Piotr Wojciechowski:
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints. Algorithmica 78(1): 166-208 (2017) - [j57]Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani:
Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79(1-3): 245-266 (2017) - [j56]Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani:
Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. Ann. Math. Artif. Intell. 79(4): 371-392 (2017) - [j55]Pavlos Eirinakis, Matthew D. Williamson, K. Subramani:
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. J. Graph Algorithms Appl. 21(2): 177-181 (2017) - [j54]Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs. SIAM J. Discret. Math. 31(3): 2172-2184 (2017) - [c44]K. Subramani, Piotr Wojciechowski:
Analyzing Lattice Point Feasibility in UTVPI Constraints. CP 2017: 615-629 - [c43]Piotr Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani:
On a Generalization of Horn Constraint Systems. CSR 2017: 323-336 - [c42]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
The Complexity of Finding Read-Once NAE-Resolution Refutations. ICLA 2017: 64-76 - [c41]Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani:
The Approximability of Partial Vertex Covers in Trees. SOFSEM 2017: 350-360 - [c40]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. TAMC 2017: 362-372 - 2016
- [j53]Matthew D. Williamson, Pavlos Eirinakis, K. Subramani:
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem. Algorithmica 74(1): 270-325 (2016) - [j52]Matthew D. Williamson, K. Subramani:
Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50]. J. Discrete Algorithms 38-41: 52-53 (2016) - [c39]Piotr Wojciechowski, K. Subramani, Pavlos Eirinakis:
On the computational complexities of Quantified Integer Programming variants. ISAIM 2016 - [c38]K. Subramani, Piotr Wojciechowski:
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints. IWOCA 2016: 321-333 - [c37]Vahid Hashemi, Holger Hermanns, Lei Song, K. Subramani, Andrea Turrini, Piotr Wojciechowski:
Compositional Bisimulation Minimization for Interval Markov Decision Processes. LATA 2016: 114-126 - [c36]Alvaro Velasquez, Piotr Wojciechowski, K. Subramani, Steven L. Drager, Sumit Kumar Jha:
The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks. NCA 2016: 126-130 - [c35]K. Subramani, Piotr Wojciechowski:
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. WALCOM 2016: 154-165 - [i4]Pavlos Eirinakis, Matthew D. Williamson, K. Subramani:
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem. CoRR abs/1603.08627 (2016) - [i3]Hans Kleine Büning, Piotr Wojciechowski, K. Subramani:
On the computational complexity of read once resolution decidability in 2CNF formulas. CoRR abs/1610.04523 (2016) - 2015
- [j51]Matthew D. Williamson, K. Subramani:
A new algorithm for the minimum spanning tree verification problem. Comput. Optim. Appl. 61(1): 189-204 (2015) - [j50]Matthew D. Williamson, K. Subramani:
A Parallel Implementation for the Negative Cost Girth Problem. Int. J. Parallel Program. 43(2): 240-259 (2015) - [j49]Vahan Mkrtchyan, K. Subramani:
On the approximability of the Largest Sphere Rule Ensemble Classification problem. Inf. Process. Lett. 115(11): 833-837 (2015) - [j48]Matthew D. Williamson, K. Subramani:
On the negative cost girth problem in planar networks. J. Discrete Algorithms 35: 40-50 (2015) - [j47]Natarajan Shankar, K. Subramani, Pavlos Eirinakis:
Identifying Negative Cost Cycles in Strongly Polynomial Space. Nord. J. Comput. 15(2): 154-171 (2015) - [j46]K. Subramani, James Worthington:
Feasibility checking in Horn constraint systems through a reduction based approach. Theor. Comput. Sci. 576: 1-17 (2015) - [c34]Zola Donovan, Vahan Mkrtchyan, K. Subramani:
On Clustering Without Replication in Combinatorial Circuits. COCOA 2015: 334-347 - [c33]K. Subramani, Piotr Wojciechowski:
A Graphical Theorem of the Alternative for UTVPI Constraints. ICTAC 2015: 328-345 - 2014
- [j45]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski:
On quantified linear implications. Ann. Math. Artif. Intell. 71(4): 301-325 (2014) - [j44]K. Subramani, James Worthington:
On Certifying Instances of Zero-Clairvoyant Scheduling. Comput. J. 57(1): 129-137 (2014) - [j43]Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani, Piotr Wojciechowski:
On the complexity of quantified linear systems. Theor. Comput. Sci. 518: 128-134 (2014) - [c32]Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani:
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs. IFIP TCS 2014: 13-26 - [c31]Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani:
Variants of Quantified Linear Programming and Quantified Linear Implication. ISAIM 2014 - [i2]Zola Donovan, Vahan Mkrtchyan, K. Subramani:
Clustering without replication: approximation and inapproximability. CoRR abs/1412.4051 (2014) - 2013
- [j42]Bugra Çaskurlu, Ashish Gehani, Cemal Çagatay Bilgin, K. Subramani:
Analytical models for risk-based intrusion response. Comput. Networks 57(10): 2181-2192 (2013) - [j41]R. Chandrasekaran, K. Subramani:
A combinatorial algorithm for Horn programs. Discret. Optim. 10(2): 85-101 (2013) - [j40]K. Subramani, Matthew D. Williamson, Xiaofeng Gu:
Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Aspects Comput. 25(2): 319-341 (2013) - [j39]Z. Liang, K. Subramani, James Worthington:
Polynomial time certifying algorithms for the planar quantified integer programming problem. J. Log. Comput. 23(5): 1017-1033 (2013) - [i1]Bugra Çaskurlu, 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 Wojciechowski:
A complexity perspective on entailment of parameterized linear constraints. Constraints An Int. J. 17(4): 461-487 (2012) - [c30]Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr 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. Appl. Math. Comput. 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 D. 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 Informatica 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. Adv. Decis. Sci. 2009: 845804:1-845804:18 (2009) - [j30]K. Subramani:
Optimal Length Resolution Refutations of Difference Constraint Systems. J. Autom. Reason. 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]R. Chandrasekaran, K. Subramani:
A Combinatorial Algorithm for Horn Programs. ISAAC 2009: 1114-1123 - 2008
- [j28]K. Subramani, Kiran Yellajyosula, Ashraf M. Osman:
Distributed algorithms for partially clairvoyant dispatchers. Clust. Comput. 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. Int. J. Parallel Program. 36(4): 386-411 (2008) - [j25]K. Subramani, Kamesh Madduri:
A Randomized Queueless Algorithm for Breadth-First Search. Int. J. Comput. Their 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]K. Subramani:
Absorbing Random Walks and the NAE2SAT Problem. FAW 2008: 89-100 - 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. Appl. Log. 5(4): 667-680 (2007) - [j21]Hans Kleine Büning, K. Subramani, Xishun Zhao:
Boolean Functions as Models for Quantified Boolean Formulas. J. Autom. Reason. 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. J. Satisf. Boolean Model. Comput. 3(1-2): 67-90 (2007) - [j18]K. Subramani, Dejan Desovski:
An empirical analysis of algorithms for partially Clairvoyant scheduling. Int. J. Parallel Emergent Distributed Syst. 22(5): 331-353 (2007) - [c23]K. Subramani, Kamesh Madduri:
Accomplishing Approximate FCFS Fairness Without Queues. HiPC 2007: 540-551 - [c22]K. Subramani:
A Randomized Algorithm for BBCSPs in the Prover-Verifier Model. ICTAC 2007: 455-466 - 2006
- [j17]K. Subramani, Dejan Desovski:
On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection. Appl. Math. Comput. 173(1): 273-305 (2006) - [j16]K. Subramani, C. Tauras:
An approximation algorithm for state minimization in 2-MDFAs. Formal Aspects 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 Syst. Des. 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]K. Subramani:
Totally Clairvoyant Scheduling with Relative Timing Constraints. VMCAI 2006: 398-411 - 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 Gener. Comput. Syst. 21(4): 607-623 (2005) - [j11]K. Subramani:
Cascading random walks. Int. J. Found. Comput. Sci. 16(3): 599-622 (2005) - [j10]K. Subramani:
Partially clairvoyant scheduling for aggregate constraints. Adv. Decis. Sci. 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. Math. Struct. Comput. Sci. 15(2): 383-406 (2005) - [j7]K. Subramani:
Tractable Fragments of Presburger Arithmetic. Theory Comput. Syst. 38(5): 647-668 (2005) - [j6]K. Subramani:
An Analysis of Totally Clairvoyant Scheduling. J. Sched. 8(2): 113-133 (2005) - [j5]K. Subramani:
Erratum: An Analysis of Totally Clairvoyant Scheduling. J. Sched. 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]K. Subramani:
Zero-Clairvoyant Scheduling with Inter-period Constraints. ASIAN 2004: 236-247 - [c15]K. Subramani:
Analyzing Selected Quantified Integer Programs. IJCAR 2004: 342-356 - [c14]K. Subramani, Kiran Yellajyosula:
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers. HiPC 2004: 111-122 - [c13]K. Subramani, Kiran Yellajyosula, Ashraf M. 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]K. Subramani:
An Analysis of Quantified Linear Programs. DMTCS 2003: 265-277 - [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]K. Subramani:
On Clausal Equivalence and Hull Inclusion. ICTCS 2003: 188-201 - [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]K. Subramani:
A Specification Framework for Real-Time Scheduling. SOFSEM 2002: 195-207 - [c4]K. Subramani:
An Analysis of Zero-Clairvoyant Scheduling. TACAS 2002: 98-112 - 2001
- [j1]K. Subramani:
A polyhedral projection procedure for Q2SAT. Electron. Notes Discret. Math. 9: 369-375 (2001) - [c3]K. Subramani:
Parametric Scheduling for Network Constraints. COCOON 2001: 550-560 - [c2]K. Subramani:
Parametric Scheduling - Algorithms and Complexity. HiPC 2001: 36-46 - 2000
- [c1]K. Subramani, Ashok K. Agrawala:
A Dual Interpretation of "Standard Constraints" in Parametric Scheduling. FTRTFT 2000: 121-133
Coauthor Index
Vahan V. Mkrtchyan
aka: Vahan Mkrtchyan
aka: Vahan Mkrtchyan
[c83] [c82] [j94] [j93] [j92] [j91] [j89] [j88] [j87] [c80] [c79] [j85] [j83] [j82] [j81] [j80] [j79] [c77] [c75] [c74] [c73] [c72] [j78] [j77] [j76] [j75] [j74] [j73] [c71] [c70] [c69] [c68] [c66] [j72] [j71] [j70] [c65] [c64] [c63] [c62] [c61] [j69] [j68] [j66] [c60] [c59] [c58] [c57] [j65] [c56] [c54] [c53] [c52] [c50] [j62] [j61] [j59] [c49] [c47] [c46] [j58] [j57] [j56] [c44] [c43] [c42] [c40] [c39] [c38] [c37] [c36] [c35] [i3] [c33] [j45] [j43] [c31] [j38] [c30]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-27 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
