| Publication | Date of Publication | Type |
|---|
On the computational and approximation complexities of selected unit refutations in UTVPI constraint systems
Theoretical Computer Science | 2026-03-05 | Paper |
| Unit refutations in Horn constraint systems | 2025-11-11 | Paper |
Unit refutability of Horn constraint systems -- certification and parallel complexity
Theoretical Computer Science | 2025-09-16 | Paper |
Parameterized lower bounds for the weighted vertex cover problem in trees
Acta Informatica | 2025-09-10 | Paper |
Optimal length cutting plane refutations of integer programs
Discrete Optimization | 2025-07-16 | Paper |
| The MASEMPR problem and its applications in logistics | 2025-06-20 | Paper |
Models for test cost minimization in database migration
INFORMS Journal on Computing | 2025-06-05 | Paper |
Correction to: ``Farkas bounds on Horn constraint systems''
Theory of Computing Systems | 2025-05-09 | Paper |
| Dag-like unit refutations in UTVPI constraint systems | 2025-04-15 | Paper |
The hexatope and octatope abstract domains for neural network verification
Formal Methods in System Design | 2025-01-13 | Paper |
Constrained read-once refutations in UTVPI constraint systems: a parallel perspective
Mathematical Structures in Computer Science | 2024-10-16 | Paper |
| Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints | 2024-09-16 | Paper |
Arc-dependent networks: theoretical insights and a computational study
Annals of Operations Research | 2024-08-15 | Paper |
Proving the infeasibility of Horn formulas through read-once resolution
Discrete Applied Mathematics | 2024-06-20 | Paper |
Algebraic properties of soluble posets
Discrete Applied Mathematics | 2024-03-27 | Paper |
Priority-based bin packing with subset constraints
Discrete Applied Mathematics | 2024-01-24 | Paper |
The octatope abstract domain for verification of neural networks
Formal Methods | 2023-08-17 | Paper |
A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
Lecture Notes in Computer Science | 2023-08-14 | Paper |
On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
Lecture Notes in Computer Science | 2023-08-04 | Paper |
Reachability problems in interval-constrained and cardinality-constrained graphs
Discrete Mathematics, Algorithms and Applications | 2023-07-15 | Paper |
Reachability in choice networks
Discrete Optimization | 2023-06-30 | Paper |
Optimal deterministic controller synthesis from steady-state distributions
Journal of Automated Reasoning | 2023-06-14 | Paper |
On the approximability of path and cycle problems in arc-dependent networks
Algorithms and Discrete Applied Mathematics | 2023-05-08 | Paper |
Integer feasibility and refutations in UTVPI constraints using bit-scaling
Algorithmica | 2023-02-16 | Paper |
| scientific article; zbMATH DE number 7650340 (Why is no real title available?) | 2023-02-03 | Paper |
| Direct approach to rank-1 completions of partial matrices | 2022-11-25 | Paper |
Read-once refutations in Horn constraint systems: an algorithmic approach
Journal Of Logic And Computation | 2022-09-22 | Paper |
| Analyzing the reachability problem in choice networks | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7564191 (Why is no real title available?) | 2022-07-26 | Paper |
| Exact and parameterized algorithms for read-once refutations in Horn constraint systems | 2022-07-01 | Paper |
Analyzing read-once cutting plane proofs in Horn systems
Journal of Automated Reasoning | 2022-06-09 | Paper |
On the complexity of and solutions to the minimum stopping and trapping set problems
Theoretical Computer Science | 2022-05-31 | Paper |
Transitive systems and conclusive partial orders
Discrete Applied Mathematics | 2022-04-20 | Paper |
| Algorithmic analysis of priority-based bin packing | 2022-03-24 | Paper |
| On the copy complexity of width 3 Horn constraint systems | 2022-03-24 | Paper |
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
Annals of Mathematics and Artificial Intelligence | 2022-02-14 | Paper |
| Analyzing unit read-once refutations in difference constraint systems | 2021-12-01 | Paper |
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
Discrete Applied Mathematics | 2021-10-21 | Paper |
Copy complexity of Horn formulas with respect to unit read-once resolution
Theoretical Computer Science | 2021-10-21 | Paper |
| Tree-like unit refutations in Horn constraint systems | 2021-10-04 | Paper |
| On finding shortest paths in arc-dependent networks | 2021-02-04 | Paper |
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
Mathematical Structures in Computer Science | 2021-01-07 | Paper |
Analyzing fractional Horn constraint systems
Theoretical Computer Science | 2020-10-21 | Paper |
| Optimal length tree-like refutations of linear feasibility in UTVPI constraints | 2020-07-07 | Paper |
| Restricted cutting plane proofs in Horn constraint systems | 2020-05-13 | Paper |
| Read-once certification of linear infeasibility in UTVPI constraints | 2019-10-15 | Paper |
| Read-once resolutions in Horn formulas | 2019-10-11 | Paper |
The complexity of finding read-once NAE-resolution refutations
Logic and Its Applications | 2019-07-24 | Paper |
Full algebras of matrices
Linear and Multilinear Algebra | 2019-07-03 | Paper |
| A fully polynomial time approximation scheme for refutations in weighted difference constraint systems | 2018-06-05 | Paper |
Finding read-once resolution refutations in systems of 2CNF clauses
Theoretical Computer Science | 2018-05-17 | Paper |
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
Journal of Combinatorial Optimization | 2018-03-01 | Paper |
| On a generalization of Horn constraint systems | 2017-08-22 | Paper |
Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic''
Annals of Mathematics and Artificial Intelligence | 2017-07-19 | Paper |
On the computational complexity of read once resolution decidability in 2CNF formulas
Lecture Notes in Computer Science | 2017-05-19 | Paper |
A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
Algorithmica | 2017-05-11 | Paper |
Analyzing restricted fragments of the theory of linear arithmetic
Annals of Mathematics and Artificial Intelligence | 2017-03-06 | Paper |
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
Lecture Notes in Computer Science | 2016-09-29 | Paper |
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Compositional bisimulation minimization for interval Markov decision processes
Language and Automata Theory and Applications | 2016-04-13 | Paper |
A Graphical Theorem of the Alternative for UTVPI Constraints
Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
On quantified linear implications
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
A complexity perspective on entailment of parameterized linear constraints
Constraints | 2015-01-22 | Paper |
Feasible algorithms for lattice and directed subspaces.
Mathematical Proceedings of the Royal Irish Academy | 2015-01-16 | Paper |
Signature matrix algebras and bipartite graphs
Linear Algebra and its Applications | 2014-06-03 | Paper |
On the complexity of quantified linear systems
Theoretical Computer Science | 2014-01-13 | Paper |
On the additivity of the Minkowski functionals
Numerical Functional Analysis and Optimization | 2013-07-30 | Paper |
| A note on directly ordered subspaces of \(\mathbb R^n\). | 2013-01-09 | Paper |
| PMV-algebras of matrices | 2012-04-26 | Paper |
Matrix algebras with multiplicative decomposition property
Linear Algebra and its Applications | 2011-02-09 | Paper |
Equivalents for a quasivariety to be generated by a single structure
Studia Logica | 2009-03-17 | Paper |
Embeddings of totally ordered MV-algebras of bounded cardinality
Fundamenta Mathematicae | 2009-03-16 | Paper |
Large-Scale Scientific Computing
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Multiplicative bases in matrix algebras
Linear Algebra and its Applications | 2007-02-14 | Paper |
Ordinal Explanation of the Periodic System of Chemical Elements
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems | 2006-05-19 | Paper |
Lattice orders on matrix algebras.
Algebra Universalis | 2005-04-19 | Paper |
Directed maximal partial orders of matrices.
Linear Algebra and its Applications | 2003-12-04 | Paper |
A proof of Weinberg’s conjecture on lattice-ordered matrix algebras
Proceedings of the American Mathematical Society | 2002-06-17 | Paper |
\(F^*\)-rings are \(O^*\)
Order | 2000-12-19 | Paper |
Strict Archimedean \(t\)-norms and \(t\)-conorms as universal approximators
International Journal of Approximate Reasoning | 2000-01-04 | Paper |
On lattice extensions of partial orders of rings
Communications in Algebra | 1998-04-26 | Paper |
| scientific article; zbMATH DE number 1069336 (Why is no real title available?) | 1997-10-01 | Paper |
| scientific article; zbMATH DE number 908173 (Why is no real title available?) | 1997-02-24 | Paper |
Images of bilinear mappings into 𝐑³
Proceedings of the American Mathematical Society | 1996-12-10 | Paper |
Orderpotent \(f\)-rings
Algebra Universalis | 1996-02-08 | Paper |
Lattice-ordered algebras with polynomial inequalities
Forum Mathematicum | 1995-06-11 | Paper |
Archimedean orderpotent rings
Communications in Algebra | 1994-08-22 | Paper |
| scientific article; zbMATH DE number 446463 (Why is no real title available?) | 1993-12-09 | Paper |
| scientific article; zbMATH DE number 4162959 (Why is no real title available?) | 1989-01-01 | Paper |
