DIMEA laboratory
2024 Publications
This page lists 2024 publications coauthored by researchers affiliated with the DIMEA laboratory of the Faculty of Informatics.
Journal papers
- J. Balabán, P. Hliněný, J. Jedelský: Twin-width and transductions of proper k-mixed-thin graphs, Discrete Mathematics 347 (2024), article 113876.
- M. A. Bekos, G. Da Lozzo, P. Hliněný, M. Kaufmann: Graph product structure for h-framed graphs , Electronic Journal of Combinatorics 31(4) (2024), article P4.56, 33pp.
- S. Brandt, Y.-J. Chang, J. Grebík, C. Grunau, V. Rozhoň, Z. Vidnyánszky: On homomorphism graphs, Forum of Mathematics, Pi 12 (2024), article e10, 20pp.
- M. Briański, M. Koutecký, D. Kráľ, K. Pekárková, F. Schröder: Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming, Mathematical Programming 208 (2024), 497-531.
- O. Çağırıcı, P. Hliněný, B. Roy: On colourability of polygon visibility graphs, European Journal of Combinatorics 117 (2024), article 103820.
- C. T. Conley, J. Grebík, O. Pikhurko: Divisibility of spheres with measurable pieces, L’Enseignement Mathématique 70 (2024), 25–59.
- C. T. Conley, J. Grebík, O. Pikhurko: Local version of Vizing's theorem for multigraphs, Journal of Graph Theory 107 (2024), 693-701.
- Z. Dvořák, D. Kráľ, R. Thomas: Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations, Journal of Combinatorial Theory Series B 164 (2024), 517-548.
- F. Garbe, J. Hladký, G. Kun, K. Pekárková: On pattern-avoiding permutons, Random Structures & Algorithms 65 (2024), 46-60.
- F. Garbe, J. Hladký, M. Šileikis, F. Skerman: From flip processes to dynamical systems on graphons, Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 60 (2024), 2878-2922.
- F. Garbe, D. Kráľ, A. Lamaison: Hypergraphs with minimum positive uniform Turán density, Israel Journal of Mathematics 259 (2024), 701-726.
- A. Grzesik, D. Kráľ, O. Pikhurko: Forcing generalized quasirandom graphs efficiently, Combinatorics, Probability and Computing 33 (2024), 16-31.
- T. Pierron: A Brooks-like result for graph powers, European Journal of Combinatorics 117 (2024), article 103822.
Peer-reviewed conference proceedings
- J. Balabán, R. Ganian, M. Rocton: Computing twin-width parameterized by the feedback edge number, 41st International Symposium on Theoretical Aspects of Computer Science (STACS'24), LIPIcs vol.289, 2024, article no. 7, 19pp.
- J. Balabán, R. Ganian, M. Rocton: Twin-width meets feedback edges and vertex integrity, 19th International Symposium on Parameterized and Exact Computation (IPEC'24), LIPIcs vol.321, 2024, article no. 3, 22pp.
- M. Balko, P. Hliněný, T. Masařík, J. Orthaber, B. Vogtenhuber, M. H. Wagner: On the uncrossed number of graphs, 32nd International Symposium on Graph Drawing and Network Visualization (GD'24), LIPIcs vol. 320, 2024, article no. 18, 13pp.
- M. Filakovský, T.-V. Nakajima, J. Opršal, G. Tasinato, U. Wagner: Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs, 41st International Symposium on Theoretical Aspects of Computer Science (STACS'24), LIPIcs vol.289, 2024, article no. 34, 19pp.
- P. Hliněný, J. Jedelský: H-clique-width and a hereditary analogue of product structure, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS'24), LIPIcs vol. 306, 2024, article no. 61, 16pp.
- P. Hliněný, L. Khazaliya: Crossing number is NP-Hard for constant path-width (and tree-width), 35th International Symposium on Algorithms and Computation (ISAAC'24), LIPIcs vol. 322, 2024, article no. 40, 15pp.
- P. Hliněný, L. Ködmön: Note on min-k-planar drawings of graphs, 32nd International Symposium on Graph Drawing and Network Visualization (GD'24), LIPIcs vol. 320, 2024, article no. 8, 10pp.
- D. Kráľ, K. Pekárková, K. Štorgel: Twin-width of graphs on surfaces, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS'24), LIPIcs vol. 306, 2024, article no. 66, 15pp.