| Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs K Okrasa, P Rzaͅżewski SIAM Journal on Computing 50 (2), 487-508, 2021 | 32 | 2021 |
| Subexponential algorithms for variants of the homomorphism problem in string graphs K Okrasa, P Rzążewski Journal of Computer and System Sciences 109, 126-144, 2020 | 30 | 2020 |
| H-colouring Pt-free graphs in subexponential time C Groenland, K Okrasa, P Rzążewski, A Scott, P Seymour, S Spirkl Discrete Applied Mathematics 267, 184-189, 2019 | 27 | 2019 |
| Full complexity classification of the list homomorphism problem for bounded-treewidth graphs K Okrasa, M Piecyk, P Rzążewski arXiv preprint arXiv:2006.11155, 2020 | 23 | 2020 |
| On objects dual to tree-cut decompositions Ł Bożyk, O Defrain, K Okrasa, M Pilipczuk Journal of Combinatorial Theory, Series B 157, 401-428, 2022 | 14 | 2022 |
| The fine-grained complexity of graph homomorphism parameterized by clique-width R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov arXiv preprint arXiv:2210.06845, 2022 | 14 | 2022 |
| Vertex deletion into bipartite permutation graphs Ł Bożyk, J Derbisz, T Krawczyk, J Novotná, K Okrasa Algorithmica 84 (8), 2271-2291, 2022 | 11 | 2022 |
| Subexponential-time algorithms for finding large induced sparse subgraphs J Novotná, K Okrasa, M Pilipczuk, P Rzążewski, EJ van Leeuwen, ... Algorithmica 83, 2634-2650, 2021 | 10 | 2021 |
| Max weight independent set in graphs with no long claws: An analog of the gyárfás’ path argument K Majewski, T Masařík, J Masaříková, K Okrasa, M Pilipczuk, P Rzążewski, ... ACM Transactions on Computation Theory 16 (2), 1-18, 2024 | 9 | 2024 |
| The complexity of k-means clustering when little is known R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov International Conference on Machine Learning, 6960-6987, 2022 | 8 | 2022 |
| Complexity of the list homomorphism problem in hereditary graph classes K Okrasa, P Rzążewski arXiv preprint arXiv:2010.03393, 2020 | 8 | 2020 |
| Tree decompositions meet induced matchings: beyond Max Weight Independent Set PT Lima, M Milanič, P Muršič, K Okrasa, P Rzążewski, K Štorgel arXiv preprint arXiv:2402.15834, 2024 | 7 | 2024 |
| Sparsification Lower Bounds for List H-Coloring H Chen, BMP Jansen, K Okrasa, A Pieterse, P Rzążewski ACM Transactions on Computation Theory 15 (3-4), 1-23, 2023 | 7 | 2023 |
| Tuza's conjecture for threshold graphs M Bonamy, Ł Bożyk, A Grzesik, M Hatzel, T Masařík, J Novotná, K Okrasa Discrete Mathematics & Theoretical Computer Science 24 (Graph Theory), 2022 | 5 | 2022 |
| Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws M Dębski, Z Lonc, K Okrasa, M Piecyk, P Rzążewski arXiv preprint arXiv:2205.13270, 2022 | 4 | 2022 |
| The complexity of routing problems in forbidden-transition graphs and edge-colored graphs T Bellitto, S Li, K Okrasa, M Pilipczuk, M Sorge Algorithmica 85 (5), 1202-1250, 2023 | 3 | 2023 |
| Computing list homomorphisms in geometric intersection graphs S Kisfaludi-Bak, K Okrasa, P Rzążewski International Workshop on Graph-Theoretic Concepts in Computer Science, 313-327, 2022 | 3 | 2022 |
| The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width R Ganian, T Hamm, V Korchemna, K Okrasa, K Simonov ACM Transactions on Algorithms 20 (3), 1-26, 2024 | 2 | 2024 |
| On digraphs without onion star immersions Ł Bożyk, O Defrain, K Okrasa, M Pilipczuk arXiv preprint arXiv:2211.15477, 2022 | 2 | 2022 |
| Tuza's conjecture for threshold graphs K Okrasa, Ł Bożyk, T Masařík, M Bonamy, M Hatzel, J Novotná, A Grzesik Discrete Mathematics and Theoretical Computer Science, 2022 | 1 | 2022 |
