K. Subramani

Hans-Peter Kriegel, Irene Ntoutsi, Kumar Subramani, 2011, 2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application.

Copy complexity of Horn formulas with respect to unit read-once resolution

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2021, Theor. Comput. Sci..

A faster algorithm for the single source shortest path problem with few distinct positive lengths

K. Subramani, James B. Orlin, Kamesh Madduri, 2010, J. Discrete Algorithms.

On the Copy Complexity of Width 3 Horn Constraint Systems

K. Subramani, Alvaro Velasquez, Piotr J. Wojciechowski, 2021, FroCoS.

Analyzing Unit Read-Once Refutations in Difference Constraint Systems

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2021, JELIA.

On Finding Shortest Paths in Arc-Dependent Networks

K. Subramani, Piotr J. Wojciechowski, Matthew Williamson, 2020, ISCO.

Analytical models for risk-based intrusion response

K. Subramani, Bugra Caskurlu, Ashish Gehani, 2013, Comput. Networks.

On using priced timed automata to achieve optimal scheduling

Kim G. Larsen, K. Subramani, Jacob Illum Rasmussen, 2006, Formal Methods Syst. Des..

Analyzing Read-Once Cutting Plane Proofs in Horn Systems

P. Wojciechowski, K. Subramani, R. Chandrasekaran, 2022, Journal of Automated Reasoning.

Optimal Deterministic Controller Synthesis from Steady-State Distributions

George K. Atia, Ismail R. Alkhouri, P. Wojciechowski, 2023, Journal of Automated Reasoning.

Out of order quantifier elimination for Standard Quantified Linear Programs

K. Subramani, Dejan Desovski, K. Subramani, 2005, J. Symb. Comput..

Finding Minimum Stopping and Trapping Sets: An Integer Linear Programming Approach

K. Subramani, Alvaro Velasquez, Steven L. Drager, 2018, ISCO.

Proving the infeasibility of Horn formulas through read-once resolution

P. Wojciechowski, K. Subramani, 2023, Discrete Applied Mathematics.

Algorithmic Analysis of Priority-Based Bin Packing

K. Subramani, Alvaro Velasquez, Bugra Caskurlu, 2021, CALDAM.

Unit Read-once Refutations for Systems of Difference Constraints

P. Wojciechowski, K. Subramani, 2023, Theory of Computing Systems.

Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints

K. Subramani, Piotr Wojciechowski, Matthew Williamson, 2020, Discret. Appl. Math..

Analyzing fractional Horn constraint systems

Ramaswamy Chandrasekaran, Piotr J. Wojciechowski, K. Subramani, 2020, Theor. Comput. Sci..

On integer closure in a system of unit two variable per inequality constraints

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2020, Annals of Mathematics and Artificial Intelligence.

A Graphical Analysis of Integer Infeasibility in UTVPI Constraints

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2019, AI*IA.

Restricted Cutting Plane Proofs in Horn Constraint Systems

Hans Kleine Büning, Ramaswamy Chandrasekaran, Piotr J. Wojciechowski, 2019, FroCos.

A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2019, Algorithmica.

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints

K. Subramani, Piotr J. Wojciechowski, Matthew D. Williamson, 2018, FAW.

On a Generalization of Horn Constraint Systems

K. Subramani, Ramaswamy Chandrasekaran, Piotr J. Wojciechowski, 2017, CSR.

Compositional Bisimulation Minimization for Interval Markov Decision Processes

K. Subramani, Holger Hermanns, Lei Song, 2016, LATA.

A Graphical Theorem of the Alternative for UTVPI Constraints

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2015, ICTAC.

Polynomial time certifying algorithms for the planar quantified integer programming problem

K. Subramani, James Worthington, Z. Liang, 2013, J. Log. Comput..

Improved algorithms for optimal length resolution refutation in difference constraint systems

K. Subramani, Xiaofeng Gu, M. Williamson, 2013, Formal Aspects of Computing.

A combinatorial algorithm for Horn programs

K. Subramani, Ramaswamy Chandrasekaran, R. Chandrasekaran, 2009, Discret. Optim..

On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls

K. Subramani, K. Subramani, 2009, Adv. Decis. Sci..

On a decision procedure for quantified linear programs

K. Subramani, K. Subramani, 2007, Annals of Mathematics and Artificial Intelligence.

On Solving Boolean Combinations of UTVPI Constraints

K. Subramani, Sanjit A. Seshia, Randal E. Bryant, 2007, J. Satisf. Boolean Model. Comput..

Totally Clairvoyant Scheduling with Relative Timing Constraints

K. Subramani, K. Subramani, 2006, VMCAI.

Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks

K. Subramani, K. Subramani, 2005, ADHOC-NOW.

Tractable Fragments of Presburger Arithmetic

K. Subramani, K. Subramani, 2005, Theory of Computing Systems.

An Analysis of Totally Clairvoyant Scheduling

K. Subramani, K. Subramani, 2005, J. Sched..

Zero-Clairvoyant Scheduling with Inter-period Constraints

K. Subramani, K. Subramani, 2004, ASIAN.

Analyzing Selected Quantified Integer Programs

K. Subramani, K. Subramani, 2004, IJCAR.

On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries

K. Subramani, K. Subramani, 2004, Math. Log. Q..

An Analysis of Quantified Linear Programs

K. Subramani, K. Subramani, 2003, DMTCS.

An Analysis of Partially Clairvoyant Scheduling

K. Subramani, K. Subramani, 2003, J. Math. Model. Algorithms.

On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope

K. Subramani, K. Subramani, 2002, AISC.

Parametric Scheduling - Algorithms and Complexity

K. Subramani, K. Subramani, 2001, HiPC.

Parametric Scheduling for Network Constraints

K. Subramani, K. Subramani, 2001, COCOON.

A polyhedral projection procedure for Q2SAT

K. Subramani, K. Subramani, 2001, Electron. Notes Discret. Math..

A Dual Interpretation of "Standard Constraints" in Parametric Scheduling

K. Subramani, Ashok K. Agrawala, A. Agrawala, 2000, FTRTFT.

On the computational complexities of Quantified Integer Programming variants

K. Subramani, Pavlos Eirinakis, Piotr J. Wojciechowski, 2016, ISAIM.

Computational complexity of inclusion queries over polyhedral sets

K. Subramani, Salvatore Ruggieri, Pavlos Eirinakis, 2012, ISAIM.

A Polynomial-Time Algorithm for the Planar Quantified Integer Programming Problem

K. Subramani, Zhiyao Liang, K. Subramani, 2011 .

Disjoint Clustering in Combinatorial Circuits

K. Subramani, Vahan V. Mkrtchyan, Zola Donovan, 2019, IWOCA.

Clustering without replication in combinatorial circuits

K. Subramani, Gregory Gutin, Zola Donovan, 2019, Journal of Combinatorial Optimization.

Two-level heaps: a new priority queue structure with applications to the single source shortest path problem

K. Subramani, Kamesh Madduri, K. Subramani, 2009, Computing.

A Randomized Queueless Algorithm for Breadth-First Search

K. Subramani, Kamesh Madduri, K. Subramani, 2008, Int. J. Comput. Their Appl..

Security-Aware Database Migration Planning

K. Subramani, Bugra Caskurlu, Utku Umur Acikalin, 2019, ALGOCLOUD.

Read-Once Resolutions in Horn Formulas

Hans Kleine Büning, K. Subramani, Piotr J. Wojciechowski, 2019, FAW.

Empirical analysis of algorithms for the shortest negative cost cycle problem

K. Subramani, Matthew Williamson, Matthew Anderson, 2019, Discret. Appl. Math..

An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints

K. Subramani, Matthew Anderson, Piotr J. Wojciechowski, 2018, AAIM.

On approximating optimal weight “no”-certificates in weighted difference constraint systems

K. Subramani, Bugra Caskurlu, Vahan V. Mkrtchyan, 2018, J. Comb. Optim..

A certifying algorithm for lattice point feasibility in a system of UTVPI constraints

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2018, J. Comb. Optim..

A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2016, IWOCA.

An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints

K. Subramani, Piotr J. Wojciechowski, P. Wojciechowski, 2016, WALCOM.

A new algorithm for the minimum spanning tree verification problem

K. Subramani, Matthew D. Williamson, K. Subramani, 2015, Comput. Optim. Appl..

Optimal Length Resolution Refutations of Difference Constraint Systems

K. Subramani, K. Subramani, 2009, Journal of Automated Reasoning.

An approximation algorithm for state minimization in 2-MDFAs

K. Subramani, C. Tauras, K. Subramani, 2006, Formal Aspects of Computing.

A Specification Framework for Real-Time Scheduling

K. Subramani, K. Subramani, 2002, SOFSEM.

On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs

Ojas Parekh, K. Subramani, Bugra Caskurlu, 2014, IFIP TCS.

The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks

K. Subramani, Alvaro Velasquez, Sumit Kumar Jha, 2016, 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA).

On the negative cost girth problem in planar networks

K. Subramani, Matthew D. Williamson, K. Subramani, 2015, J. Discrete Algorithms.

Modeling Clairvoyance and Constraints in Real-Time Scheduling

K. Subramani, K. Subramani, West Virginia, 2014 .

Accomplishing Approximate FCFS Fairness Without Queues

K. Subramani, Kamesh Madduri, K. Subramani, 2007, HiPC.

An empirical analysis of algorithms for partially Clairvoyant scheduling

K. Subramani, Dejan Desovski, K. Subramani, 2007, Int. J. Parallel Emergent Distributed Syst..

A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers

K. Subramani, Kiran Yellajyosula, K. Subramani, 2004, HiPC.

Boolean Functions as Models for Quantified Boolean Formulas

Hans Kleine Büning, K. Subramani, Xishun Zhao, 2007, Journal of Automated Reasoning.

Erratum to: Analyzing restricted fragments of the theory of linear arithmetic

K. Subramani, Pavlos Eirinakis, Piotr J. Wojciechowski, 2017, Annals of Mathematics and Artificial Intelligence.

Analyzing restricted fragments of the theory of linear arithmetic

P. Wojciechowski, K. Subramani, Pavlos Eirinakis, 2017, Annals of Mathematics and Artificial Intelligence.

On the complexity of quantified linear systems

K. Subramani, Salvatore Ruggieri, Pavlos Eirinakis, 2014, Theor. Comput. Sci..

On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers

K. Subramani, Kiran Yellajyosula, K. Subramani, 2008, International Journal of Parallel Programming.

Distributed algorithms for partially clairvoyant dispatchers

K. Subramani, Kiran Yellajyosula, A. Osman, 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

Absorbing random walks and the NAE2SAT problem

Xiaofeng Gu, K. Subramani, K. Subramani, 2011, Int. J. Comput. Math..

Cascading random walks

K. SUBRAMANI, K. Subramani, 2005, Int. J. Found. Comput. Sci..

A combinatorial algorithm for Horn programs

K. Subramani, Ramaswamy Chandrasekaran, R. Chandrasekaran, 2013, Discret. Optim..

A Parallel Implementation for the Negative Cost Girth Problem

K. Subramani, Matthew D. Williamson, K. Subramani, 2014, International Journal of Parallel Programming.

A New Algorithm for Linear and Integer Feasibility in Horn Constraints

K. Subramani, James Worthington, K. Subramani, 2011, CPAIOR.

Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems

K. Subramani, Piotr Wojciechowski, P. Wojciechowski, 2021, LFCS.

Feasibility checking in Horn constraint systems through a reduction based approach

K. Subramani, James Worthington, K. Subramani, 2015, Theor. Comput. Sci..