Laboratoř DIMEA
Publikace 2020
Tato stránka obsahuje seznam publikací členů laboratoře DIMEA v roce 2020.
Časopisy
- A. Acharyya, M. De, S. C. Nandy, B. Roy: Range assignment of base-stations maximizing coverage area without interference, Theoretical Computer Science 804 (2020), 81-97.
- M. Albert, C. Holmgren, T. Johansson, F. Skerman: Embedding small digraphs and permutations in binary trees and split trees, Algorithmica 82 (2020), 589–615.
- J. Bensmail, S. Das, S. Nandi, S. Paul, T. Pierron, S. Sen, É. Sopena: Pushable chromatic number of graphs with degree constraints, Discrete Mathematics 344 (2021), article no. 112151, 15pp.
- M. Bonamy, N. Bousquet, K. Dabrowski, M. Johnson, D. Paulusma, T. Pierron: Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy, Algorithmica 83 (2020), 822-852.
- T. F. N. Chan, A. Grzesik, D. Kráľ, J. A. Noel: Cycles of length three and four in tournaments, Journal of Combinatorial Theory Series A 175 (2020), article no. 105276, 23pp.
- T. F. N. Chan, D. Kráľ, J. A. Noel, Y. Pehova, M. Sharifzadeh, J. Volec: Characterization of quasirandom permutations by a pattern sum, Random Structures and Algorithms 57 (2020), 920-939.
- M. Chimani, P. Hliněný, G. Salazar: Toroidal Grid Minors and Stretch in Embedded Graphs, Journal of Combinatorial Theory Series B 140 (2020), 323-371.
- A. N. Day, V. Falgas-Ravry, R. Hancock: Long paths and connectivity in 1-independent random graphs, Random Structures and Algorithms 57 (2020), 1007-1049.
- M. Dębski, J. Grytczuk, U. Pastwa, B. Nayar, J. Sokół, M. Tuczyński, P. Wenus, K. Węsek: Avoiding multiple repetitions in Euclidean spaces, SIAM Journal on Discrete Mathematics 34 (2020), 40–52.
- M. Dębski, K. Junosza-Szaniawski, Z. Lonc: Bundling all shortest paths, Discrete Applied Mathematics 277 (2020), 82-91.
- M. Dębski, K. Junosza-Szaniawski, M. Śleszyńska-Nowak: Strong chromatic index of K1,t-free graphs, Discrete Applied Mathematics 284 (2020), 53-60.
- A. A. Diwan, B. Roy: On colouring point visibility graphs, Discrete Applied Mathematics 286 (2020), 78-90.
- F. Dross, F. Foucaud, V. Mitsou, P. Ochem, T. Pierron: Complexity of planar signed graph homomorphisms to cycles, Discrete Applied Mathematics 284 (2020), 166-178.
- Z. Dvořák, D. Kráľ, R. Thomas: Three-coloring triangle-free graphs on surfaces III. Graphs of girth five, Journal of Combinatorial Theory Series B 145 (2020), 376-432.
- J. Gajarský, P. Hliněný, D. Lokshtanov, J. Obdržálek, M.S. Ramanujan: A New Perspective on FO Model Checking of Dense Graph Classes, ACM Transactions on Computational Logic 21 (2020), article no. 28, 23pp.
- A. Grzesik, D. Kráľ, L. M. Lovász: Elusive extremal graphs, Proceedings of the LMS 121 (2020), 1685-1736.
- R. Kenyon, D. Kráľ, C. Radin, P. Winkler: Permutations with fixed pattern densities, Random Structures and Algorithms 56 (2020), 220-250.
- D. Kráľ, L. M. Lovász, J. A. Noel, J. Sosnovec: Finitely forcible graphons with an almost arbitrary structure, Discrete Analysis 2020:9, 36pp.
Recenzované sborníky konferencí
- D. Agaoglu, P. Hliněný: Isomorphism Problem for Sd-graphs, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS'20), LIPIcs vol. 170 (2020), article no. 14, 14pp.
- O. Cagirici: On Embeddability of Unit Disk Graphs onto Straight Lines, 15th International Computer Science Symposium in Russia (CSR'20), LNCS vol. 12159 (2020), 184-197.
- T. F. N. Chan, J. W. Cooper, M. Koutecký, D. Kráľ, K. Pekárková: Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming, 47th International Colloquium Automata, Languages and Programming (ICALP'20), LIPIcs vol. 168 (2020), article no. 26, 19pp.
- M. Dębski, S. Felsner, P. Micek, F. Schröder: Improved bounds for centered colorings, 31st ACM-SIAM Symposium on Discrete Algorithms (SODA'20), 2212-2226.