K. Subramani
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
DEBUG first row: length=10 | [1]=https://portal.mardi4nfdi.de/wiki/Public | [2]=The hexatope and octatope abstract domai | [3]=https://portal.mardi4nfdi.de/entity/Q666 | [4]=2025-01-13 | [5]=Q6661753 | [6]=https://portal.mardi4nfdi.de/entity/Q597 | [7]=Paper | [8]=7965961 | [9]=Formal Methods in System Design | [10]=
| Publication | Date of Publication | Type |
|---|---|---|
| The hexatope and octatope abstract domains for neural network verification Formal Methods in System Design row10= | journal=Formal Methods in System Design | arxivId= | 2025-01-13 | Paper |
| Constrained read-once refutations in UTVPI constraint systems: a parallel perspective Mathematical Structures in Computer Science row10= | journal=Mathematical Structures in Computer Science | arxivId= | 2024-10-16 | Paper |
| Differentiable discrete optimization using dataless neural networks row10= | journal= | arxivId= | 2024-09-16 | Paper |
| Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints row10= | journal= | arxivId= | 2024-09-16 | Paper |
| Arc-dependent networks: theoretical insights and a computational study Annals of Operations Research row10= | journal=Annals of Operations Research | arxivId= | 2024-08-15 | Paper |
| Proving the infeasibility of Horn formulas through read-once resolution Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2024-06-20 | Paper |
| Approximation algorithms for partial vertex covers in trees International Journal of Foundations of Computer Science row10= | journal=International Journal of Foundations of Computer Science | arxivId= | 2024-06-13 | Paper |
| Farkas Bounds on Horn Constraint Systems Theory of Computing Systems row10= | journal=Theory of Computing Systems | arxivId= | 2024-04-21 | Paper |
| Security-aware database migration planning Constraints row10= | journal=Constraints | arxivId= | 2024-02-14 | Paper |
| Priority-based bin packing with subset constraints Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2024-01-24 | Paper |
| The octatope abstract domain for verification of neural networks Formal Methods row10= | journal=Formal Methods | arxivId= | 2023-08-17 | Paper |
| A faster algorithm for determining the linear feasibility of systems of BTVPI constraints Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2023-08-14 | Paper |
| On the parallel complexity of constrained read-once refutations in UTVPI constraint systems Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2023-08-04 | Paper |
| Reachability problems in interval-constrained and cardinality-constrained graphs Discrete Mathematics, Algorithms and Applications row10= | journal=Discrete Mathematics, Algorithms and Applications | arxivId= | 2023-07-15 | Paper |
| Reachability in choice networks Discrete Optimization row10= | journal=Discrete Optimization | arxivId= | 2023-06-30 | Paper |
| Optimal deterministic controller synthesis from steady-state distributions Journal of Automated Reasoning row10= | journal=Journal of Automated Reasoning | arxivId= | 2023-06-14 | Paper |
| On the approximability of path and cycle problems in arc-dependent networks Algorithms and Discrete Applied Mathematics row10= | journal=Algorithms and Discrete Applied Mathematics | arxivId= | 2023-05-08 | Paper |
| Integer feasibility and refutations in UTVPI constraints using bit-scaling Algorithmica row10= | journal=Algorithmica | arxivId= | 2023-02-16 | Paper |
| scientific article; zbMATH DE number 7650340 (Why is no real title available?) row10= | journal= | arxivId= | 2023-02-03 | Paper |
| Read-once refutations in Horn constraint systems: an algorithmic approach Journal Of Logic And Computation row10= | journal=Journal Of Logic And Computation | arxivId= | 2022-09-22 | Paper |
| Analyzing the reachability problem in choice networks row10= | journal= | arxivId= | 2022-08-30 | Paper |
| Exact and parameterized algorithms for read-once refutations in Horn constraint systems row10= | journal= | arxivId= | 2022-07-01 | Paper |
| Analyzing read-once cutting plane proofs in Horn systems Journal of Automated Reasoning row10= | journal=Journal of Automated Reasoning | arxivId= | 2022-06-09 | Paper |
| On the complexity of and solutions to the minimum stopping and trapping set problems Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2022-05-31 | Paper |
| Algorithmic analysis of priority-based bin packing row10= | journal= | arxivId= | 2022-03-24 | Paper |
| On the copy complexity of width 3 Horn constraint systems row10= | journal= | arxivId= | 2022-03-24 | Paper |
| Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas Annals of Mathematics and Artificial Intelligence row10= | journal=Annals of Mathematics and Artificial Intelligence | arxivId= | 2022-02-14 | Paper |
| Analyzing unit read-once refutations in difference constraint systems row10= | journal= | arxivId= | 2021-12-01 | Paper |
| Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2021-10-21 | Paper |
| Copy complexity of Horn formulas with respect to unit read-once resolution Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2021-10-21 | Paper |
| Tree-like unit refutations in Horn constraint systems row10= | journal= | arxivId= | 2021-10-04 | Paper |
| Analyzing clustering and partitioning problems in selected VLSI models Theory of Computing Systems row10= | journal=Theory of Computing Systems | arxivId= | 2021-06-11 | Paper |
| On finding shortest paths in arc-dependent networks row10= | journal= | arxivId= | 2021-02-04 | Paper |
| NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability Mathematical Structures in Computer Science row10= | journal=Mathematical Structures in Computer Science | arxivId= | 2021-01-07 | Paper |
| Analyzing fractional Horn constraint systems Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2020-10-21 | Paper |
| Optimal length tree-like refutations of linear feasibility in UTVPI constraints row10= | journal= | arxivId= | 2020-07-07 | Paper |
| Restricted cutting plane proofs in Horn constraint systems row10= | journal= | arxivId= | 2020-05-13 | Paper |
| Disjoint clustering in combinatorial circuits row10= | journal= | arxivId= | 2020-02-25 | Paper |
| Read-once certification of linear infeasibility in UTVPI constraints row10= | journal= | arxivId= | 2019-10-15 | Paper |
| Read-once resolutions in Horn formulas row10= | journal= | arxivId= | 2019-10-11 | Paper |
| The complexity of finding read-once NAE-resolution refutations Logic and Its Applications row10= | journal=Logic and Its Applications | arxivId= | 2019-07-24 | Paper |
| Clustering without replication in combinatorial circuits Journal of Combinatorial Optimization row10= | journal=Journal of Combinatorial Optimization | arxivId= | 2019-06-25 | Paper |
| A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints Algorithmica row10= | journal=Algorithmica | arxivId= | 2019-05-21 | Paper |
| Finding minimum stopping and trapping sets: an integer linear programming approach row10= | journal= | arxivId= | 2018-08-17 | Paper |
| On approximating optimal weight ``no-certificates in weighted difference constraint systems Journal of Combinatorial Optimization row10= | journal=Journal of Combinatorial Optimization | arxivId= | 2018-07-20 | Paper |
| A fully polynomial time approximation scheme for refutations in weighted difference constraint systems row10= | journal= | arxivId= | 2018-06-05 | Paper |
| Finding read-once resolution refutations in systems of 2CNF clauses Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2018-05-17 | Paper |
| A certifying algorithm for lattice point feasibility in a system of UTVPI constraints Journal of Combinatorial Optimization row10= | journal=Journal of Combinatorial Optimization | arxivId= | 2018-03-01 | Paper |
| Randomized algorithms for finding the shortest negative cost cycle in networks Discrete Applied Mathematics row10= | journal=Discrete Applied Mathematics | arxivId= | 2018-01-11 | Paper |
| Partial vertex cover and budgeted maximum coverage in bipartite graphs SIAM Journal on Discrete Mathematics row10= | journal=SIAM Journal on Discrete Mathematics | arxivId= | 2017-09-27 | Paper |
| On a generalization of Horn constraint systems row10= | journal= | arxivId= | 2017-08-22 | Paper |
| Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic Annals of Mathematics and Artificial Intelligence row10= | journal=Annals of Mathematics and Artificial Intelligence | arxivId= | 2017-07-19 | Paper |
| On the computational complexity of read once resolution decidability in 2CNF formulas Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2017-05-19 | Paper |
| A combinatorial certifying algorithm for linear feasibility in UTVPI constraints Algorithmica row10= | journal=Algorithmica | arxivId= | 2017-05-11 | Paper |
| On the Shoshan-Zwick algorithm for the all-pairs shortest path problem Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2017-04-05 | Paper |
| The approximability of partial vertex covers in trees SOFSEM 2017: Theory and Practice of Computer Science row10= | journal=SOFSEM 2017: Theory and Practice of Computer Science | arxivId= | 2017-04-04 | Paper |
| Analyzing restricted fragments of the theory of linear arithmetic Annals of Mathematics and Artificial Intelligence row10= | journal=Annals of Mathematics and Artificial Intelligence | arxivId= | 2017-03-06 | Paper |
| Corrigendum to: ``On the negative cost girth problem in planar networks Journal of Discrete Algorithms row10= | journal=Journal of Discrete Algorithms | arxivId= | 2016-12-09 | Paper |
| A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2016-09-29 | Paper |
| Identifying negative cost cycles in strongly polynomial space row10= | journal= | arxivId= | 2016-07-20 | Paper |
| An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints WALCOM: Algorithms and Computation row10= | journal=WALCOM: Algorithms and Computation | arxivId= | 2016-05-03 | Paper |
| Compositional bisimulation minimization for interval Markov decision processes Language and Automata Theory and Applications row10= | journal=Language and Automata Theory and Applications | arxivId= | 2016-04-13 | Paper |
| Fast algorithms for the undirected negative cost cycle detection problem Algorithmica row10= | journal=Algorithmica | arxivId= | 2016-03-23 | Paper |
| A Graphical Theorem of the Alternative for UTVPI Constraints Theoretical Aspects of Computing - ICTAC 2015 row10= | journal=Theoretical Aspects of Computing - ICTAC 2015 | arxivId= | 2016-02-25 | Paper |
| On clustering without replication in combinatorial circuits Combinatorial Optimization and Applications row10= | journal=Combinatorial Optimization and Applications | arxivId= | 2016-02-05 | Paper |
| On the negative cost girth problem in planar networks Journal of Discrete Algorithms row10= | journal=Journal of Discrete Algorithms | arxivId= | 2015-11-17 | Paper |
| On the approximability of the largest sphere rule ensemble classification problem Information Processing Letters row10= | journal=Information Processing Letters | arxivId= | 2015-07-15 | Paper |
| Feasibility checking in Horn constraint systems through a reduction based approach Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2015-05-18 | Paper |
| A new algorithm for the minimum spanning tree verification problem Computational Optimization and Applications row10= | journal=Computational Optimization and Applications | arxivId= | 2015-04-20 | Paper |
| On quantified linear implications Annals of Mathematics and Artificial Intelligence row10= | journal=Annals of Mathematics and Artificial Intelligence | arxivId= | 2015-02-05 | Paper |
| A complexity perspective on entailment of parameterized linear constraints Constraints row10= | journal=Constraints | arxivId= | 2015-01-22 | Paper |
| On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs Advanced Information Systems Engineering row10= | journal=Advanced Information Systems Engineering | arxivId= | 2014-09-15 | Paper |
| A combinatorial algorithm for Horn programs Discrete Optimization row10= | journal=Discrete Optimization | arxivId= | 2014-04-15 | Paper |
| On the complexity of quantified linear systems Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2014-01-13 | Paper |
| Improved algorithms for optimal length resolution refutation in difference constraint systems Formal Aspects of Computing row10= | journal=Formal Aspects of Computing | arxivId= | 2013-03-22 | Paper |
| A new algorithm for linear and integer feasibility in Horn constraints Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems row10= | journal=Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | arxivId= | 2011-05-26 | Paper |
| A mechanical verification of the stressing algorithm for negative cost cycle detection in networks Science of Computer Programming row10= | journal=Science of Computer Programming | arxivId= | 2011-05-04 | Paper |
| Absorbing random walks and the NAE2SAT problem International Journal of Computer Mathematics row10= | journal=International Journal of Computer Mathematics | arxivId= | 2011-04-06 | Paper |
| Two-level heaps: a new priority queue structure with applications to the single source shortest path problem Computing row10= | journal=Computing | arxivId= | 2010-11-23 | Paper |
| A faster algorithm for the single source shortest path problem with few distinct positive lengths Journal of Discrete Algorithms row10= | journal=Journal of Discrete Algorithms | arxivId= | 2010-05-25 | Paper |
| On clausal equivalence and hull inclusion. Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2010-02-23 | Paper |
| Space-time tradeoffs in negative cycle detection - an empirical analysis of the stressing algorithm Applied Mathematics and Computation row10= | journal=Applied Mathematics and Computation | arxivId= | 2010-02-09 | Paper |
| Optimal length resolution refutations of difference constraint systems Journal of Automated Reasoning row10= | journal=Journal of Automated Reasoning | arxivId= | 2010-02-01 | Paper |
| A combinatorial algorithm for Horn programs Algorithms and Computation row10= | journal=Algorithms and Computation | arxivId= | 2009-12-17 | Paper |
| On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls Journal of Applied Mathematics and Decision Sciences row10= | journal=Journal of Applied Mathematics and Decision Sciences | arxivId= | 2009-11-23 | Paper |
| On memoryless provers and insincere verifiers Journal of Experimental & Theoretical Artificial Intelligence row10= | journal=Journal of Experimental & Theoretical Artificial Intelligence | arxivId= | 2009-10-29 | Paper |
| Theory and Applications of Satisfiability Testing Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2009-07-24 | Paper |
| Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs Frontiers in Algorithmics row10= | journal=Frontiers in Algorithmics | arxivId= | 2009-07-14 | Paper |
| Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem Combinatorial Optimization and Applications row10= | journal=Combinatorial Optimization and Applications | arxivId= | 2009-07-07 | Paper |
| Random walks for selected Boolean implication and equivalence problems Acta Informatica row10= | journal=Acta Informatica | arxivId= | 2009-04-27 | Paper |
| Partially clairvoyant scheduling for aggregate constraints Journal of Applied Mathematics and Decision Sciences row10= | journal=Journal of Applied Mathematics and Decision Sciences | arxivId= | 2008-11-20 | Paper |
| A Randomized Algorithm for BBCSPs in the Prover-Verifier Model Theoretical Aspects of Computing – ICTAC 2007 row10= | journal=Theoretical Aspects of Computing – ICTAC 2007 | arxivId= | 2008-09-17 | Paper |
| On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers International Journal of Parallel Programming row10= | journal=International Journal of Parallel Programming | arxivId= | 2008-09-02 | Paper |
| A polynomial time algorithm for Zero-Clairvoyant scheduling Journal of Applied Logic row10= | journal=Journal of Applied Logic | arxivId= | 2008-03-11 | Paper |
| A zero-space algorithm for negative cost cycle detection in networks Journal of Discrete Algorithms row10= | journal=Journal of Discrete Algorithms | arxivId= | 2008-01-11 | Paper |
| An analysis of totally clairvoyant scheduling Journal of Scheduling row10= | journal=Journal of Scheduling | arxivId= | 2007-12-20 | Paper |
| On a decision procedure for quantified linear programs Annals of Mathematics and Artificial Intelligence row10= | journal=Annals of Mathematics and Artificial Intelligence | arxivId= | 2007-12-03 | Paper |
| An empirical analysis of algorithms for partially Clairvoyant scheduling International Journal of Parallel, Emergent and Distributed Systems row10= | journal=International Journal of Parallel, Emergent and Distributed Systems | arxivId= | 2007-10-24 | Paper |
| Out of order quantifier elimination for standard quantified linear programs Journal of Symbolic Computation row10= | journal=Journal of Symbolic Computation | arxivId= | 2007-10-19 | Paper |
| On solving Boolean combinations of UTVPI constraints. row10= | journal= | arxivId= | 2007-10-09 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2007-09-28 | Paper |
| Automated Reasoning Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2007-09-25 | Paper |
| scientific article; zbMATH DE number 5182607 (Why is no real title available?) row10= | journal= | arxivId= | 2007-08-24 | Paper |
| Boolean functions as models for quantified Boolean formulas Journal of Automated Reasoning row10= | journal=Journal of Automated Reasoning | arxivId= | 2007-08-17 | Paper |
| Erratum: An analysis of totally clairvoyant scheduling Journal of Scheduling row10= | journal=Journal of Scheduling | arxivId= | 2007-05-15 | Paper |
| Theory and Applications of Models of Computation Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2007-04-30 | Paper |
| Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2007-02-12 | Paper |
| An approximation algorithm for state minimization in 2-MDFAs Formal Aspects of Computing row10= | journal=Formal Aspects of Computing | arxivId= | 2006-12-20 | Paper |
| On using priced timed automata to achieve optimal scheduling Formal Methods in System Design row10= | journal=Formal Methods in System Design | arxivId= | 2006-11-17 | Paper |
| Formal Modeling and Analysis of Timed Systems Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2006-11-14 | Paper |
| On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection Applied Mathematics and Computation row10= | journal=Applied Mathematics and Computation | arxivId= | 2006-05-16 | Paper |
| Tractable fragments of Presburger arithmetic Theory of Computing Systems row10= | journal=Theory of Computing Systems | arxivId= | 2006-02-08 | Paper |
| Computational Science – ICCS 2005 Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2005-11-30 | Paper |
| Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2005-08-17 | Paper |
| CASCADING RANDOM WALKS International Journal of Foundations of Computer Science row10= | journal=International Journal of Foundations of Computer Science | arxivId= | 2005-08-01 | Paper |
| Periodic Linear Programming with applications to real-time scheduling Mathematical Structures in Computer Science row10= | journal=Mathematical Structures in Computer Science | arxivId= | 2005-05-06 | Paper |
| scientific article; zbMATH DE number 2090050 (Why is no real title available?) row10= | journal= | arxivId= | 2004-08-12 | Paper |
| On deciding the non‐emptiness of 2SAT polytopes with respect to First Order Queries Mathematical Logic Quarterly row10= | journal=Mathematical Logic Quarterly | arxivId= | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080043 (Why is no real title available?) row10= | journal= | arxivId= | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080869 (Why is no real title available?) row10= | journal= | arxivId= | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2040956 (Why is no real title available?) row10= | journal= | arxivId= | 2004-02-11 | Paper |
| An analysis of partially Clairvoyant scheduling JMMA. Journal of Mathematical Modelling and Algorithms row10= | journal=JMMA. Journal of Mathematical Modelling and Algorithms | arxivId= | 2003-09-07 | Paper |
| scientific article; zbMATH DE number 1955763 (Why is no real title available?) row10= | journal= | arxivId= | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1798173 (Why is no real title available?) row10= | journal= | arxivId= | 2002-11-04 | Paper |
| Analysis and simulation of mixed-technology VLSI systems Journal of Parallel and Distributed Computing row10= | journal=Journal of Parallel and Distributed Computing | arxivId= | 2002-09-12 | Paper |
| scientific article; zbMATH DE number 1696503 (Why is no real title available?) row10= | journal= | arxivId= | 2002-06-17 | Paper |
| A polyhedral projection procedure for Q2SAT row10= | journal= | arxivId= | 2001-09-24 | Paper |
Research outcomes over time
This page was built for person: K. Subramani
