Publications 2025

Anna Pidnebesna, David Hartman, Aneta Pokorná, Matej Straka, and Jaroslav Hlinka. Computing Approximate Global Symmetry of Complex Networks with Application to Brain Lateral Symmetry. Information Systems Frontiers (2025). DOI
Aida Batamiz and Milan Hladík. Finding efficient solutions in interval multi-objective linear programming models by uncertainty theory. Int. J. Uncertain. Fuzziness Knowl.-Based Syst., 32(06):923–954, 2024. DOI
Asaf Shapira and Mykhaylo Tyomkyn. A new approach for the Brown–Erdős–Sós problem. Israel Journal of Mathematics, 267, 717–728 (2025). DOI
David Bradley-Williams, Peter J. Cameron, Jan Hubička, and Matěj Konečný. EPPA numbers of graphs. Journal of Combinatorial Theory B 170 (2025), 203–224. DOI
Elif Garajová and Milan Hladík. Inside the box: 0-1 linear programming under interval uncertainty. In Y. D. Sergeyev and others, editors, Numerical Computations: Theory and Algorithms. NUMTA 2023, LNCS, pp. 312–319, Springer, Cham, 2025. DOI
Elif Garajová, Milan Hladík, and Miroslav Rada. 0-1 Linear programming under interval uncertainty. Soft Comput., 29(7):3691–3704, 2025. DOI
Elif Garajová and Miroslav Rada. Complexity of computing the worst optimal value of interval transportation problems. Central European Journal of Operations Research, vol. 33, pp. 819–834 (2025). DOI
Elif Garajová, Milan Hladík and Miroslav Rada. Weakly feasible and optimal solution sets in 0–1 interval linear programming. In Proceedings of the 18th International Symposium on Operational Research SOR'25, pp. 402–405, Slovenian Society Informatika, Section for Operational Research, 2025. Link
Eliška Červenková and Jan Kratochvíl. 1-planar unit distance graphs with more edges than matchstick graphs. GD 2025.
Filip Úradník, Amanda Wang, and Jie Gao. Maximizing Truth Learning in a Social Network is NP-hard. Proceedings of the 24th International Conference on
Autonomous Agents and Multiagent Systems (AAMAS 2025). DOI
Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, David Eppstein, Anil Maheshwari, Saeed Odak, Michiel Smid, Csaba D. Tóth, and Pavel Valtr. Noncrossing Longest Paths and Cycles. GD 2024, 36:1-36:17. DOI
Hossein Moosaei, Saeed Khosravi, Fatemeh Bazikar, Milan Hladík, and Mario Rosario Guarracino. A novel method for solving universum twin bounded support vector machine in the primal space. Ann. Math. Artif. Intell., 93:131–150, 2025. DOI
Jan Bok, Jiří Fiala, Nikola Jedličková, and Jan Kratochvíl. Computational Complexity of Covering Regular Trees. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 345, pp. 26:1-26:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) DOI
Jan Hubička, Colin Jahel, Matěj Konečný, and Marcin Sabok. Extension property for partial automorphisms of the n-partite and semigeneric tournaments. Combinatorica, 45(50) (2025), 31pp. DOI
Jan Hubička. Big Ramsey degrees using parameter spaces. Advances in Mathematics 478 (2025), 110386. DOI
Jan Hubička and Andy Zucker. A survey on big Ramsey structures. Zbornik Radova (Beograd) 22(30) (2025), 317–355. DOI
Jan Hubička, Matěj Konečný, Štěpán Vodseďálek, and Andy Zucker. Counting big Ramsey degrees of the homogeneous and universal K₄-free graph. European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2025), 2025. DOI
Jan Hubička, Matěj Konečný, Stevo Todorcevic, and Andy Zucker. On Big Ramsey degrees of universal ω-edge-labeled hypergraphs. European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2025), 2025. DOI
Jan Hubička, Linda Kimrová, and Melichar Konečný. Understanding colors of Dufaycolor: Can we recover them using historical colorimetric and spectral data? Proceedings of 3rd international conference on "Colour Photography and Film: analysis, preservation, and conservation of analogue and digital materials", Research Culture and Science Book series (13) (2025), 144–152. DOI
Jan Kratochvíl and Melanie Reihl. Simultaneous Contact Representations of Planar Graphs. FCT 2025: 295-308.
Jan Kynčl and Jan Soukup. Extending simple monotone drawings. Proceedings of the 36th International Workshop on Combinatorial Algorithms (IWOCA 2025), Lecture Notes in Computer Science 15885, 17-30, Springer, Cham, 2025. DOI
Jan Kynčl and Jan Soukup. Many views of planar point sets. Proceedings of the 50th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2024), Lecture Notes in Computer Science 14760, 387-399, Springer, Cham, 2025. DOI
Ondřej Čepek and Jelena Glišić. Boolean Nearest Neighbor Language in the Knowledge Compilation Map. Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025).
Oswin Aichholzer, Sergio Cabello, Viola Mészáros, Patrick Schnider, and Jan Soukup. Connected Matchings. In Computational Geometry, 129, 102174 (2025). DOI
Jineon Baek and Martin Balko. The Erdős-Szekeres Conjecture Revisited. In 41st International Symposium on Computational Geometry (SoCG 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 332, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025). DOI
Jiří Fiala and Michaela Seifrtová. A novel approach to covers of multigraphs with semi-edges. Discussiones Mathematicae Graph Theory 45(2) (2025) 451-481. DOI
Martin Balko, Manfred Scheucher, and Pavel Valt. Erdős–Szekeres-Type Problems in the Real Projective Plane. Discrete & Computational Geometry 72, 1545–1578 (2024). DOI
Martin Balko, Anna Brötzner, Fabian Klute, and Josef Tkadlec. Faces in rectilinear drawings of complete graphs. European Journal of Combinatorics, 2025, 130, 104217. DOI
Martin Balko and Klára Grinerová. Estimating multicolor ordered Ramsey numbers. Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2025), 2025, 81-87. Eurocomb 25
Martin Černý. A new value for cooperative games on intersection-closed systems. Mathematical Social Sciences, Vol. 138, 102450, 2025. DOI
Martin Černý. Positivity of incomplete cooperative games revisited. Operations Research Letters, Vol. 60, 107277, 2025. DOI
Martin Mareš, Daniel Skýpala. Pisek — a Caching Task Preparation System. Olympiads in Informatics, 2025, Vol. 19, pp. 87-100. Link
Milan Hladík. Linear programming sensitivity measured by the optimal value worst-case analysis. Optim. Methods Softw., 39(5):1168–1184, 2024. DOI
Milan Hladík. Interval Linear Programming and Extensions, Springer, Cham, 2025. DOI
Milan Hladík. Global sensitivity analysis and robustness in linear programming using different norms. Cent. Eur. J. Oper. Res., 33(3):661–677, 2025. DOI
Milan Hladík and Lenka Ptáčková. Absolute value equations with interval uncertainty. Soft Comput., 29(7):3705–3718, 2025. DOI
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kynčl, Yannic Maus, Birgit Vogtenhuber, and Alexandra Weinberger. Drawings of complete multipartite graphs up to triangle flips. Journal of Computational Geometry 15 (2024), no. 2, 124-173. DOI
Petr Kolman. Approximation of Spanning Tree Congestion Using Hereditary Bisection. In 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 327, pp. 63:1-63:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) DOI
Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei, Nika Salia, and Mykhaylo Tyomkyn. On the Small Quasi-kernel Conjecture — A Survey. Deppe, C., et al. Information Theory and Related Fields. Lecture Notes in Computer Science, vol 14620. Springer, Cham. DOI
Todor Antic, Martin Balko, and Birgit Vogtenhuber. Crossing and non-crossing families. Proceedings of the 33rd International Symposium on Graph Drawing & Network Visualization (Graph Drawing 2025). DOI
Todor Antić, Vít Jelínek, Maritn Pergel, and Felix Schröder, Peter Stumpf and Pavel Valtr. The Bend Number of Cocomparability Graphs. International Symposium on Graph Drawing & Network Visualization (Graph Drawing 2025).
Todor Antić, Guillermo Gamboa Quintero, and Jelena Glišić. Reconfigurations of Plane Caterpillars and Paths (Poster abstract). International Symposium on Graph Drawing & Network Visualization (Graph Drawing 2025).
Vahideh Keikha, Maarten Löffler, Maria Saumell, and Pavel Valtr. Guarding a 1.5D Terrain with Imprecise Viewpoints. IWOCA 2025: 3-16 (best paper award). DOI