DIMEA laboratory
2021 Publications
This page lists 2021 publications coauthored by researchers affiliated with the DIMEA laboratory of the Faculty of Informatics.
Journal papers
- M. Anastos, A. Lamaison, R. Steiner, T. Szabó: Majority colorings of sparse digraphs, Electronic Journal of Combinatorics 28 (2021), article no. P2.31, 17pp.
- J.Bensmail, S. Das, S. Nandi, S. Paul, T. Pierron, S. Sen, E. Sopena: Pushable chromatic number of graphs with degree constraints, Discrete Mathematics 344 (2021), article no. 112151, 15pp.
- P. Candela, C. Catalá, R. Hancock, A. Kabela, D. Kráľ, A. Lamaison, L. Vena: Coloring graphs by translates in the circle, European Journal of Combinatorics 96 (2021), article no. 103346, 18pp.
- O. Cooley, F. Garbe, E. K. Hng, M. Kang, N. Sanhueza-Matamala, J. Zalla: Longest paths in random hypergraphs, SIAM Journal on Discrete Mathematics 35 (2021), 2430–2458.
- Z. Dvořák, M. Hebdige, F. Hlásek, D. Kráľ, J. A. Noel: Cyclic coloring of plane graphs with maximum face size 16 and 17, European Journal of Combinatorics 94 (2021), article no. 103287, 17 pp.
- Z. Dvořák, D. Kráľ, R. Thomas: Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs, Journal of Combinatorial Theory Series B 150 (2021), 270-304.
- Z. Dvořák, D. Kráľ, R. Thomas: Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies, Journal of Combinatorial Theory Series B 150 (2021), 244-269.
- M. Hahn-Klimroth, G. S. Maesaka, Y. Mogge, S. Mohr, O. Parczyk: Random perturbation of sparse graphs, Electronic Journal of Combinatorics 28 (2021), article no. P2.26, 12pp.
- A. Kabela, J. Teska: Trestles in the squares of graphs, Discrete Mathematics 334 (2021), article no. 112532, 6pp.
Peer-reviewed conference proceedings
- J. Balabán, P. Hliněný: Twin-Width is Linear in the Poset Width, International Symposium on Parameterized and Exact Computation (IPEC 2021), LIPIcs vol. 214 (2021), article no. 6, 13pp.
- J. Bok, J. Fiala, P. Hliněný, N. Jedličková, J. Kratochvíl: Computational complexity of covering multigraphs with semi-edges: small cases, 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), LIPIcs vol. 202 (2021), article no. 21, 15pp.
Proceedings of EuroComb'21
- D. Ağaoğlu, O. Çağırıcı: Unit Disk Visibility Graphs, Proceedings of Eurocomb'21, CRM Series 14 (2021), 390-396.
- F. Garbe, D. Kráľ, A. Lamaison: Hypergraphs with minimum positive uniform Turán density, Proceedings of Eurocomb'21, CRM Series 14 (2021), 148-152.
- A. Grzesik, D. Kráľ, S. Mohr: Strong modeling limits of graphs with bounded tree-width, Proceedings of Eurocomb'21, CRM Series 14 (2021), 273-279.
- P. Hliněný: A short proof of Euler–Poincaré formula, Proceedings of Eurocomb'21, CRM Series 14 (2021), 92-96.
- P. Hliněný, M. Korbela: On 13-crossing-critical graphs with arbitrarily large degrees, Proceedings of Eurocomb'21, CRM Series 14 (2021), 50-56.