- Testing pseudoconvexity via interval computation2018 | Faculty of Mathematics and Physics
- Computational Complexity and Feasibility of Data Processing and Interval Computations1998 | Faculty of Mathematics and Physics
- Total least squares and Chebyshev norm2015 | Faculty of Mathematics and Physics
- Bounds for the solutions of absolute value equations2018 | Faculty of Mathematics and Physics
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall2014 | Faculty of Mathematics and Physics
- An extension of the αBB-type underestimation to linear parametric Hessian matrices2016 | Faculty of Mathematics and Physics
- The effect of Hessian evaluations in the global optimization alphaBB method2017 | Faculty of Mathematics and Physics
- P-completeness of testing solutions of parametric interval linear systems2020 | Faculty of Mathematics and Physics
- Optimal preconditioning for the interval parametric Gauss-Seidel method2016 | Faculty of Mathematics and Physics
- Direct and iterative methods for interval parametric algebraic systems producing parametric solutions2019 | Faculty of Mathematics and Physics
- When Is Data Processing Under Interval and Fuzzy Uncertainty Feasible: What if Few Inputs Interact? Does Feasibility Depend on How We Describe Interaction?2021 | Faculty of Mathematics and Physics
- Optimization of Quadratic Forms and t-norm Forms on Interval Domain and Computational Complexity2021 | Faculty of Mathematics and Physics
- An overview of polynomially computable characteristics of special interval matrices2020 | Faculty of Mathematics and Physics
- Interval linear programming techniques in constraint programming and global optimization2014 | Faculty of Mathematics and Physics
- AE regularity of interval matrices2018 | Faculty of Mathematics and Physics
- COMPLEXITY OF COMPUTING INTERVAL MATRIX POWERS FOR SPECIAL CLASSES OF MATRICES2020 | Faculty of Mathematics and Physics
- Maximization of a convex quadratic form on a polytope: Factorization and the Chebyshev norm bounds2020 | Faculty of Mathematics and Physics
- Sufficient Conditions for Pseudoconvexity by Using Linear Interval Parametric Techniques2019 | Faculty of Mathematics and Physics
- Two approaches to inner estimations of the optimal solution set in interval linear programming2020 | Faculty of Mathematics and Physics
- Linear interval parametric approach to testing pseudoconvexity2021 | Faculty of Mathematics and Physics
- Enclosing the solution set of the parametric generalised Sylvester matrix equation A(p)XB(p) plus C(p)XD(p) = F(p)2019 | Faculty of Mathematics and Physics
- Positive semidefiniteness and positive definiteness of a linear parametric interval matrix2018 | Faculty of Mathematics and Physics
- Exact real arithmetic for interval number systems2014 | Publication without faculty affiliation