Computational complexity of inclusion queries over polyhedral sets. - Pavlos Eirinakis; Salvatore Ruggieri; K. Subramani 001; Piotr Wojciechowski 002 (ISAIM, 2012)

A complexity perspective on entailment of parameterized linear constraints. - Pavlos Eirinakis; Salvatore Ruggieri; K. Subramani 001; Piotr Wojciechowski 002 (Constraints An Int. J., 2012)

Variants of Quantified Linear Programming and Quantified Linear Implication. - Piotr Wojciechowski 002; Pavlos Eirinakis; K. Subramani 001 (ISAIM, 2014)

On quantified linear implications. - Pavlos Eirinakis; Salvatore Ruggieri; K. Subramani 001; Piotr Wojciechowski 002 (Ann. Math. Artif. Intell., 2014)

On the complexity of quantified linear systems. - Salvatore Ruggieri; Pavlos Eirinakis; K. Subramani 001; Piotr Wojciechowski 002 (Theor. Comput. Sci., 2014)

A Graphical Theorem of the Alternative for UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (ICTAC, 2015)

On the computational complexities of Quantified Integer Programming variants. - Piotr Wojciechowski 002; K. Subramani 001; Pavlos Eirinakis (ISAIM, 2016)

A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (IWOCA, 2016)

Compositional Bisimulation Minimization for Interval Markov Decision Processes. - Vahid Hashemi; Holger Hermanns; Lei Song 001; K. Subramani 001; Andrea Turrini; Piotr Wojciechowski 002 (LATA, 2016)

The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks. - Alvaro Velasquez; Piotr Wojciechowski 002; K. Subramani 001; Steven L. Drager 001; Sumit Kumar Jha 001 (NCA, 2016)

An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (WALCOM, 2016)

Analyzing Lattice Point Feasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (CP, 2017)

On a Generalization of Horn Constraint Systems. - Piotr Wojciechowski 002; Ramaswamy Chandrasekaran; K. Subramani 001 (CSR, 2017)

The Complexity of Finding Read-Once NAE-Resolution Refutations. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (ICLA, 2017)

On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (TAMC, 2017)

A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Algorithmica, 2017)

Analyzing restricted fragments of the theory of linear arithmetic. - Piotr Wojciechowski 002; Pavlos Eirinakis; K. Subramani 001 (Ann. Math. Artif. Intell., 2017)

Erratum to: Analyzing restricted fragments of the theory of linear arithmetic. - Piotr Wojciechowski 002; Pavlos Eirinakis; K. Subramani 001 (Ann. Math. Artif. Intell., 2017)

An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002; Zachary Santer; Matthew Anderson (AAIM, 2018)

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems. - Bugra Çaskurlu; Matthew D. Williamson; K. Subramani 001; Vahan Mkrtchyan; Piotr Wojciechowski 002 (CALDAM, 2018)

Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints. - Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (FAW, 2018)

Randomized algorithms for finding the shortest negative cost cycle in networks. - James B. Orlin; K. Subramani 001; Piotr Wojciechowski 002 (Discret. Appl. Math., 2018)

A certifying algorithm for lattice point feasibility in a system of UTVPI constraints. - K. Subramani 001; Piotr Wojciechowski 002 (J. Comb. Optim., 2018)

Finding read-once resolution refutations in systems of 2CNF clauses. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (Theor. Comput. Sci., 2018)

A Graphical Analysis of Integer Infeasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (AI*IA, 2019)

Read-Once Resolutions in Horn Formulas. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (FAW, 2019)

Restricted Cutting Plane Proofs in Horn Constraint Systems. - Hans Kleine Büning; Piotr Wojciechowski 002; R. Chandrasekaran; K. Subramani 001 (FroCos, 2019)

New Results on Cutting Plane Proofs for Horn Constraint Systems. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (FSTTCS, 2019)

Read-Once Certification of Linear Infeasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (TAMC, 2019)

A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Algorithmica, 2019)

On Unit Read-Once Resolutions and Copy Complexity. - Piotr Wojciechowski 002; K. Subramani 001 (COCOA, 2020)

Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective. - K. Subramani 001; Piotr Wojciechowski 002 (ISAIM, 2020)

On Finding Shortest Paths in Arc-Dependent Networks. - Piotr Wojciechowski 002; Matthew D. Williamson; K. Subramani 001 (ISCO, 2020)

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001; Piotr Wojciechowski 002 (IWOCA, 2020)

On integer closure in a system of unit two variable per inequality constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Ann. Math. Artif. Intell., 2020)

NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability. - Hans Kleine Büning; Piotr Wojciechowski 002; K. Subramani 001 (Math. Struct. Comput. Sci., 2020)

Analyzing fractional Horn constraint systems. - Piotr Wojciechowski 002; R. Chandrasekaran; K. Subramani 001 (Theor. Comput. Sci., 2020)

New Results on Test-Cost Minimization in Database Migration. - Utku Umur Acikalin; Bugra Çaskurlu; Piotr Wojciechowski 002; K. Subramani 001 (ALGOCLOUD, 2021)

Algorithmic Analysis of Priority-Based Bin Packing. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez; Bugra Çaskurlu (CALDAM, 2021)

On the Copy Complexity of Width 3 Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (FroCoS, 2021)

Analyzing Unit Read-Once Refutations in Difference Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (JELIA, 2021)

Tree-Like Unit Refutations in Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (LATA, 2021)

Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. - Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (Discret. Appl. Math., 2021)

On the parametrized complexity of read-once refutations in UTVPI+ constraint systems. - K. Subramani 001; Piotr Wojciechowski 002 (Theor. Comput. Sci., 2021)

Copy complexity of Horn formulas with respect to unit read-once resolution. - Piotr Wojciechowski 002; K. Subramani 001 (Theor. Comput. Sci., 2021)

New Results in Priority-Based Bin Packing. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (ALGOCLOUD, 2022)

On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez; Matthew D. Williamson (CALDAM, 2022)

Analyzing the Reachability Problem in Choice Networks. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez (CPAIOR, 2022)

Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (LFCS, 2022)

On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (TAMC, 2022)

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas. - K. Subramani 001; Piotr Wojciechowski 002 (Ann. Math. Artif. Intell., 2022)

On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems. - Piotr Wojciechowski 002; K. Subramani 001 (Ann. Math. Artif. Intell., 2022)

On the analysis of optimization problems in arc-dependent networks. - Piotr Wojciechowski 002; Matthew D. Williamson; K. Subramani 001 (Discret. Optim., 2022)

Analyzing Read-Once Cutting Plane Proofs in Horn Systems. - Piotr Wojciechowski 002; K. Subramani 001; R. Chandrasekaran (J. Autom. Reason., 2022)

Read-once refutations in Horn constraint systems: an algorithmic approach. - K. Subramani 001; Piotr Wojciechowski 002; Ying Sheng 007 (J. Log. Comput., 2022)

On the complexity of and solutions to the minimum stopping and trapping set problems. - Alvaro Velasquez; K. Subramani 001; Piotr Wojciechowski 002 (Theor. Comput. Sci., 2022)

Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (COCOA (2), 2023)

Unit Refutations of Difference Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002 (ECAI, 2023)

The Octatope Abstract Domain for Verification of Neural Networks. - Stanley Bak; Taylor Dohmen; K. Subramani 001; Ashutosh Trivedi 001; Alvaro Velasquez; Piotr Wojciechowski 002 (FM, 2023)

A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints. - Piotr Wojciechowski 002; K. Subramani 001 (SOFSEM, 2023)

Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling. - K. Subramani 001; Piotr Wojciechowski 002 (Algorithmica, 2023)

Optimal Deterministic Controller Synthesis from Steady-State Distributions. - Alvaro Velasquez; Ismail Alkhouri; K. Subramani 001; Piotr Wojciechowski 002; George K. Atia (J. Autom. Reason., 2023)

Reachability in choice networks. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez (Discret. Optim., 2023)

Reachability problems in interval-constrained and cardinality-constrained graphs. - Alvaro Velasquez; K. Subramani 001; Piotr Wojciechowski 002 (Discret. Math. Algorithms Appl., 2023)

Unit Read-once Refutations for Systems of Difference Constraints. - K. Subramani 001; Piotr Wojciechowski 002 (Theory Comput. Syst., 2023)

Optimal length cutting plane refutations of integer programs. - K. Subramani 001; Piotr Wojciechowski 002 (Discret. Optim., 2023)

Representation of Dominating Set Variants Using Dataless Neural Networks. - Sangram K. Jena 001; Piotr Wojciechowski 002 (AAIM (2), 2024)

On the Computational Complexities of Finding Selected Refutations of Linear Programs. - K. Subramani 001; Piotr Wojciechowski 002 (ISAIM, 2024)

A Certifying Algorithm for Linear (and Integer) Feasibility in Horn Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (LOPSTR, 2024)

Proving the infeasibility of Horn formulas through read-once resolution. - Piotr Wojciechowski 002; K. Subramani 001 (Discret. Appl. Math., 2024)

Constrained read-once refutations in UTVPI constraint systems: A parallel perspective. - K. Subramani 001; Piotr Wojciechowski 002 (Math. Struct. Comput. Sci., 2024)

Priority-based bin packing with subset constraints. - Piotr Wojciechowski 002; K. Subramani 001; Alvaro Velasquez; Bugra Çaskurlu (Discret. Appl. Math., 2024)

On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective. - Vahan Mkrtchyan; Garik Petrosyan; K. Subramani 001; Piotr Wojciechowski 002 (Theory Comput. Syst., 2024)

Farkas Bounds on Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (Theory Comput. Syst., 2024)

Arc-dependent networks: theoretical insights and a computational study. - Alvaro Velasquez; Piotr Wojciechowski 002; K. Subramani 001; Matthew D. Williamson (Ann. Oper. Res., 2024)

The hexatope and octatope abstract domains for neural network verification. - Stanley Bak; Taylor Dohmen; K. Subramani 001; Ashutosh Trivedi 001; Alvaro Velasquez; Piotr Wojciechowski 002 (Formal Methods Syst. Des., 2024)

The MASEMPR Problem and Its Applications in Logistics. - A. Subramani; K. Subramani 001; Piotr Wojciechowski 002; Sangram K. Jena 001 (CALDAM, 2025)

Unit Refutations in Horn Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (CIAC (1), 2025)

Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (JELIA (1), 2025)

Dag-Like Unit Refutations in UTVPI Constraint Systems. - Piotr Wojciechowski 002; K. Subramani 001 (WALCOM, 2025)

Models for Test Cost Minimization in Database Migration. - Bugra Çaskurlu; K. Subramani 001; Utku Umur Acikalin; Alvaro Velasquez; Piotr Wojciechowski 002 (INFORMS J. Comput., 2025)

Unit refutability of horn constraint systems - certification and parallel complexity. - Piotr Wojciechowski 002; K. Subramani 001 (Theor. Comput. Sci., 2025)

Correction to: Farkas Bounds on Horn Constraint Systems. - K. Subramani 001; Piotr Wojciechowski 002; Alvaro Velasquez (Theory Comput. Syst., 2025)