DIMEA laboratory
2019 Publications
This page lists 2019 publications coauthored by researchers affiliated with the DIMEA laboratory of the Faculty of Informatics.
Journal papers
- M.Bračič, D. Bokal, M. Derňár, P. Hliněný: On Degree Properties of Crossing-critical Families of Graphs, Electronic Journal of Combinatorics 26 (2019), article no. P1.53, 28pp.
- X. Cai, L. Devroye, C. Holmgren, F. Skerman: k-cut on paths and some trees, Electronic Journal of Probability 24 (2019), article no. 53, 22 pp.
- J. Gajarský, P. Hliněný, M. Koutecký, S. Onn: Parameterized Shifted Combinatorial Optimization, Journal of Computer and System Sciences 99 (2019), 53-71.
- R. Ganian,P. Hliněný, J. Nešetřil, J. Obdržálek, P. Ossona de Mendez: Shrub-depth: Capturing Height of Dense Graphs, Logical Methods in Computer Science 15 (2019), 7:1-7:25.
- R. Glebov, T. Klimošová, D. Kráľ: Infinite dimensional finitely forcible graphon, Proceedings of the LMS 118 (2019), 826-856.
- R. Glebov, D. Kráľ, J. Volec: Compactness and finite forcibility of graphons, Journal of the EMS 21 (2019), 3199-3223.
- P. Hliněný, F. Pokrývka, B. Roy: FO model checking of geometric graphs, Computational Geometry: Theory and Applications 78 (2019), 1-19.
- D. Kráľ, B. Lidický, T. Martins, Y. Pehova: Decomposing graphs into edges and triangles, Combinatorics, Probability and Computing 28 (2019), 465-472.
- D. Kráľ, T. Martins, P. Pach, M. Wrochna: The step Sidorenko property and non-norming edge-transitive graphs, Journal of Combinatorial Theory Series A 162 (2019), 34-54.
- D. Kráľ, S. Norin, J. Volec: A bound on the inducibility of cycles, Journal of Combinatorial Theory Series A 161 (2019), 359-363.
Peer-reviewed conference proceedings
- D. Bokal, Z. Dvořák, P. Hliněný, J. Leanos, B. Mohar, T. Wiedera: Bounded degree conjecture holds precisely for c-crossing-critical graphs with c <= 12, 35th International Symposium on Computational Geometry (SoCG'19), LIPIcs vol. 129 (2019), article no. 14, 15pp.
- O. Cagirici, S.K. Ghosh, P. Hliněný, B. Roy: On conflict-free chromatic guarding of simple polygons, 14th International Conference on Combinatorial Optimization and Applications (COCOA'19), LNCS vol. 11949 (2019), 601-612.
- F. Foucad, H. Hocquard, D. Lajou, V. Mitsou, T. Pierron: Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems, 14th International Symposium on Parameterized and Exact Computation (IPEC'19), LIPIcs vol. 148 (2021), article no. 15, 16pp.
- P. Hliněný, A. Sankaran: Exact Crossing Number Parameterized by Vertex Cover, 27th International Symposium on Graph Drawing and Network Visualization (GD'19), LNCS vol. 11904 (2019), 307–319.
Proceedings of EuroComb'19
- T. F. N. Chan, A. Grzesik, D. Kráľ, J. Noel: Cycles of length three and four in tournaments, Proceedings of Eurocomb'19, Acta Mathematica Universitatis Comenianae 88 (2019), 533-539.
- M. Dębski: Edge colorings avoiding patterns, Proceedings of Eurocomb'19, Acta Mathematica Universitatis Comenianae 3 (2019), 619–623.
- M. Dębski, M. Śleszyńska-Nowak: t-strong cliques and the degree-diameter problem, Proceedings of Eurocomb'19, Acta Mathematica Universitatis Comenianae 3 (2019), 1057–1061.
- F. Garbe, R. Hancock, J. Hladký, M. Sharifzadeh: Theory of limits of sequences of Latin squares, Proceedings of Eurocomb'19, Acta Mathematica Universitatis Comenianae 88 (2019), 709-716.
- T. Hubai, D. Kráľ, O. Parczyk, Y. Person: More non-bipartite forcing pairs, Proceedings of Eurocomb'19, Acta Mathematica Universitatis Comenianae 88 (2019), 819-825.
- T. Pierron: A Brooks-like result for graph powers, Proceedings of Eurocomb'19, Acta Mathematica Universitatis Comenianae 88 (2019), 1003-1007.