Testing pseudoconvexity via interval computation. Bounds for the solutions of absolute value equations. In Martine Ceberio and Vladik Kreinovich, editors, Constraint Programming and Decision Making: Theory and Applications, Studies in Systems, Decision and Control, pp. Positive semidefiniteness and positive definiteness of a linear parametric interval matrix. Efficient approaches for enclosing the united solution set of the interval generalized Sylvester matrix equations. Marzieh Dehghani-Madiseh and Milan Hladik.Parameterized complexity of distance labeling and uniform channel assignment problems. Jiri Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecky, Jan Kratochvil:.Jiri Fiala, Pavel Klavik, Jan Kratochvil, Roman Nedela:ģ-connected reduction for regular graph covers.Miroslav Rada, Milan Hladik, Elif Garajova: Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases.Computational Optimization and Applications, 2018. Elif Garajova, Milan Hladik: On the optimal solution set in interval linear programming.Central European Journal of Operations Research, 2018. Elif Garajova, Milan Hladik, Miroslav Rada: Interval linear programming under transformations: optimal solutions and optimal value range.Elif Garajova, Milan Hladik: Checking weak optimality and strong boundedness in interval linear programming.
Proceedings of 34th International Symposium on Computational Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Tancer: Hardness of almost embedding simplicial complexes in Tancer: Pach's selection theorem does notĪdmit a topological extension. Sereni, Isomorphism of weighted trees and Stanley's conjecture for caterpillars,Īnnales de l'Institute Henri Poincare D- European Mathematical Society (2018).