Karolina Okrasa

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 40

Top Topics

Independent Set

Routing Problem

Fixed Parameter Tractable

Top Venues

Publications

Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20 (3) (2024)
Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR (2024)
Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS (2024)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica 85 (5) (2023)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP (2022)
Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
Computing list homomorphisms in geometric intersection graphs. CoRR (2022)
Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. ISAAC (2022)
Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski
Computing List Homomorphisms in Geometric Intersection Graphs. WG (2022)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP (2022)
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs. Algorithmica 84 (8) (2022)
Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa, Marcin Pilipczuk, Pawel Rzazewski, Marek Sokolowski
Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument. CoRR (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Complexity of k-Means Clustering when Little is Known. ICML (2022)
Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
On objects dual to tree-cut decompositions. J. Comb. Theory, Ser. B 157 (2022)
Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. CoRR (2022)
Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
On digraphs without onion star immersions. CoRR (2022)
Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws. CoRR (2022)
Karolina Okrasa, Pawel Rzazewski
Complexity of the List Homomorphism Problem in Hereditary Graph Classes. STACS (2021)
Karolina Okrasa, Pawel Rzazewski
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs. SIAM J. Comput. 50 (2) (2021)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83 (8) (2021)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. CoRR (2021)
Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk
On objects dual to tree-cut decompositions. CoRR (2021)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC (2020)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. ISAAC (2020)
Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski
Sparsification Lower Bounds for List H-Coloring. CoRR (2020)
Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR (2020)
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex Deletion into Bipartite Permutation Graphs. IPEC (2020)
Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná, Karolina Okrasa
Vertex deletion into bipartite permutation graphs. CoRR (2020)
Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Full complexity classification of the list homomorphism problem for bounded-treewidth graphs. CoRR (2020)
Karolina Okrasa, Pawel Rzazewski
Complexity of the list homomorphism problem in hereditary graph classes. CoRR (2020)
Karolina Okrasa, Pawel Rzazewski
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. SODA (2020)
Karolina Okrasa, Pawel Rzazewski
Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109 (2020)
Karolina Okrasa, Marta Piecyk, Pawel Rzazewski
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. ESA (2020)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR (2019)
Carla Groenland, Karolina Okrasa, Pawel Rzazewski, Alex D. Scott, Paul D. Seymour, Sophie Spirkl
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267 (2019)
Jana Novotná, Karolina Okrasa, Michal Pilipczuk, Pawel Rzazewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC (2019)
Karolina Okrasa, Pawel Rzazewski
Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. WG (2019)
Karolina Okrasa, Pawel Rzazewski
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. CoRR (2019)
Karolina Okrasa, Pawel Rzazewski
Subexponential algorithms for variants of homomorphism problem in string graphs. CoRR (2018)
Karolina Okrasa, Pawel Rzazewski
Intersecting edge distinguishing colorings of hypergraphs. CoRR (2018)