Publications 2022

• Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski: List Covering of Regular Multigraphs. In: Proceedings IWOCA 2022 - Combinatorial Algorithms - 33rd International Workshop, IWOCA  2022, Trier, Germany, June 7-9, 2022, (C. Bazgan, H. Fernau, eds.), LNCS 13270, 2022, pp. 228-242
• Michael Kaufmann, Jan Kratochvíl, Fabian Lipp, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou, Pavel Valtr: The Stub Resolution of 1-planar Graphs. J. Graph Algorithms Appl. 25(2): 625-642 (2021)
• Hossein Moosaei, Fatemeh Bazikar, Saeed Ketabchi, and Milan Hladík. Universum parametric-margin nu-support vector machine for classification using the difference of convex functions algorithm. Appl. Intell., 52(3):2634–2654, 2022.
• Hossein Moosaei and Milan Hladík. Least squares approach to K-SVCR multi-class classification with its applications. Ann. Math. Artif. Intell., 90:873–892, 2022.
• Michal Černý, Miroslav Rada, Jaromír Antoch, and Milan Hladík. A class of optimization problems motivated by rank estimators in robust regression. Optim., 71(8):2241–2271, Taylor & Francis, 2022.
• Hossein Moosaei and Milan Hladík. Inverse free Universum twin support vector machine. In D. E. Simos et al., editor, Learning and Intelligent Optimization, LNCS, pp. 252–264, Springer, Cham, 2021.
• D. Conlon and M. Tyomkyn, Ramsey numbers of trails andcircuits, J. Graph Theory. (2022), 1–3. https://doi.org/10.1002/jgt.22865
• Yann Disser, Johannes Blum, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz: On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. In Proceedings of the 17th International Symposium on Parameterized and Exact Computation (IPEC).
• Andreas Emil Feldmann, Tung Anh Vu: Generalized k-Center: Distinguishing Doubling and Highway Dimension. In Proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG).
• Andreas Emil Feldmann, Anish Mukherjee, Erik Jan van Leeuwen: The Parameterized Complexity of the Survivable Network Design Problem. In Proceedings of the Symposium on Simplicity in Algorithms (SOSA), pages 37-56.
• Pavel Dvořák, Andreas Emil Feldmann, Ashutosh Rai, Paweł Rzążewski: Parameterized Inapproximability of Independent Sets in H-Free Graphs. Algorithmica.
• Andreas Emil Feldmann, Ashutosh Rai: On Extended Formulations for Parameterized Steiner Trees. Theoretical Computer Science.
• Balko, M., Chaplick, S., Ganian, R., Siddharth, G., Hoffmann, M., Valtr, P., Wolff, A. Bounding and Computing Obstacle Numbers of Graphs. Proceedings of the 30th Annual European Symposium on Algorithms (ESA 2022), Volume 244, 2022. DOI: 10.4230/LIPIcs.ESA.2022.11
• Balko, M., Scheucher, M., Valtr, P. Erdos-Szekeres-Type Problems in the Real Projective Plane. Proceedings of the 38th International Symposium on Computational Geometry (SoCG 2022), Volume 224, Article number 10, 2022. DOI: 10.4230/LIPIcs.SoCG.2022.10
• Balko, M., Scheucher, M., Valtr, P. Holes and islands in random point sets. Random Structures and Algorithms, 2022, 60(3), pp. 308–326. DOI: 10.1002/rsa.21037
• Balko, M., Vizer, M. ON ORDERED RAMSEY NUMBERS of TRIPARTITE 3-UNIFORM HYPERGRAPHS. SIAM Journal on Discrete Mathematics, 2022, 36(1), pp. 214–228. DOI: 10.1137/21M1404958
• Balko, M., Gerbner, D., Dong Yeap, K., Kim, Y., Palmer, C. Hypergraph based Berge hypergraphs. Graphs Combin. 38 (2022), no. 1, Paper No. 11, 13 pp.
• R. Fulek and J. Kynčl, The Z2-genus of Kuratowski minors, Discrete and Computational Geometry 68 (2022), Issue 2, 425-447. https://doi.org/10.1007/s00454-022-00412-w
• O. Aichholzer, J. Kynčl, M. Scheucher, P. Valtr and B. Vogtenhuber, On crossing-families in planar point sets. Computational Geometry: Theory and Applications 107 (2022), Paper No. 101899, 8 pp. https://doi.org/10.1016/j.comgeo.2022.101899
• S. Felsner, M. Hoffmann, K. Knorr, J. Kynčl and I. Parada, On the maximum number of crossings in star-simple drawings of K_n with no empty lens, Journal of Graph Algorithms and Applications 26 (2022),  no. 3, 381-399. https://doi.org/10.7155/jgaa.00600
• Hans Raj Tiwary: On Permuting some Coordinates of Polytopes, International Symposium on Combinatorial Optimization, 2022.
• Jirí Fiala, Ignaz Rutter, Peter Stumpf, Peter Zeman: Extending Partial Representations of Circular-Arc Graphs. WG 2022: 230-243
• I. Arrieta, J. Picado and A. Pultr,A New Diagonal Separation and its Relation With the Hausdorff Property, Appl.Categor.Struct. 30 (2022), 247-263
• M.A. Moshier, J. Picado and A. Pultr, Some general aspects of exactness and strong exactness of meets, Topology and ist Applications 309 (2022), 1-14, 107906
• J. Picado and A. Pultr, Uniformities and a quantale structure on localic groups, Bull. Belg. Math. Soc. Simon Stevin 28(2021), 561-578 (appeared in 2022)
• M. Erné, J. Picado and A. Pultr, Adjoint maps between implicative semilattices and continuity of localic maps, Algebra Universalis (2022) 83(2) art.13
• Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani, Pavel Valtr: Crossing numbers of beyond-planar graphs. Theor. Comput. Sci. 898: 44-49 (2022)
• Z. Horský and M. Klazar, Are the Catalan numbers a linear recurrence sequence? Amer. Math. Monthly 129 (2020), no. 2, 166-171 
• Mareš Martin, Valla Tomáš: Průvodce labyrintem algoritmů (2. doplněné vydání). CZ.NIC, 2022.
• T. Klimošová, S. Thomassé: Edge-partitioning 3-edge-connected graphs into paths, J. Combin. Theory Ser. B, 156 (2022), 250-293. 
• A. Grzesik, T. Klimošová, Ma. Pilipczuk, Mi. Pilipczuk: Polynomial-time algorithm for Maximum Weight Independent Set on P 6 -free graphs, ACM Transactions on Algorithms (TALG) 18.1 (2022): 1-57.
• C. Legrand-Duchesne, A. Rai, and M. Tancer, Parameterized Complexity of Untangling Knots, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), Leibniz International Proceedings in Informatics (LIPIcs), 88:1--88:17, Vol. 229 (2022) 
• Rada, M., Garajová, E., Horáček, J. et al. New pruning tests for the branch-and-prune framework for interval parametric linear systems. Soft Comput (2022). https://doi.org/10.1007/s00500-022-06971-7
• J. Hubička, M. Konečný, J. Nešetřil: All those EPPA classes (Strengthenings of the Herwig-Lascar theorem), Transactions of the American Mathematical Society, 375 (2022), 7601-7667.