Piotr Wojciechowski

Discret. Optim., November, 2023

Unit Read-once Refutations for Systems of Difference Constraints.

[BibT_eX]

[DOI]

Theory Comput. Syst., August, 2023

Reachability problems in interval-constrained and cardinality-constrained graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., May, 2023

Reachability in choice networks.

[BibT_eX]

[DOI]

Discret. Optim., May, 2023

Optimal Deterministic Controller Synthesis from Steady-State Distributions.

[BibT_eX]

[DOI]

J. Autom. Reason., March, 2023

Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling.

[BibT_eX]

[DOI]

Algorithmica, February, 2023

A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints.

[BibT_eX]

[DOI]

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

The Octatope Abstract Domain for Verification of Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods - 25th International Symposium, 2023

Unit Refutations of Difference Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

On the complexity of and solutions to the minimum stopping and trapping set problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Read-once refutations in Horn constraint systems: an algorithmic approach.

[BibT_eX]

[DOI]

Ying Sheng

J. Log. Comput., 2022

Analyzing Read-Once Cutting Plane Proofs in Horn Systems.

[BibT_eX]

[DOI]

R. Chandrasekaran

J. Autom. Reason., 2022

On the analysis of optimization problems in arc-dependent networks.

[BibT_eX]

[DOI]

Discret. Optim., 2022

On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2022

Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2022

On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

Analyzing the Reachability Problem in Choice Networks.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

On the Approximability of Path and Cycle Problems in Arc-Dependent Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

New Results in Priority-Based Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - 7th International Symposium, 2022

2021

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On the parametrized complexity of read-once refutations in UTVPI+ constraint systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Tree-Like Unit Refutations in Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2021

Analyzing Unit Read-Once Refutations in Difference Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 17th European Conference, 2021

On the Copy Complexity of Width 3 Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 13th International Symposium, 2021

Algorithmic Analysis of Priority-Based Bin Packing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

New Results on Test-Cost Minimization in Database Migration.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Cloud Computing - 6th International Symposium, 2021

2020

Analyzing fractional Horn constraint systems.

[BibT_eX]

[DOI]

R. Chandrasekaran

Theor. Comput. Sci., 2020

NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2020

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

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2020

Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

On Finding Shortest Paths in Arc-Dependent Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

Finding read-once refutations in 2CNF formulas and variants - a parameterized perspective.

[BibT_eX]

[DOI]

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

On Unit Read-Once Resolutions and Copy Complexity.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

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

[BibT_eX]

[DOI]

Algorithmica, 2019

Read-Once Certification of Linear Infeasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

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

New Results on Cutting Plane Proofs for Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Restricted Cutting Plane Proofs in Horn Constraint Systems.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

Read-Once Resolutions in Horn Formulas.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

A Graphical Analysis of Integer Infeasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2019 - Advances in Artificial Intelligence, 2019

2018

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

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

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

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

[BibT_eX]

[DOI]

James B. Orlin

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

Bugra Çaskurlu

Vahan Mkrtchyan

Proceedings of the Algorithms and Discrete Applied Mathematics, 2018

An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017

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

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

Analyzing restricted fragments of the theory of linear arithmetic.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2017

A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Algorithmica, 2017

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

On a Generalization of Horn Constraint Systems.

[BibT_eX]

[DOI]

Ramaswamy Chandrasekaran

Proceedings of the Computer Science - Theory and Applications, 2017

Analyzing Lattice Point Feasibility in UTVPI Constraints.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2017

2016

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

Compositional Bisimulation Minimization for Interval Markov Decision Processes.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

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

[BibT_eX]

[DOI]

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

On the computational complexities of Quantified Integer Programming variants.

[BibT_eX]

[DOI]

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

2015

A Graphical Theorem of the Alternative for UTVPI Constraints.

[BibT_eX]

[DOI]

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

2014

On the complexity of quantified linear systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On quantified linear implications.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2014

Variants of Quantified Linear Programming and Quantified Linear Implication.

[BibT_eX]

[DOI]