Publikace 2016

• David Hartman and Milan Hladík. Tight bounds on the radius of nonsingularity. In Marco Nehmeier, Jürgen Wolff von Gudenberg, and Warwick Tucker, editors, Scientific Computing, Computer Arithmetic, and Validated Numerics: 16th International Symposium, SCAN 2014, Würzburg, Germany, September 21-26, LNCS, pp. 109:115, Springer, 2016.
• Milan Hladík. An extension of the :BB-type underestimation to linear parametric Hessian matrices. J. Glob. Optim., 64(2):217:231, 2016.
• Milan Hladík. Optimal preconditioning for the interval parametric Gauss-Seidel method. In Marco Nehmeier, Jürgen Wolff von Gudenberg, and Warwick Tucker, editors, Scientific Computing, Computer Arithmetic, and Validated Numerics: 16th International Symposium, SCAN 2014, Würzburg, Germany, September 21-26, LNCS, pp. 116:125, Springer, 2016.
• Milan Hladík and Jiří Rohn. Radii of solvability and unsolvability of linear systems. Linear Algebra Appl., 503:120:134, 2016.
• Matej Moravčík, Martin Schmid, Karel Ha, Milan Hladík, and Stephen J. Gaukroder. Refining subgames in large imperfect information games. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 572:578, AAAI Press, Palo Alto, California, 2016.
• Amin Mostafaee, Milan Hladík, and Michal Černý. Inverse linear programming with interval coefficients. J. Comput. Appl. Math., 292:591:608, 2016.
• Sanaz Rivaz, Mohammad Ali Yaghoobi, and Milan Hladík. Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem. Fuzzy Optim. Decis. Mak., 15(3):237:253, 2016.
• Amir Shahin, Payam Hanafizadeh, and Milan Hladík. Sensitivity analysis of linear programming in the presence of correlation among right-hand side parameters or objective function coefficients. Cent. Eur. J. Oper. Res., 24(3):563:593, 2016.
• Jaroslav Horáček, Milan Hladík and Michal Černý, Interval Linear Algebra and Computational Complexity, Applied and Computational Matrix Analysis, Springer Verlag (to appear).
• Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, Laura Sanit: Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. In Proceedings of the 27th International Symposium on Algorithms and Computation (ISAAC) (to appear).
• Andreas Emil Feldmann, Dániel Marx: The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP) 27:1-27:14.
• Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanita: On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. Mathematical Programming 160(1-2): 379-406.
• Jirí Fiala, Tomás Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl: Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON 2016: 67-78
• R.N. Ball, J. Picado and A. Pultr, On an aspect of scatteredness in the point-free setting, Portugal. Math. (N.S.) 73,2 (2016), 139-152
• R.N. Ball, B. Banaschewski, T. Jakl, A. Pultr, and J. Walters-Wayland, Tightness relative to some (co)reflections in topology, Quaestiones Math. 39,3 (2016), 421-436
• J. Picado and A. Pultr, New Aspects of Subfitness in Frames and Spaces, Appl. Cat. Structures 24 (2016), 703-714
• R.N. Ball, A. Pultr and J. Walters Wayland, The Dedekind MacNeille site completion of a meet semilattice, Algebra Univers. 76 (2016), 183-197
• A. Jung, T. Jakl and A.Pultr, Bitopology and four-valued logic, Elec- tronic Notes in Theor. Comp. Science 325 (2016), 201-219
• R.N. Ball, M.A. Moshier, A. Pultr and J. Walters Wayland, Cozeros and Lindel :of Tightness, prijato v Quaestiones Math.
• J. Picado and A. Pultr, Localic maps constructed from open and closed parts, prijato v Iranian J.Math (B. Banaschewski volume)
• D. Baboolal, P. Pillay and A. Pultr, C-connected frame congruences, prijato v Iranian J.Math (B. Banaschewski volume)
• Jan Kratochvíl, Jan Arne Telle, Marek Tesar: Computational complexity of covering three-vertex multigraphs. Theor. Comput. Sci. 609: 104-117 (2016)
• Vít Jelínek, Eva Jelínková, Jan Kratochvíl: On the Hardness of Switching to a Small Number of Edges. COCOON 2016: 159-170
• Vojtěch Kaluža: Density not realizable as the Jacobian determinant of a bilipschitz map. Journal of Applied Analysis, 22(1), pp. 37-47, 2016, doi:10.1515/jaa-2016-0004
• Alfredo Hubard, Vojtěch Kaluža, Arnaud de Mesmay, Martin Tancer: Shortest path embeddings of graphs on surfaces, In Proceedings of 32nd International Symposium on Computational Geometry (SoCG 2016), to appear
• Éric Colin de Verdiere, Vojtěch Kaluža, Pavel Paták, Zuzana Patáková, Martin Tancer: A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane, In Proceedings of 24th International Symposium on Graph Drawing & Network Visualization (GD 2016), to appear
• M. Chudnovsky, Z. Dvořák, T. Klimošová, P. Seymour: Immersion in four-edge-connected graphs, J. Combin. Theory Ser. B, 116 (2016), 208-218
• M. Balko, V. Jelinek, P. Valtr, and B. Walczak: On the Beer index of convexity and its variants. To appear in Discrete & Computational Geometry, 2016.
• J. Matousek, E. Sedgwick, M. Tancer, U. Wagner: Untangling two systems of noncrossing curves. Israel Journal of Mathematics. 212(1) (2016), 37-79.
• M. Tancer: Recognition of collapsible complexes is NP-complete. Discrete and Computational Geometry. 55(1) (2016), 21-38.
• Petr Kolman, Martin Koutecky and Hans Raj Tiwary. Extension Complexity, MSO Logic, and Treewidth. Proc. of 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 18:1-18:14, 2016
• A. Jimenez, M. Kang, M. Loebl, Cubic bridgeless graphs and braces Graphs and Combinatorics 32-4 (2016).
• M. Loebl, P. Rytir, Binary linear codes, dimers and hyperdeterminants, Proceedings of the 10th Random Generation of Combinatorial Structures (GASCom) (2016); Electronic Notes in Discrete Mathematics (2016).
• Mahmoud Gad, Josef Jablonský, Karel Zimmermann. Incorrectly Posed Optimization Problems under Extremally Linear Equation Constraints. Proceedings of MME 2016, Liberec, ISBN 978-80-7494-296-9, pp.231-236
• Martin Gavalec, Karel Zimmermann. One Type of Activity Synchronization Problem.Proceedings of MME 2016, Liberec, ISBN 978-80-7494-296-9, pp.237-241
• A. Dudek, A. Frieze, A. Ruciński, M Šileikis. Embedding the Erdős-Rényi Hypergraph into the Random Regular Hypergraph and Hamiltonicity, J. Comb. Theory B (2016), DOI 10.1016/j.jctb.2016.09.003
• C. Holmgren, S. Janson, M. Šileikis. Using Polya urns to show normal limit laws for fringe subtrees in m-ary search trees (extended abstract), Proceedings of AofA 2016.
• Pavel Klavík, Yota Otachi, and Jiří Šejnoha: On the Classes of Interval Graphs of Limited Nesting and Count of Lengths. Accepted to ISAAC.
• D. Knop, T. Masařík, Computational complexity of distance edge labeling, in: Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers, 2015, pp. 287-298.
• Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hančl Jr., Michael Kaufmann, Stephen Kobourov, Antonios Symvonis, Pavel Valtr: Low Ply Drawings of Trees, to appear in Proceedings of Graph Drawing 2016, Lecture Notes in Computer Science (LNCS), 2016.
• P. Dvořák, D. Knop, T. Masařík, Anti-Path Cover on Sparse Graph Classes, in: MEMICS 2016, Telč, Czech Republic, October 21-23, EPTCS 2016