K. Subramani

196 papers A 7B 12C 19Misc 19Journal 108Unranked 31
YearRankTypeTitle / Venue / Authors
2026 J jnl
On the computational and approximation complexities of selected unit refutations in UTVPI constraint systems.
Theor. Comput. Sci.
Piotr Wojciechowski, K. Subramani
2025 J jnl
Advancing discrete optimization: novel approaches with dataless neural networks.
J. Comb. Optim.
Sangram K. Jena, K. Subramani, Alvaro Velasquez
2025 J jnl
An Analysis of Las Vegas Algorithms for Linear Search.
Int. J. Found. Comput. Sci.
A. Subramani, K. Subramani
2025 J jnl
Analyzing the 3-path vertex cover problem in selected graph classes.
J. Comb. Optim.
Sangram K. Jena, K. Subramani
2025 J jnl
Correction to: Farkas Bounds on Horn Constraint Systems.
Theory Comput. Syst.
K. Subramani, Piotr Wojciechowski, Alvaro Velasquez
2025 B conf
Dag-Like Unit Refutations in UTVPI Constraint Systems.
WALCOM
Piotr Wojciechowski, K. Subramani
2025 J jnl
Exploring cycle cover variants: A dataless neural networks approach.
Neurocomputing
Sangram K. Jena, K. Subramani, Alvaro Velasquez
2025 — conf
Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems.
JELIA (1)
Piotr Wojciechowski, K. Subramani
2025 — conf
From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances.
IJTCS-FAW
Sangram K. Jena, K. Subramani
2025 — conf
Maximum Path Sets in Trees.
RP
A. Subramani, K. Subramani, Jacob Restanio
2025 J jnl
Models for Test Cost Minimization in Database Migration.
INFORMS J. Comput.
Bugra Çaskurlu, K. Subramani, Utku Umur Acikalin, Alvaro Velasquez, Piotr Wojciechowski
2025 J jnl
Parameterized lower bounds for the weighted vertex cover problem in trees.
Acta Informatica
Piotr Wojciechowski, K. Subramani
2025 — conf
The MASEMPR Problem and Its Applications in Logistics.
CALDAM
A. Subramani, K. Subramani, Piotr Wojciechowski, Sangram K. Jena
2025 — conf
Unit Refutations in Horn Constraint Systems.
CIAC (1)
Piotr Wojciechowski, K. Subramani
2025 J jnl
Unit refutability of horn constraint systems - certification and parallel complexity.
Theor. Comput. Sci.
Piotr Wojciechowski, K. Subramani
2024 C conf
A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems.
LOPSTR
Piotr Wojciechowski, K. Subramani
2024 Misc conf
A Differential Approach for Several NP-hard Optimization Problems.
ISAIM
Sangram Kishor Jena, K. Subramani, Alvaro Velasquez
2024 — conf
An Empirical Evaluation of Algorithms for Simple Stochastic Games.
MIWAI (1)
Cody Klingler, K. Subramani
2024 J jnl
Approximation Algorithms for Partial Vertex Covers in Trees.
Int. J. Found. Comput. Sci.
Vahan Mkrtchyan, Ojas Parekh, K. Subramani
2024 J jnl
Arc-dependent networks: theoretical insights and a computational study.
Ann. Oper. Res.
Alvaro Velasquez, Piotr Wojciechowski, K. Subramani, Matthew D. Williamson
2024 J jnl
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective.
Math. Struct. Comput. Sci.
K. Subramani, Piotr Wojciechowski
2024 J jnl
Designing dataless neural networks for kidney exchange variants.
Neural Comput. Appl.
Sangram K. Jena, K. Subramani, Alvaro Velasquez
2024 J jnl
Farkas Bounds on Horn Constraint Systems.
Theory Comput. Syst.
K. Subramani, Piotr Wojciechowski, Alvaro Velasquez
2024 Misc conf
On the Computational Complexities of Finding Selected Refutations of Linear Programs.
ISAIM
K. Subramani, Piotr Wojciechowski
2024 J jnl
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective.
Theory Comput. Syst.
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski
2024 — conf
Optimizing Cloud-Based Systems Through Resource-Constrained Distance Matching.
ALGOCLOUD
Sangram K. Jena, K. Subramani
2024 J jnl
Priority-based bin packing with subset constraints.
Discret. Appl. Math.
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu
2024 J jnl
Proving the infeasibility of Horn formulas through read-once resolution.
Discret. Appl. Math.
Piotr Wojciechowski, K. Subramani
2024 J jnl
The hexatope and octatope abstract domains for neural network verification.
Formal Methods Syst. Des.
Stanley Bak, Taylor Dohmen, K. Subramani, Ashutosh Trivedi, Alvaro Velasquez, Piotr Wojciechowski
2023 B conf
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints.
SOFSEM
Piotr Wojciechowski, K. Subramani
2023 — conf
Differentiable Discrete Optimization Using Dataless Neural Networks.
COCOA (2)
Sangram Kishor Jena, K. Subramani, Alvaro Velasquez
2023 J jnl
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling.
Algorithmica
K. Subramani, Piotr Wojciechowski
2023 J jnl
Optimal Deterministic Controller Synthesis from Steady-State Distributions.
J. Autom. Reason.
Alvaro Velasquez, Ismail Alkhouri, K. Subramani, Piotr Wojciechowski, George K. Atia
2023 — conf
Optimal Length Cutting Plane Refutations of Integer Programs.
CALDAM
K. Subramani, Piotr Wojciechowski
2023 J jnl
Optimal length cutting plane refutations of integer programs.
Discret. Optim.
K. Subramani, Piotr Wojciechowski
2023 — conf
Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints.
COCOA (2)
K. Subramani, Piotr Wojciechowski
2023 J jnl
Reachability in choice networks.
Discret. Optim.
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez
2023 J jnl
Reachability problems in interval-constrained and cardinality-constrained graphs.
Discret. Math. Algorithms Appl.
Alvaro Velasquez, K. Subramani, Piotr Wojciechowski
2023 J jnl
Security-Aware Database Migration Planning.
Constraints An Int. J.
Utku Umur Acikalin, Bugra Çaskurlu, K. Subramani
2023 B conf
The Octatope Abstract Domain for Verification of Neural Networks.
FM
Stanley Bak, Taylor Dohmen, K. Subramani, Ashutosh Trivedi, Alvaro Velasquez, Piotr Wojciechowski
2023 J jnl
Unit Read-once Refutations for Systems of Difference Constraints.
Theory Comput. Syst.
K. Subramani, Piotr Wojciechowski
2023 A conf
Unit Refutations of Difference Constraint Systems.
ECAI
K. Subramani, Piotr Wojciechowski
2022 J jnl
Analyzing Read-Once Cutting Plane Proofs in Horn Systems.
J. Autom. Reason.
Piotr Wojciechowski, K. Subramani, R. Chandrasekaran
2022 C conf
Analyzing the 3-path Vertex Cover Problem in Planar Bipartite Graphs.
TAMC
Sangram Kishor Jena, K. Subramani
2022 B conf
Analyzing the Reachability Problem in Choice Networks.
CPAIOR
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez
2022 Misc conf
Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems.
LFCS
K. Subramani, Piotr Wojciechowski
2022 — conf
New Results in Priority-Based Bin Packing.
ALGOCLOUD
K. Subramani, Piotr Wojciechowski, Alvaro Velasquez
2022 — conf
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks.
CALDAM
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Matthew D. Williamson
2022 C conf
On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems.
TAMC
K. Subramani, Piotr Wojciechowski
2022 J jnl
On the analysis of optimization problems in arc-dependent networks.
Discret. Optim.
Piotr Wojciechowski, Matthew D. Williamson, K. Subramani
2022 J jnl
On the complexity of and solutions to the minimum stopping and trapping set problems.
Theor. Comput. Sci.
Alvaro Velasquez, K. Subramani, Piotr Wojciechowski
2022 J jnl
On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems.
Ann. Math. Artif. Intell.
Piotr Wojciechowski, K. Subramani
2022 J jnl
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas.
Ann. Math. Artif. Intell.
K. Subramani, Piotr Wojciechowski
2022 J jnl
Read-once refutations in Horn constraint systems: an algorithmic approach.
J. Log. Comput.
K. Subramani, Piotr Wojciechowski, Ying Sheng
2021 — conf
Algorithmic Analysis of Priority-Based Bin Packing.
CALDAM
Piotr Wojciechowski, K. Subramani, Alvaro Velasquez, Bugra Çaskurlu
2021 B conf
Analyzing Unit Read-Once Refutations in Difference Constraint Systems.
JELIA
K. Subramani, Piotr Wojciechowski
2021 J jnl
Copy complexity of Horn formulas with respect to unit read-once resolution.
Theor. Comput. Sci.
Piotr Wojciechowski, K. Subramani
2021 — conf
New Results on Test-Cost Minimization in Database Migration.
ALGOCLOUD
Utku Umur Acikalin, Bugra Çaskurlu, Piotr Wojciechowski, K. Subramani
2021 — conf
On the Copy Complexity of Width 3 Horn Constraint Systems.
FroCoS
K. Subramani, Piotr Wojciechowski, Alvaro Velasquez
2021 J jnl
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems.
Theor. Comput. Sci.
K. Subramani, Piotr Wojciechowski
2021 J jnl
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints.
Discret. Appl. Math.
Piotr Wojciechowski, K. Subramani, Matthew D. Williamson
2021 C conf
Tree-Like Unit Refutations in Horn Constraint Systems.
LATA
K. Subramani, Piotr Wojciechowski
2020 J jnl
Analyzing Clustering and Partitioning Problems in Selected VLSI Models.
Theory Comput. Syst.
Zola Donovan, K. Subramani, Vahan V. Mkrtchyan
2020 J jnl
Analyzing fractional Horn constraint systems.
Theor. Comput. Sci.
Piotr Wojciechowski, R. Chandrasekaran, K. Subramani
2020 Misc conf
Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective.
ISAIM
K. Subramani, Piotr Wojciechowski
2020 J jnl
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability.
Math. Struct. Comput. Sci.
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2020 C conf
On Finding Shortest Paths in Arc-Dependent Networks.
ISCO
Piotr Wojciechowski, Matthew D. Williamson, K. Subramani
2020 C conf
On Unit Read-Once Resolutions and Copy Complexity.
COCOA
Piotr Wojciechowski, K. Subramani
2020 J jnl
On integer closure in a system of unit two variable per inequality constraints.
Ann. Math. Artif. Intell.
K. Subramani, Piotr Wojciechowski
2020 C conf
Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs.
IWOCA
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani, Piotr Wojciechowski
2019 — conf
A Graphical Analysis of Integer Infeasibility in UTVPI Constraints.
AI*IA
K. Subramani, Piotr Wojciechowski
2019 J jnl
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.
Algorithmica
K. Subramani, Piotr Wojciechowski
2019 J jnl
Clustering without replication in combinatorial circuits.
J. Comb. Optim.
Zola Donovan, Gregory Z. Gutin, Vahan Mkrtchyan, K. Subramani
2019 C conf
Disjoint Clustering in Combinatorial Circuits.
IWOCA
Zola Donovan, K. Subramani, Vahan Mkrtchyan
2019 J jnl
Empirical analysis of algorithms for the shortest negative cost cycle problem.
Discret. Appl. Math.
Matthew Anderson, Matthew D. Williamson, K. Subramani
2019 — conf
New Results on Cutting Plane Proofs for Horn Constraint Systems.
FSTTCS
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2019 J jnl
Parameterized algorithms for Partial vertex covers in bipartite graphs.
CoRR
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani
2019 C conf
Read-Once Certification of Linear Infeasibility in UTVPI Constraints.
TAMC
K. Subramani, Piotr Wojciechowski
2019 Misc conf
Read-Once Resolutions in Horn Formulas.
FAW
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2019 — conf
Restricted Cutting Plane Proofs in Horn Constraint Systems.
FroCos
Hans Kleine Büning, Piotr Wojciechowski, R. Chandrasekaran, K. Subramani
2019 — conf
Security-Aware Database Migration Planning.
ALGOCLOUD
K. Subramani, Bugra Çaskurlu, Utku Umur Acikalin
2018 — conf
A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.
CALDAM
Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan, Piotr Wojciechowski
2018 J jnl
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints.
J. Comb. Optim.
K. Subramani, Piotr Wojciechowski
2018 C conf
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints.
AAIM
K. Subramani, Piotr Wojciechowski, Zachary Santer, Matthew Anderson
2018 C conf
Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach.
ISCO
Alvaro Velasquez, K. Subramani, Steven L. Drager
2018 J jnl
Finding read-once resolution refutations in systems of 2CNF clauses.
Theor. Comput. Sci.
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2018 — conf
Minimization of Testing Costs in Capacity-Constrained Database Migration.
ALGOCLOUD
K. Subramani, Bugra Çaskurlu, Alvaro Velasquez
2018 J jnl
On approximating optimal weight "no"-certificates in weighted difference constraint systems.
J. Comb. Optim.
Bugra Çaskurlu, Matthew D. Williamson, K. Subramani, Vahan Mkrtchyan
2018 Misc conf
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints.
FAW
Piotr Wojciechowski, K. Subramani, Matthew D. Williamson
2018 J jnl
Randomized algorithms for finding the shortest negative cost cycle in networks.
Discret. Appl. Math.
James B. Orlin, K. Subramani, Piotr Wojciechowski
2017 J jnl
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints.
Algorithmica
K. Subramani, Piotr Wojciechowski
2017 A conf
Analyzing Lattice Point Feasibility in UTVPI Constraints.
CP
K. Subramani, Piotr Wojciechowski
2017 J jnl
Analyzing restricted fragments of the theory of linear arithmetic.
Ann. Math. Artif. Intell.
Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani
2017 J jnl
Erratum to: Analyzing restricted fragments of the theory of linear arithmetic.
Ann. Math. Artif. Intell.
Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani
2017 Misc conf
On a Generalization of Horn Constraint Systems.
CSR
Piotr Wojciechowski, Ramaswamy Chandrasekaran, K. Subramani
2017 C conf
On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas.
TAMC
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2017 J jnl
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.
J. Graph Algorithms Appl.
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
2017 J jnl
Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs.
SIAM J. Discret. Math.
Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
2017 B conf
The Approximability of Partial Vertex Covers in Trees.
SOFSEM
Vahan Mkrtchyan, Ojas Parekh, Danny Segev, K. Subramani
2017 — conf
The Complexity of Finding Read-Once NAE-Resolution Refutations.
ICLA
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2016 C conf
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints.
IWOCA
K. Subramani, Piotr Wojciechowski
2016 B conf
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints.
WALCOM
K. Subramani, Piotr Wojciechowski
2016 C conf
Compositional Bisimulation Minimization for Interval Markov Decision Processes.
LATA
Vahid Hashemi, Holger Hermanns, Lei Song, K. Subramani, Andrea Turrini, Piotr Wojciechowski
2016 J jnl
Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50].
J. Discrete Algorithms
Matthew D. Williamson, K. Subramani
2016 J jnl
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem.
Algorithmica
Matthew D. Williamson, Pavlos Eirinakis, K. Subramani
2016 J jnl
On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.
CoRR
Pavlos Eirinakis, Matthew D. Williamson, K. Subramani
2016 Misc conf
On the computational complexities of Quantified Integer Programming variants.
ISAIM
Piotr Wojciechowski, K. Subramani, Pavlos Eirinakis
2016 J jnl
On the computational complexity of read once resolution decidability in 2CNF formulas.
CoRR
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
2016 B conf
The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks.
NCA
Alvaro Velasquez, Piotr Wojciechowski, K. Subramani, Steven L. Drager, Sumit Kumar Jha
2015 C conf
A Graphical Theorem of the Alternative for UTVPI Constraints.
ICTAC
K. Subramani, Piotr Wojciechowski
2015 J jnl
A Parallel Implementation for the Negative Cost Girth Problem.
Int. J. Parallel Program.
Matthew D. Williamson, K. Subramani
2015 J jnl
A new algorithm for the minimum spanning tree verification problem.
Comput. Optim. Appl.
Matthew D. Williamson, K. Subramani
2015 J jnl
Feasibility checking in Horn constraint systems through a reduction based approach.
Theor. Comput. Sci.
K. Subramani, James Worthington
2015 J jnl
Identifying Negative Cost Cycles in Strongly Polynomial Space.
Nord. J. Comput.
Natarajan Shankar, K. Subramani, Pavlos Eirinakis
2015 C conf
On Clustering Without Replication in Combinatorial Circuits.
COCOA
Zola Donovan, Vahan Mkrtchyan, K. Subramani
2015 J jnl
On the approximability of the Largest Sphere Rule Ensemble Classification problem.
Inf. Process. Lett.
Vahan Mkrtchyan, K. Subramani
2015 J jnl
On the negative cost girth problem in planar networks.
J. Discrete Algorithms
Matthew D. Williamson, K. Subramani
2014 J jnl
Clustering without replication: approximation and inapproximability.
CoRR
Zola Donovan, Vahan Mkrtchyan, K. Subramani
2014 J jnl
On Certifying Instances of Zero-Clairvoyant Scheduling.
Comput. J.
K. Subramani, James Worthington
2014 — conf
On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs.
IFIP TCS
Bugra Çaskurlu, Vahan Mkrtchyan, Ojas Parekh, K. Subramani
2014 J jnl
On quantified linear implications.
Ann. Math. Artif. Intell.
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski
2014 J jnl
On the complexity of quantified linear systems.
Theor. Comput. Sci.
Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani, Piotr Wojciechowski
2014 Misc conf
Variants of Quantified Linear Programming and Quantified Linear Implication.
ISAIM
Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani
2013 J jnl
A combinatorial algorithm for Horn programs.
Discret. Optim.
R. Chandrasekaran, K. Subramani
2013 J jnl
Analytical models for risk-based intrusion response.
Comput. Networks
Bugra Çaskurlu, Ashish Gehani, Cemal Çagatay Bilgin, K. Subramani
2013 J jnl
Improved algorithms for optimal length resolution refutation in difference constraint systems.
Formal Aspects Comput.
K. Subramani, Matthew D. Williamson, Xiaofeng Gu
2013 J jnl
On Partial Vertex Cover on Bipartite Graphs and Trees
CoRR
Bugra Çaskurlu, K. Subramani
2013 J jnl
Polynomial time certifying algorithms for the planar quantified integer programming problem.
J. Log. Comput.
Z. Liang, K. Subramani, James Worthington
2012 J jnl
A complexity perspective on entailment of parameterized linear constraints.
Constraints An Int. J.
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski
2012 Misc conf
Computational complexity of inclusion queries over polyhedral sets.
ISAIM
Pavlos Eirinakis, Salvatore Ruggieri, K. Subramani, Piotr Wojciechowski
2011 B conf
A New Algorithm for Linear and Integer Feasibility in Horn Constraints.
CPAIOR
K. Subramani, James Worthington
2011 J jnl
A mechanical verification of the stressing algorithm for negative cost cycle detection in networks.
Sci. Comput. Program.
Natarajan Shankar, K. Subramani
2011 J jnl
Absorbing random walks and the NAE2SAT problem.
Int. J. Comput. Math.
K. Subramani, Xiaofeng Gu
2011 — conf
Algorithmic Aspects of Risk Management.
Formal Modeling: Actors, Open Systems, Biological Systems
Ashish Gehani, Lee Zaniewski, K. Subramani
2010 J jnl
A faster algorithm for the single source shortest path problem with few distinct positive lengths.
J. Discrete Algorithms
James B. Orlin, Kamesh Madduri, K. Subramani, Matthew D. Williamson
2010 J jnl
Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm.
Appl. Math. Comput.
K. Subramani, C. Tauras, Kamesh Madduri
2010 J jnl
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem.
Computing
K. Subramani, Kamesh Madduri
2009 B conf
A Combinatorial Algorithm for Horn Programs.
ISAAC
R. Chandrasekaran, K. Subramani
2009 Misc conf
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.
FAW
Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai
2009 J jnl
On memoryless provers and insincere verifiers.
J. Exp. Theor. Artif. Intell.
K. Subramani
2009 J jnl
On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls.
Adv. Decis. Sci.
K. Subramani
2009 J jnl
Optimal Length Resolution Refutations of Difference Constraint Systems.
J. Autom. Reason.
K. Subramani
2009 J jnl
Random walks for selected boolean implication and equivalence problems.
Acta Informatica
K. Subramani, Hong-Jian Lai, Xiaofeng Gu
2009 C conf
Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem.
COCOA
K. Subramani, Kamesh Madduri
2008 J jnl
A Randomized Queueless Algorithm for Breadth-First Search.
Int. J. Comput. Their Appl.
K. Subramani, Kamesh Madduri
2008 Misc conf
Absorbing Random Walks and the NAE2SAT Problem.
FAW
K. Subramani
2008 J jnl
Computing inversion pair cardinality through partition-based sorting.
Computing
K. Subramani
2008 J jnl
Distributed algorithms for partially clairvoyant dispatchers.
Clust. Comput.
K. Subramani, Kiran Yellajyosula, Ashraf M. Osman
2008 J jnl
Fault Tolerant Sorting - Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm.
J. Math. Model. Algorithms
K. Subramani, C. Tauras, David Owen
2008 J jnl
On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers.
Int. J. Parallel Program.
K. Subramani, Kiran Yellajyosula
2007 C conf
A Randomized Algorithm for BBCSPs in the Prover-Verifier Model.
ICTAC
K. Subramani
2007 J jnl
A Zero-Space algorithm for Negative Cost Cycle Detection in networks.
J. Discrete Algorithms
K. Subramani
2007 J jnl
A polynomial time algorithm for Zero-Clairvoyant scheduling.
J. Appl. Log.
K. Subramani
2007 Misc conf
Accomplishing Approximate FCFS Fairness Without Queues.
HiPC
K. Subramani, Kamesh Madduri
2007 J jnl
An empirical analysis of algorithms for partially Clairvoyant scheduling.
Int. J. Parallel Emergent Distributed Syst.
K. Subramani, Dejan Desovski
2007 J jnl
Boolean Functions as Models for Quantified Boolean Formulas.
J. Autom. Reason.
Hans Kleine Büning, K. Subramani, Xishun Zhao
2007 J jnl
On Solving Boolean Combinations of UTVPI Constraints.
J. Satisf. Boolean Model. Comput.
Sanjit A. Seshia, K. Subramani, Randal E. Bryant
2007 J jnl
On a decision procedure for quantified linear programs.
Ann. Math. Artif. Intell.
K. Subramani
2006 J jnl
An approximation algorithm for state minimization in 2-MDFAs.
Formal Aspects Comput.
K. Subramani, C. Tauras
2006 C conf
Analyzing Chain Programs over Difference Constraints.
TAMC
K. Subramani, John Argentieri
2006 J jnl
Chain Programming over Difference Constraints.
Nord. J. Comput.
K. Subramani, John Argentieri
2006 J jnl
On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection.
Appl. Math. Comput.
K. Subramani, Dejan Desovski
2006 J jnl
On using priced timed automata to achieve optimal scheduling.
Formal Methods Syst. Des.
Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani
2006 B conf
Totally Clairvoyant Scheduling with Relative Timing Constraints.
VMCAI
K. Subramani
2005 J jnl
A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling.
Comput. J.
K. Subramani
2005 — conf
A New Verification Procedure for Partially Clairvoyant Scheduling.
FORMATS
K. Subramani, Dejan Desovski
2005 J jnl
A greedy strategy for detecting negative cost cycles in networks.
Future Gener. Comput. Syst.
K. Subramani, Lisa Kovalchick
2005 J jnl
An Analysis of Totally Clairvoyant Scheduling.
J. Sched.
K. Subramani
2005 J jnl
Cascading random walks.
Int. J. Found. Comput. Sci.
K. Subramani
2005 J jnl
Erratum: An Analysis of Totally Clairvoyant Scheduling.
J. Sched.
K. Subramani
2005 Misc conf
On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks.
International Conference on Computational Science (1)
K. Subramani, Dejan Desovski
2005 J jnl
Out of order quantifier elimination for Standard Quantified Linear Programs.
J. Symb. Comput.
K. Subramani, Dejan Desovski
2005 J jnl
Partially clairvoyant scheduling for aggregate constraints.
Adv. Decis. Sci.
K. Subramani
2005 J jnl
Periodic Linear Programming with applications to real-time scheduling.
Math. Struct. Comput. Sci.
K. Subramani
2005 — conf
Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks.
ADHOC-NOW
K. Subramani
2005 J jnl
Tractable Fragments of Presburger Arithmetic.
Theory Comput. Syst.
K. Subramani
2004 Misc conf
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers.
HiPC
K. Subramani, Kiran Yellajyosula
2004 A conf
Analyzing Selected Quantified Integer Programs.
IJCAR
K. Subramani
2004 A conf
Distributed Algorithms for Partially Clairvoyant Dispatchers.
IPDPS
K. Subramani, Kiran Yellajyosula, Ashraf M. Osman
2004 J jnl
On deciding the non-emptiness of 2SAT polytopes with respect to First Order Queries.
Math. Log. Q.
K. Subramani
2004 J jnl
Optimal length tree-like resolution refutations for 2SAT formulas.
ACM Trans. Comput. Log.
K. Subramani
2004 A conf
Resource-Optimal Scheduling Using Priced Timed Automata.
TACAS
Jacob Illum Rasmussen, Kim Guldstrand Larsen, K. Subramani
2004 — conf
Zero-Clairvoyant Scheduling with Inter-period Constraints.
ASIAN
K. Subramani
2003 J jnl
An Analysis of Partially Clairvoyant Scheduling.
J. Math. Model. Algorithms
K. Subramani
2003 — conf
An Analysis of Quantified Linear Programs.
DMTCS
K. Subramani
2003 Misc conf
Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem.
International Conference on Computational Science
K. Subramani, Lisa Kovalchick
2003 A conf
On Boolean Models for Quantified Boolean Horn Formulas.
SAT
Hans Kleine Büning, K. Subramani, Xishun Zhao
2003 — conf
On Clausal Equivalence and Hull Inclusion.
ICTCS
K. Subramani
2002 B conf
A Specification Framework for Real-Time Scheduling.
SOFSEM
K. Subramani
2002 A conf
An Analysis of Zero-Clairvoyant Scheduling.
TACAS
K. Subramani
2002 — conf
On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas.
ASIAN
K. Subramani
2002 Misc conf
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope.
AISC
K. Subramani
2001 J jnl
A polyhedral projection procedure for Q2SAT.
Electron. Notes Discret. Math.
K. Subramani
2001 Misc conf
Parametric Scheduling - Algorithms and Complexity.
HiPC
K. Subramani
2001 Misc conf
Parametric Scheduling for Network Constraints.
COCOON
K. Subramani
2000 — conf
A Dual Interpretation of "Standard Constraints" in Parametric Scheduling.
FTRTFT
K. Subramani, Ashok K. Agrawala