Karolina Okrasa

48 papers A* 5A 3B 8Journal 32

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