Publications 2023

• D. Sychrovsky, S.Desai, M. Loebl Rule Enforsing Through Ordering 14th Conference on Decision and Game Theory for Security GameSec 2023.
• S.Desai, M. Loebl, D. Sychrovsky Promoting Non-Cooperation Through Ordering 14th Workshop on Optimization and Learning in Multiagent Systems OptLearnMAS 2023.
• D.Sychrovsky, J. Cerny, S. Lichau, M. Loebl Price of Anarchy in a Double-Sided Critical Goods Distribution System 22nd International Conference on Autonomous Agents and Multiagent Systems AAMAS 2023.
• Milan Hladík. Properties of the solution set of absolute value equations and the related matrix classes. SIAM J. Matrix Anal. Appl., 44(1):175–195, March 2023.
• Milan Hladík. Various approaches to multiobjective linear programming problems with interval costs and interval weights. Cent. Eur. J. Oper. Res., 31(3):713–731, September 2023.
• Milan Hladík. Complexity issues in interval linear programming. In P. Cappanera et al., editor, Optimization and Decision Science: Operations Research, Inclusion and Equity, AIRO Springer Series, pp. 123–133, Springer, Cham, 2023.
• Milan Hladík. A general approach to handle complex sensitivity analysis in linear programming. In Proceedings of the 17th International Symposium on Operational Research SOR'23, Bled, Slovenia, September 20-22, 2023, pp. 397–400, Slovenian Society INFORMATIKA, Ljubljana, Slovenia, 2023.
• Milan Hladík and Hossein Moosaei. Some notes on the solvability conditions for absolute value equations. Optim. Lett., 17(1):211–218, January 2023.
• Hossein Moosaei, Mudasir Ahmad Ganaie, Milan Hladík, and M. Tanveer. Inverse free reduced universum twin support vector machine for imbalanced data classification. Neural Netw., 157:125–135, January 2023.
• Hossein Moosaei and Milan Hladík. A lagrangian-based approach for universum twin bounded support vector machine with its applications. Ann. Math. Artif. Intell., 91:109–131, 2023.
• Hossein Moosaei, Milan Hladík, Mohamad Razzaghi, and Saeed Ketabchi. Newton-based approach to solving K-SVCR and Twin-KSVC multi-class classification in the primal space. Comput. Oper. Res., 160:106370, 2023.
• Hossein Moosaei and Milan Hladík. Sparse solution of least-squares twin multi-class support vector machine using l0 and lp-norm for classification and feature selection. Neural Netw., 166:471–486, September 2023.
• Hossein Moosaei, Ahmad Mousavi, Milan Hladík, and Zheming Gao. Sparse L1-norm quadratic surface support vector machine with Universum data. Soft Comput., 27(9):5567–5586, May 2023.
• Miroslav Rada, Elif Garajová, Jaroslav Horáček, and Milan Hladík. New pruning tests for the branch-and-prune framework for interval parametric linear systems. Soft Comput., 27(18):12897–12912, September 2023.
• Moslem Zamani and Milan Hladík. Error bounds and a condition number for the absolute value equations. Math. Program., 198(1):85–113, March 2023.
• Michael A. Bekos, Stefan Felsner, Philipp Kindermann, Stephen G. Kobourov, Jan Kratochvíl, Ignaz Rutter: The Rique-Number of Graphs. In Proceedings GD 2022 (Eds: Patrizio Angelini, Reinhard von Hanxleden), LNCS 13764, Springer 2023, pp. 371-386
• Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová: Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). In: Proceedings WG 2023 (Eds: Daniël Paulusma, Bernard Ries), LNCS 14093, Springer 2023, pp. 101-115
• Jan Kratochvíl: Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult. In Proceedings WALCOM 2023 (Eds: Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta), LNCS 13973, Springer 2023, pp. 3-11
• Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman: Recognizing H-Graphs - Beyond Circular-Arc Graphs. In Proceedings MFCS 2023 (Eds: Jérôme Leroux, Sylvain Lombardy, David Peleg), LIPIcs 272, Schloss Dagstuhl 2023, pp. 8:1-8:14
• O. Aichholzer, M.-K. Chiu, H. P. Hoang, M. Hoffmann, J. Kynčl, Y. Maus, B. Vogtenhuber and A. Weinberger, Drawings of complete multipartite graphs up to triangle flips, Proceedings of the 39th International Symposium on Computational Geometry (SoCG 2023), Leibniz International Proceedings in Informatics (LIPIcs) 258, 6:1--6:16, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2023. https://dx.doi.org/10.4230/LIPIcs.SoCG.2023.6
• Balko, M., Scheucher, M., Valtr, P.: Tight bounds on the expected number of holes in random point sets. Random Structures and Algorithms, 2023, 62(1), pp. 29–51. https://doi.org/10.1002/rsa.21088
• Balko, M., Sheffer, A., Tang, R.: The constant of point–line incidence constructions. Computational Geometry: Theory and Applications, 2023, 114, 102009. https://doi.org/10.1016/j.comgeo.2023.102009
• Balko, M., Poljak, M.: On off-diagonal ordered Ramsey numbers of nested matchings. Discrete Mathematics, 2023, 346(2), 113223. https://doi.org/10.1016/j.disc.2022.113223
• Ambrus, G., Balko, M., Frankl, N., Jung, A., Naszódi, M.: On Helly Numbers of Exponential Lattices. Leibniz International Proceedings in Informatics, LIPIcs, 2023, 258, 8. https://doi.org/10.4230/LIPIcs.SoCG.2023.8
• Balko, M., Poljak, M.: On ordered Ramsey numbers of matchings versus triangles. Procceding of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2023), 94-100, 2023. https://doi.org/10.5817/CZ.MUNI.EUROCOMB23-013
• Dvořák, P., Folwarczný, L., Opler, M., Pudlák, P., Šámal, R., Vu, T.A. (2023). Bounds on Functionality and Symmetric Difference – Two Intriguing Graph Parameters. In: Paulusma, D., Ries, B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2023. Lecture Notes in Computer Science, vol 14093. Springer, Cham. https://doi.org/10.1007/978-3-031-43380-1_22
• Lorenc, M. (2023). B-Matrices and Doubly B-Matrices in the Interval Setting. In: Ceberio, M., Kreinovich, V. (eds) Decision Making Under Uncertainty and Constraints. Studies in Systems, Decision and Control, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-031-16415-6_38
• Karel Zimmermann: Combination of T-norms and their conorms, Kybernetika, volume 59, 2023, number 4, pages 527-536
• M. Skotnica, M. Tancer: NP-hardness of computing PL geometric category in dimension 2. SIAM Journal on Discrete Mathematics 37(3) (2023), 2016--2029.
• P. Patak, M. Tancer: Shellability is hard even for balls. STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1271--1284.
• Robert Ganian, Jan Kratochvíl, Stefan Szeider: Preface: Ninth workshop on graph classes, optimization, and Width Parameters, Vienna, Austria. Special Issue of Discret. Appl. Math. 312: 1-2 (2022)
• Saeed Ketabchi, Hossein Moosaei, Mario Rosario Guarracino, and Milan Hladík. Separating two polyhedra utilizing alternative theorems and penalty function. In Dimitris E. Simos et al., editor, Learning and Intelligent Optimization, LNCS, pp. 27–39, Springer, Cham, 2022.
• Hossein Moosaei and Milan Hladík. Bounds for sparse solutions of K-SVCR multi-class classification model. In Dimitris E. Simos et al., editor, Learning and Intelligent Optimization, LNCS, pp. 136–144, Springer, Cham, 2022.
• Lorenc, M. (2022). B^R_π-Matrices, B-Matrices, and Doubly B-Matrices in the Interval Setting. Acta Cybernetica, 26(1), 83-103. https://doi.org/10.14232/actacyb.294423
• Z. Patakova, M. Tancer, U. Wagner: Barycentric cuts through a convex body. Discrete and Computational Geometry 68 (2022), 1133--1154.
• V. Kaluza, M. Tancer: Even maps, the Colin de Verdière number and representations of graphs. Combinatorica 42 (2022), 1317--1345.
• Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová: Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). WG 2023: 101-115
• Matej Lieskovský, Jiří Sgall, Andreas Emil Feldmann: Approximation Algorithms and Lower Bounds for Graph Burning. In Proceedings of the 26th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX): 9:1-9:17, 2023
• Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai, Pawel Rzazewski: Parameterized Inapproximability of Independent Set in H-Free Graphs. Algorithmica 85(4): 902-928 (2023)
• Luca Grilli, Seok-Hee Hong, Jan Kratochvil, Ignaz Rutter: Drawing Simultaneously Embedded Graphs with Few Bends. International Journal of Foundations of Computer Science 34, No. 7 (2023) 807-824
• A. Shapira and M. Tyomkyn. Weakly saturated hypergraphs and a conjecture of Tuza. Proceedings of the AMS 151 (2023), 2795–2805.
• Elif Garajová and Miroslav Rada. Interval transportation problem: feasibility, optimality and the worst optimal value. /Cent Eur J Oper Res/ *31*, 769–790 (2023). https://doi.org/10.1007/s10100-023-00841-9
• Elif Garajová and Miroslav Rada. Interval Transportation Problem: The Worst Finite Optimal Value is Hard for Inequalities. In S. Drobne, L. Zadnik Stirn, M. Kljajić Borštnar et al. (eds.), Proceedings of the 17th International Symposium on Operational Research SOR’23, Bled, Slovenia, September 20-22, 2023, pp. 367–370, Ljubljana, Slovenia. Slovenian Society Informatika, 2023. ISBN: 978-961-6165-61-7.
• Tereza Klimošová, Maya Stein: Antipaths in oriented graphs. Discret. Math. 346(9): 113515 (2023)
• Marthe Bonamy, Oscar Defrain, Tereza Klimošová, Aurélie Lagoutte, Jonathan Narboni: On Vizing's edge colouring question. J. Comb. Theory, Ser. B 159: 126-139 (2023)
• Tereza Klimošová, Vibha Sahlot: 3-Coloring C4 or C3-Free Diameter Two Graphs. WADS 2023: 547-560
• R. Chen, I. Kriz and A. Pultr, Rings and Modules in Kan Spectra, Appl.Categor.Struct. 31 (2023), art.18
• J. Nešetřil and A. Pultr, Note on strong product graph dimension, The Art of Discrete and Applied Mathematics 6(2) Dec. 2022
• A. Pultr, Prostor, topologie a pár poznámek o bezbodové topologii/Space, Topology, and a Few Remarks on Pointfree Topology, In: Topologie a poetika prostoru Vol.II (J. Nešetřil a J. Vlček eds.), (2023) 110-141 ISBN 978-80- 7494-628-8
• A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs Hančl, Jaroslav, Jr.; Klazar, Martin European J. Combin. 113 (2023), Paper No. 103744, 48 pp.
• Tereza Klimošová, Christian Reiher, Andrzej Rucinski, Matas Šileikis: Sandwiching biregular random graphs. Comb. Probab. Comput. 32(1): 1-44 (2023)