Piotr Wojciechowski

87 papers A 2B 7C 12Misc 9Journal 41Unranked 16
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
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 — conf
Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems.
JELIA (1)
Piotr Wojciechowski, K. Subramani
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 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
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 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 — conf
Representation of Dominating Set Variants Using Dataless Neural Networks.
AAIM (2)
Sangram K. Jena, Piotr Wojciechowski
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 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 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 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 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 — conf
New Results on Cutting Plane Proofs for Horn Constraint Systems.
FSTTCS
Hans Kleine Büning, Piotr Wojciechowski, 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
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 J jnl
Finding read-once resolution refutations in systems of 2CNF clauses.
Theor. Comput. Sci.
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
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 — 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 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
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
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