Publikace 2019

• Marzieh Dehghani-Madiseh and Milan Hladík. Enclosing the solution set of the parametric generalised Sylvester matrix equation A(p)XB(p) + C(p)XD(p) = F(p). Int. J. Syst. Sci., 50(11):2153-2167, 2019.
• Elif Garajová and Milan Hladík. On the optimal solution set in interval linear programming. Comput. Optim. Appl., 72(1):269-292, 2019.
• Elif Garajová and Milan Hladík. Checking weak optimality and strong boundedness in interval linear programming. Soft Comput., 23(9):2937-2945, 2019.
• Elif Garajová, Milan Hladík, and Miroslav Rada. Interval linear programming under transformations: optimal solutions and optimal value range. Cent. Eur. J. Oper. Res., 27(3):601-614, Sep 2019.
• Milan Hladík. Tolerances, robustness and parametrization of matrix properties related to optimization problems. Optim., 68(2-3):667-690, 2019.
• Milan Hladík. Support set invariancy for interval bimatrix games. Int. J. Uncertainty Fuzziness Knowl.-Based Syst., 27(02):225-237, 2019.
• Milan Hladík. Interval robustness of matrix properties for the linear complementarity problem. In Proceedings of the 15th International Symposium on Operational Research SOR'17, Bled, Slovenia, September 25-27, 2019, pp. 488-493, BISTISK d.o.o., Ljubljana, Slovenia, 2019.
• Milan Hladík, Lubomir Kolev, and Iwona Skalna. Sufficient conditions for pseudoconvexity by using linear interval parametric techniques. In Procedings LeGO 2018 - 14th International Global Optimization Workshop, pp. 020001-1--020001-4, AIP Conference Proceedings 2070, American Institute of Physics (AIP), Melville, New York, 2019.
• Milan Hladík, Miroslav Rada, Sebastian Sitarz, and Elif Garajová. Range sets for weak efficiency in multiobjective linear programming and a parametric polytopes intersection problem. Optim., 68(2-3):645-666, 2019.
• Milan Hladík and Iwona Skalna. Relations between various methods for solving linear interval and parametric equations. Linear Algebra Appl., 574:1-21, 1 August 2019.
• Miroslav Rada, Elif Garajová, Jaroslav Horáček, and Milan Hladík. A new pruning test for parametric interval linear systems. In Proceedings of the 15th International Symposium on Operational Research SOR'17, Bled, Slovenia, September 25-27, 2019, pp. 506-511, BISTISK d.o.o., Ljubljana, Slovenia, 2019.
• Miroslav Rada, Milan Hladík, and Elif Garajová. Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases. Optim. Lett., 13(4):875-890, June 2019.
• Iwona Skalna and Milan Hladík. Direct and iterative methods for interval parametric algebraic systems producing parametric solutions. Numer. Linear Algebra Appl., 26(3):e2229:1-e2229:24, 2019.
• On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow Kateřina Altmanová, Petr Kolman, Jan Voborník, Algorithms and Data Structures Symposium (WADS), LNCS 11646, pp. 14-27, 2019
• Rajesh Chitnis, Andreas Emil Feldmann: FPT Inapproximability of Directed Cut and Connectivity Problems. In Proceedings of the 14th International Symposium on Parameterized and Exact Computation (IPEC).
• Vincent Cohen-Addad, Andreas Emil Feldmann, David Saulpic: Near-Linear-Time Approximation Schemes for Clustering in Doubling Metrics. In Proceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
• Yann Disser, Andreas Emil Feldmann, Max Klimm, Jochen Könemann: Travelling on Graphs with Small Highway Dimension. In Proceedings of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG): 175-189
• Andreas Emil Feldmann, Dániel Marx: The Parameterized Hardness of the k-Center Problem in Transportation Networks. Algorithmica (accepted for publication).
• Rajesh Chitnis, Andreas Emil Feldmann, Ondrej Suchý: A Tight Lower Bound for Planar Steiner Orientation. Algorithmica 81(8): 3200-3216
• Rajesh Chitnis, Andreas Emil Feldmann, Mohammad Taghi Hajiaghayi, Dániel Marx. Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions). SIAM Journal on Computing (accepted for publication).
• Martin Balko, Sujoy Bhore, Leonardo Martínez-Sandoval, Pavel Valtr: On Erdős-Szekeres-Type Problems for k-convex Point Sets. Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), Lecture Notes in Computer Science, vol 11638. Springer, Cham, pages 35-47, 2019.
• Martin Balko: Ramsey numbers and monotone colorings. Journal of Combinatorial Theory, Series A 163, pages 34-58, 2019.
• Martin Balko, Vít Jelínek, Pavel Valtr: On ordered Ramsey numbers of bounded-degree graphs. Journal of Combinatorial Theory, Series B 134, pages 179-202, 2019.
• Martin Balko, Josef Cibulka, Pavel Valtr: Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences. Discrete and Computational Geometry 62(1), pages 325-354, 2019.
• Martin Balko, Máté Vizer: Edge-ordered Ramsey numbers. Acta Mathematica Universitatis Comenianae 88(3), pages 409-414, 2019.
• Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kynčl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, and Emo Welzl: Minimal geometric graph representations of order types. To appear in the Proceedings of 27th International Symposium on Graph Drawing & Network Visualization (Graph Drawing 2019).
• R. Fulek and J. Kynčl, Z2-genus of graphs and minimum rank of partial symmetric matrices, Proceedings of the 35th International Symposium on Computational Geometry (SoCG 2019), Leibniz International Proceedings in Informatics (LIPIcs) 129, 39:1-39:16, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019. https://dx.doi.org/10.4230/LIPIcs.SoCG.2019.39
• R. Brignall, V. Jelínek, J. Kynčl and D. Marchant, Zeros of the Möbius function of permutations, Mathematika 65 (2019), no. 4, 1074-1092. https://doi.org/10.1112/S0025579319000251
• A. Skopenkov, M. Tancer: Hardness of almost embedding simplicial complexes in R^d. Discrete and Computational Geometry 61(2) (2019), 452-463.
• X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner: Shellability is NP-complete. Journal of the ACM 66(3) (2019), art. no. 21.
• A. de Mesmay, Y. Rieck, E. Sedgwick, M. Tancer: The unbearable hardness of unknotting. 35th International Symposium on Computational Geometry (SoCG 2019). Leibniz International Proceedings in Informatics (LIPIcs) 129(2019), 49:1--49:19.
• Elif Garajová, Milan Hladík and Miroslav Rada, The Best, the Worst and the Semi-Strong: Optimal Values in Interval Linear Programming. Croatian Operational Research Review, 2019 (accepted).
• Martin Gavalec; Daniela Ponce; Karel Zimmermann. Steady states in the scheduling of discrete-time systems. Information Sciences, 2019, 481: 219-228.
• Feghali, C., & Fiala, J. (2019). Reconfiguration graph for vertex colourings of weakly chordal graphs. Acta Mathematica Universitatis Comenianae, 88(3), 667-671.
• J. Picado, A. Pultr and A. Tozzi, Joins of closed sublocales, Houston J. of Math. 45,1 (2019), 21-38
• T. Jakl, A. Jung, and A. Pultr, Quotients of d-frames, Appl.Categor.Struct. 27 (2019), 261-275
• D. Baboolal, J. Picado and A. Pultr, Another proof of Banaschewski's surjection theorem, Categories and General Algebraic Structures with Applications 11 (2019), 113-130
• R.N. Ball, J. Picado and A. Pultr, Some aspects of (non)functoriality of natural discrete covers of locales, Quaestiones Math. 42(6) (2019), 701-715
• M. Loebl, The Precise Complexity of Finding Rainbow Even Matchings, Proceedings of the 8th International Conference on Algebraic Informatics, CAI 2019, LNCS 11545.
• M. Loebl, J.S. Sereni, Isomorphism of weighted trees and Stanley's conjecture for caterpillars, Annales de l'Institute Henri Poincare D (European Mathematical Society) 6,3 (2019)
• M. Loebl, Binary linear codes via 4D discrete Ihara-Selberg function, Annales de l'Institute Henri Poincare D (European Mathematical Society) 6,1 (2019)
• A. Grzesik, T. Klimošová, Ma. Pilipczuk, Mi. Pilipczuk: Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs, SODA 2019: 1257-1271
• R. Glebov, T. Klimošová, D. Král': Infinite dimensional finitely forcible graphon, Proc. London Math. Soc., 118 (2019) 826-856
• Chaplick, S., Fomin, F. V., Golovach, P. A., Knop, D., & Zeman, P. (2019, August). Kernelization of graph hamiltonicity: proper H-graphs. In Workshop on Algorithms and Data Structures (pp. 296-310). Springer, Cham.
• J. Hubička, J. Nešetřil: All those Ramsey classes: Ramsey classes with closures and forbidden homomorphisms, Advances in Mathematics 356C (2019), 106791.
• D. Evans, J. Hubička, J. Nešetřil: Automorphism groups and Ramsey properties of sparse graphs, Proceedings of the London Mathematical Society 119(2) (2019), 515-546.
• D. Evans, J. Hubička, M. Konečný, J. Nešetřil: EPPA for two-graphs and antipodal metric spaces, to appear in Proceedings of the American Mathematical Society
• M. Balko, D. Chodounský, Jan Hubička, M. Konečný, L. Vena: Big Ramsey degrees of 3-uniform hypergraphs (extended abstract), Acta Mathematica Universitatis Comenianae 88 (3) (2019), 415-422.
• J. Hubička, M. Konečný, J. Nešetřil: Ramsey properties of edge-labelled graphs via completions (extended abstract), Acta Mathematica Universitatis Comenianae 88 (3) (2019), 801-805.
• J. Hubička, C. Jahel, M. Konečný, M. Sabok: Extending partial automorphisms of n-partite tournaments (extended abstract), Acta Mathematica Universitatis Comenianae 88 (3) (2019), 807-811.
• J. Hubička, J. Nešetřil, P. Oviedo: Density and fractal property of the class of oriented trees (extended abstract), Acta Mathematica Universitatis Comenianae 88 (3) (2019), 813-818.
• J. Hubička, M. Konečný, J. Nešetřil: A combinatorial proof of the extension property for partial isometries, Commentationes Mathematicae Universitatis Carolinae 60 (1) (2019), 39-47.
• David Avis, David Bremner, Hans Raj Tiwary, Osamu Watanabe: Polynomial size linear programs for problems in P. Discrete Applied Mathematics 265: 22-39 (2019)
• David Avis, Hans Raj Tiwary: Compact linear programs for 2SAT. Eur. J. Comb. 80: 17-22 (2019)
• Hans Raj Tiwary, Victor Verdugo, Andreas Wiese: On the extension complexity of scheduling. Operations Research Letters. Accepted for publication (2019)
• Hans Raj Tiwary: Extension Complexity of Formal Languages. Theory of Computing Systems. Accepted for publication (2019)
• Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen and Bartosz Walczak Subexponential-time algorithms for finding large induced sparse subgraphs, IPEC 2019.
• Tomáš Masařík: Flexibility of planar graphs without 4-cycles. Acta Mathematica Universitatis Comenianae 88(3), pages 935-940, 2019.
• Tomáš Masařík, Irene Muzi, Marcin Pilipczuk, Paweł Rzążewski, Manuel Sorge: Packing Directed Circuits Quarter-Integrally. 27th Annual European Symposium on Algorithms (ESA 2019) 144, 72:1-72:13, 2019.
• Dušan Knop, Tomáš Masařík, Tomáš Toufar: Parameterized Complexity of Fair Vertex Evaluation Problems. 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) 138, 33:1-33:16, 2019
• Tomáš Masařík, Tomáš Toufar: Parameterized complexity of fair deletion problems. Discrete Applied Mathematics, 2019.
• Dariusz Dereniowski, Tomas Gavenciak, Jan Kratochvil: Cops, a fast robber and defensive domination on interval graphs. Theor. Comput. Sci. 794: 47-58 (2019)
• Matěj Konečný. Extending partial isometries of antipodal graphs. Discrete Mathematics, page 111633, 2019. https://doi.org/10.1016/j.disc.2019.111633
• Michael Skotnica. No-three-in-line problem on a torus: periodicity v Discrete Mathematics https://www.sciencedirect.com/science/article/pii/S0012365X19302730
• Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, Uli Wagner. The Crossing Tverberg Theorem. Proc. of SoCG 2019: 38:1-38:13.
• Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani and Pavel Valtr. Crossing Numbers of Beyond-Planar Graphs, Proc. of Graph Drawing 2019.