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 | 26 | 2019 |

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 | 23 | 2020 |

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 | 17 | 2021 |

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 | 15 | 2020 |

Vertex deletion into bipartite permutation graphs Ł Bożyk, J Derbisz, T Krawczyk, J Novotná, K Okrasa Algorithmica 84 (8), 2271-2291, 2022 | 8 | 2022 |

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 | 7 | 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 | 7 | 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 | 7 | 2021 |

Complexity of the list homomorphism problem in hereditary graph classes K Okrasa, P Rzążewski arXiv preprint arXiv:2010.03393, 2020 | 6 | 2020 |

Max Weight Independent Set in graphs with no long claws: An analog of the Gy\'arf\'as' path argument K Majewski, T Masařík, J Novotná, K Okrasa, M Pilipczuk, P Rzążewski, ... arXiv preprint arXiv:2203.04836, 2022 | 5 | 2022 |

Sparsification Lower Bounds for List -Coloring H Chen, BMP Jansen, K Okrasa, A Pieterse, P Rzążewski arXiv preprint arXiv:2009.08353, 2020 | 4 | 2020 |

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 | 3 | 2022 |

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 | 2 | 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 | 2 | 2022 |

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 | 1 | 2022 |

The complexity of connectivity problems in forbidden-transition graphs and edge-colored graphs T Bellitto, S Li, K Okrasa, M Pilipczuk, M Sorge arXiv preprint arXiv:2009.12892, 2020 | 1 | 2020 |

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 | | 2023 |

On digraphs without onion star immersions Ł Bożyk, O Defrain, K Okrasa, M Pilipczuk arXiv preprint arXiv:2211.15477, 2022 | | 2022 |

14th International Symposium on Parameterized and Exact Computation (IPEC 2019) BA Berendsohn, L Kozma, D Marx, S Bessy, M Bougeret, ADA Carneiro, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2019 | | 2019 |

Intersecting edge distinguishing colorings of hypergraphs K Okrasa, P Rzążewski arXiv preprint arXiv:1804.10470, 2018 | | 2018 |