Intersecting edge distinguishing colorings of hypergraphs. - Karolina Okrasa; Pawel Rzazewski (CoRR, 2018)

H-colouring Pt-free graphs in subexponential time. - Carla Groenland; Karolina Okrasa; Pawel Rzazewski; Alex D. Scott; Paul D. Seymour; Sophie Spirkl (Discret. Appl. Math., 2019)

Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. - Karolina Okrasa; Marta Piecyk; Pawel Rzazewski (ESA, 2020)

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (ISAAC, 2020)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ISAAC, 2020)

Subexponential algorithms for variants of the homomorphism problem in string graphs. - Karolina Okrasa; Pawel Rzazewski (J. Comput. Syst. Sci., 2020)

Complexity of the List Homomorphism Problem in Hereditary Graph Classes. - Karolina Okrasa; Pawel Rzazewski (STACS, 2021)

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. - Jana Novotná 001; Karolina Okrasa; Michal Pilipczuk; Pawel Rzazewski; Erik Jan van Leeuwen; Bartosz Walczak (Algorithmica, 2021)

Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs. - Karolina Okrasa; Pawel Rzazewski (SIAM J. Comput., 2021)

The Complexity of k-Means Clustering when Little is Known. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ICML, 2022)

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. - Michal Debski; Zbigniew Lonc; Karolina Okrasa; Marta Piecyk; Pawel Rzazewski (ISAAC, 2022)

Computing List Homomorphisms in Geometric Intersection Graphs. - Sándor Kisfaludi-Bak; Karolina Okrasa; Pawel Rzazewski (WG, 2022)

Vertex Deletion into Bipartite Permutation Graphs. - Lukasz Bozyk; Jan Derbisz; Tomasz Krawczyk; Jana Novotná 001; Karolina Okrasa (Algorithmica, 2022)

On digraphs without onion star immersions. - Lukasz Bozyk; Oscar Defrain; Karolina Okrasa; Michal Pilipczuk (CoRR, 2022)

Tuza's Conjecture for Threshold Graphs. - Marthe Bonamy; Lukasz Bozyk; Andrzej Grzesik; Meike Hatzel; Tomás Masarík; Jana Novotná 001; Karolina Okrasa (Discret. Math. Theor. Comput. Sci., 2022)

On objects dual to tree-cut decompositions. - Lukasz Bozyk; Oscar Defrain; Karolina Okrasa; Michal Pilipczuk (J. Comb. Theory B, 2022)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ACM Trans. Comput. Theory, 2023)

The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. - Thomas Bellitto; Shaohua Li 005; Karolina Okrasa; Marcin Pilipczuk; Manuel Sorge (Algorithmica, 2023)

Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. - Paloma T. Lima; Martin Milanic; Peter Mursic; Karolina Okrasa; Pawel Rzazewski; Kenny Storgel (ESA, 2024)

Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. - Jan Goedgebeur; Jorik Jooken; Karolina Okrasa; Pawel Rzazewski; Oliver Schaudt (MFCS, 2024)

Erdös-Pósa property of tripods in directed graphs. - Marcin Brianski; Meike Hatzel; Karolina Okrasa; Michal Pilipczuk (CoRR, 2024)

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. - Konrad Majewski; Tomás Masarík; Jana Masaríková; Karolina Okrasa; Marcin Pilipczuk; Pawel Rzazewski; Marek Sokolowski 001 (ACM Trans. Comput. Theory, 2024)

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. - Robert Ganian; Thekla Hamm; Viktoriia Korchemna; Karolina Okrasa; Kirill Simonov (ACM Trans. Algorithms, 2024)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa. - Benjamin Bedert; Tamio-Vesa Nakajima; Karolina Okrasa; Stanislav Zivný (CoRR, 2025)