DIMEA laboratory
2023 Publications
This page lists 2023 publications coauthored by researchers affiliated with the DIMEA laboratory of the Faculty of Informatics.
Journal papers
- D. Agaoglu Cagirici, P. Hliněný: Efficient isomorphism for Sd-graphs and T-graphs, Algorithmica 85 (2023), 352-383.
- M. Bucić, J. W. Cooper, D. Kráľ, S. Mohr, D. Munhá: Uniform Turán density of cycles, Transactions of the AMS 376 (2023), 4765-4809.
- O. Cagirici, P. Hliněný, F. Pokrývka, A. Sankaran: Clique-width of point configurations, Journal of Combinatorial Theory Series B 158 (2023), 43-73.
- M. Chimani, P. Hliněný: Inserting multiple edges into a planar graph, Journal of Graph Algorithms and Applications 27 (2023), 489-522.
- F. Garbe, R. Hancock, J. Hladký, M. Sharifzadeh: Limits of Latin squares, Discrete Analysis 2023:8, 66pp.
- A. Grzesik, D. Iľkovič, B. Kielak, D. Kráľ: Quasirandom forcing orientations of cycles, SIAM Journal on Discrete Mathematics 37 (2023), 2689-2716.
- A. Grzesik, D. Kráľ, L. M. Lovász, J. Volec: Cycles of a given length in tournaments, Journal of Combinatorial Theory Series B 158 (2023), 117-145.
- R. Hancock, A. Kabela, D. Kráľ, T. Martins, R. Parente, F. Skerman, J. Volec: No additional tournaments are quasirandom-forcing, European Journal of Combinatorics 108 (2023), article no. 103632, 10pp.
- R. Hancock, D. Kráľ, M. Krnc, J. Volec: Toward characterizing locally common graphs, Random Structures and Algorithms 62 (2023), 181-218.
- A. Lamaison: Ramsey upper density of infinite graphs, Combinatorics, Probability and Computing 32 (2023), 703-723.
Peer-reviewed conference proceedings
- D. Agaoglu Cagirici, O. Cagirici, J. Derbisz, T.A. Hartmann, P. Hliněný, J. Kratochvíl, T. Krawczyk, P. Zeman: Recognizing H-graphs - beyond circular-arc graphs, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS'23), LIPIcs vol. 272, article no. 8, 2023, 14pp.
- B. Bergougnoux, J. Gajarský, G. Guspiel, P. Hliněný, F. Pokrývka, M. Sokolowski: Sparse graphs of twin-width 2 have bounded tree-width, 34th International Symposium on Algorithms and Computation (ISAAC'23), LIPIcs vol. 283, article no. 11, 2023, 13pp.
- P. Hliněný, J. Jedelský: Twin-width of planar graphs is at most 8, and at most 6 when bipartite planar, 50th International Colloquium Automata, Languages and Programming (ICALP'23), LIPIcs vol. 261, article no. 75, 2023, 18pp.
- P. Hliněný, T. Masařík: Minimizing an uncrossed collection of drawings, Graph Drawing and Network Visualization (GD'23), Lecture Notes in Computer Science vol. 14465, Springer, 2023, 110-123.
Proceedings of Eurocomb'23
- F. Garbe, D. Kráľ, A. Malekshahian, R. Penaguiao: The dimension of the feasible region of pattern densities, Proceedings of Eurocomb'23, Munipress, 2023, paper #65, 7pp.
- A. Grzesik, D. Kráľ, O. Pikhurko: Forcing generalized quasirandom graphs efficiently, Proceedings of Eurocomb'23, Munipress, 2023, paper #70, 8pp.
- P. Hliněný: Twin-width of Planar Graphs; a Short Proof, Proceedings of Eurocomb'23, Munipress, 2023, paper #82, 6pp.
- P. Hliněný, A. Straka: Stack and Queue Numbers of Graphs Revisited, Proceedings of Eurocomb'23, Munipress, 2023, paper #83, 6pp.