# K. Subramani

According to our database

Collaborative distances:

^{1}, K. Subramani authored at least 113 papers between 2000 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2018

Finding read-once resolution refutations in systems of 2CNF clauses.

Theor. Comput. Sci., 2018

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

J. Comb. Optim., 2018

On approximating optimal weight "no"-certificates in weighted difference constraint systems.

J. Comb. Optim., 2018

Randomized algorithms for finding the shortest negative cost cycle in networks.

Discrete Applied Mathematics, 2018

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

Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

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

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

2017

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs.

SIAM J. Discrete Math., 2017

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.

J. Graph Algorithms Appl., 2017

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

Ann. Math. Artif. Intell., 2017

Analyzing restricted fragments of the theory of linear arithmetic.

Ann. Math. Artif. Intell., 2017

A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints.

Algorithmica, 2017

On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas.

Proceedings of the Theory and Applications of Models of Computation, 2017

The Approximability of Partial Vertex Covers in Trees.

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

The Complexity of Finding Read-Once NAE-Resolution Refutations.

Proceedings of the Logic and Its Applications - 7th Indian Conference, 2017

On a Generalization of Horn Constraint Systems.

Proceedings of the Computer Science - Theory and Applications, 2017

Analyzing Lattice Point Feasibility in UTVPI Constraints.

Proceedings of the Principles and Practice of Constraint Programming, 2017

2016

Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50].

J. Discrete Algorithms, 2016

On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.

CoRR, 2016

On the computational complexity of read once resolution decidability in 2CNF formulas.

CoRR, 2016

Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem.

Algorithmica, 2016

An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints.

Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

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

Proceedings of the 15th IEEE International Symposium on Network Computing and Applications, 2016

Compositional Bisimulation Minimization for Interval Markov Decision Processes.

Proceedings of the Language and Automata Theory and Applications, 2016

A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints.

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

On the computational complexities of Quantified Integer Programming variants.

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015

Feasibility checking in Horn constraint systems through a reduction based approach.

Theor. Comput. Sci., 2015

Identifying Negative Cost Cycles in Strongly Polynomial Space.

Nord. J. Comput., 2015

On the negative cost girth problem in planar networks.

J. Discrete Algorithms, 2015

On the approximability of the Largest Sphere Rule Ensemble Classification problem.

Inf. Process. Lett., 2015

A Parallel Implementation for the Negative Cost Girth Problem.

International Journal of Parallel Programming, 2015

A new algorithm for the minimum spanning tree verification problem.

Comp. Opt. and Appl., 2015

A Graphical Theorem of the Alternative for UTVPI Constraints.

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

On Clustering Without Replication in Combinatorial Circuits.

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

On the complexity of quantified linear systems.

Theor. Comput. Sci., 2014

Clustering without replication: approximation and inapproximability.

CoRR, 2014

On Certifying Instances of Zero-Clairvoyant Scheduling.

Comput. J., 2014

On quantified linear implications.

Ann. Math. Artif. Intell., 2014

Variants of Quantified Linear Programming and Quantified Linear Implication.

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

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

Proceedings of the Theoretical Computer Science, 2014

2013

Polynomial time certifying algorithms for the planar quantified integer programming problem.

J. Log. Comput., 2013

Improved algorithms for optimal length resolution refutation in difference constraint systems.

Formal Asp. Comput., 2013

A combinatorial algorithm for Horn programs.

Discrete Optimization, 2013

On Partial Vertex Cover on Bipartite Graphs and Trees

CoRR, 2013

Analytical models for risk-based intrusion response.

Computer Networks, 2013

2012

A complexity perspective on entailment of parameterized linear constraints.

Constraints, 2012

Computational complexity of inclusion queries over polyhedral sets.

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

2011

A mechanical verification of the stressing algorithm for negative cost cycle detection in networks.

Sci. Comput. Program., 2011

Absorbing random walks and the NAE2SAT problem.

Int. J. Comput. Math., 2011

A New Algorithm for Linear and Integer Feasibility in Horn Constraints.

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Algorithmic Aspects of Risk Management.

Proceedings of the Formal Modeling: Actors, Open Systems, Biological Systems, 2011

2010

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

J. Discrete Algorithms, 2010

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

Computing, 2010

Space-time tradeoffs in negative cycle detection - An empirical analysis of the Stressing Algorithm.

Applied Mathematics and Computation, 2010

2009

On memoryless provers and insincere verifiers.

J. Exp. Theor. Artif. Intell., 2009

Optimal Length Resolution Refutations of Difference Constraint Systems.

J. Autom. Reasoning, 2009

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

JAMDS, 2009

Random walks for selected boolean implication and equivalence problems.

Acta Inf., 2009

A Combinatorial Algorithm for Horn Programs.

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem.

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Fault Tolerant Sorting - Theoretical and Empirical Analyses of the Randomized QuickMergesort Algorithm.

J. Math. Model. Algorithms, 2008

A Randomized Queueless Algorithm for Breadth-First Search.

I. J. Comput. Appl., 2008

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

International Journal of Parallel Programming, 2008

Computing inversion pair cardinality through partition-based sorting.

Computing, 2008

Distributed algorithms for partially clairvoyant dispatchers.

Cluster Computing, 2008

Absorbing Random Walks and the NAE2SAT Problem.

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

2007

An empirical analysis of algorithms for partially Clairvoyant scheduling.

IJPEDS, 2007

On Solving Boolean Combinations of UTVPI Constraints.

JSAT, 2007

A Zero-Space algorithm for Negative Cost Cycle Detection in networks.

J. Discrete Algorithms, 2007

Boolean Functions as Models for Quantified Boolean Formulas.

J. Autom. Reasoning, 2007

A polynomial time algorithm for Zero-Clairvoyant scheduling.

J. Applied Logic, 2007

On a decision procedure for quantified linear programs.

Ann. Math. Artif. Intell., 2007

A Randomized Algorithm for BBCSPs in the Prover-Verifier Model.

Proceedings of the Theoretical Aspects of Computing, 2007

Accomplishing Approximate FCFS Fairness Without Queues.

Proceedings of the High Performance Computing, 2007

2006

Chain Programming over Difference Constraints.

Nord. J. Comput., 2006

On using priced timed automata to achieve optimal scheduling.

Formal Methods in System Design, 2006

An approximation algorithm for state minimization in 2-MDFAs.

Formal Asp. Comput., 2006

On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection.

Applied Mathematics and Computation, 2006

Totally Clairvoyant Scheduling with Relative Timing Constraints.

Proceedings of the Verification, 2006

Analyzing Chain Programs over Difference Constraints.

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Erratum: An Analysis of Totally Clairvoyant Scheduling.

J. Scheduling, 2005

An Analysis of Totally Clairvoyant Scheduling.

J. Scheduling, 2005

Tractable Fragments of Presburger Arithmetic.

Theory Comput. Syst., 2005

Periodic Linear Programming with applications to real-time scheduling.

Mathematical Structures in Computer Science, 2005

Out of order quantifier elimination for Standard Quantified Linear Programs.

J. Symb. Comput., 2005

Partially clairvoyant scheduling for aggregate constraints.

JAMDS, 2005

Cascading random walks.

Int. J. Found. Comput. Sci., 2005

A greedy strategy for detecting negative cost cycles in networks.

Future Generation Comp. Syst., 2005

A Comprehensive Framework for Specifying Clairvoyance, Constraints and Periodicity in Real-Time Scheduling.

Comput. J., 2005

On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks.

Proceedings of the Computational Science, 2005

A New Verification Procedure for Partially Clairvoyant Scheduling.

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

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

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005

2004

Optimal length tree-like resolution refutations for 2SAT formulas.

ACM Trans. Comput. Log., 2004

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

Math. Log. Q., 2004

Resource-Optimal Scheduling Using Priced Timed Automata.

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

Distributed Algorithms for Partially Clairvoyant Dispatchers.

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers.

Proceedings of the High Performance Computing, 2004

Analyzing Selected Quantified Integer Programs.

Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

Zero-Clairvoyant Scheduling with Inter-period Constraints.

Proceedings of the Advances in Computer Science, 2004

2003

An Analysis of Partially Clairvoyant Scheduling.

J. Math. Model. Algorithms, 2003

On Boolean Models for Quantified Boolean Horn Formulas.

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

On Clausal Equivalence and Hull Inclusion.

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Contraction versus Relaxation: A Comparison of Two Approaches for the Negative Cost Cycle Detection Problem.

Proceedings of the Computational Science - ICCS 2003, 2003

An Analysis of Quantified Linear Programs.

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

An Analysis of Zero-Clairvoyant Scheduling.

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

A Specification Framework for Real-Time Scheduling.

Proceedings of the SOFSEM 2002: Theory and Practice of Informatics, 2002

On Determining the Minimum Length, Tree-Like Resolution Refutation of 2SAT, and Extended 2SAT Formulas.

Proceedings of the Advances in Computing Science, 2002

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

Proceedings of the Artificial Intelligence, 2002

2001

A polyhedral projection procedure for Q2SAT.

Electronic Notes in Discrete Mathematics, 2001

Parametric Scheduling - Algorithms and Complexity.

Proceedings of the High Performance Computing - HiPC 2001, 8th International Conference, 2001

Parametric Scheduling for Network Constraints.

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

A Dual Interpretation of "Standard Constraints" in Parametric Scheduling.

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2000