default search action
Karolina Okrasa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Robert Ganian
, Thekla Hamm
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ACM Trans. Algorithms 20(3): 19 (2024) - [j10]Konrad Majewski
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ACM Trans. Comput. Theory 16(2): 8:1-8:18 (2024) - [c15]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree Decompositions Meet Induced Matchings: Beyond Max Weight Independent Set. ESA 2024: 85:1-85:17 - [c14]Jan Goedgebeur, Jorik Jooken, Karolina Okrasa, Pawel Rzazewski, Oliver Schaudt:
Minimal Obstructions to C₅-Coloring in Hereditary Graph Classes. MFCS 2024: 55:1-55:15 - [i18]Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel:
Tree decompositions meet induced matchings: beyond Max Weight Independent Set. CoRR abs/2402.15834 (2024) - [i17]Marcin Brianski, Meike Hatzel, Karolina Okrasa, Michal Pilipczuk:
Erdös-Pósa property of tripods in directed graphs. CoRR abs/2408.16733 (2024) - 2023
- [j9]Thomas Bellitto, Shaohua Li
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. Algorithmica 85(5): 1202-1250 (2023) - [j8]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa
Sparsification Lower Bounds for List H-Coloring. ACM Trans. Comput. Theory 15(3-4): 8:1-8:23 (2023) - 2022
- [j7]Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná
Vertex Deletion into Bipartite Permutation Graphs. Algorithmica 84(8): 2271-2291 (2022) - [j6]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j5]Lukasz Bozyk
On objects dual to tree-cut decompositions. J. Comb. Theory B 157: 401-428 (2022) - [c13]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. ICALP 2022: 66:1-66:20 - [c12]Konrad Majewski, Tomás Masarík, Jana Novotná, Karolina Okrasa
Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument. ICALP 2022: 93:1-93:19 - [c11]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa, Kirill Simonov:
The Complexity of k-Means Clustering when Little is Known. ICML 2022: 6960-6987 - [c10]Michal Debski, Zbigniew Lonc, Karolina Okrasa
Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws. ISAAC 2022: 14:1-14:16 - [c9]Sándor Kisfaludi-Bak
Computing List Homomorphisms in Geometric Intersection Graphs. WG 2022: 313-327 - [i16]Sándor Kisfaludi-Bak, Karolina Okrasa, Pawel Rzazewski:
Computing list homomorphisms in geometric intersection graphs. CoRR abs/2202.08896 (2022) - [i15]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 abs/2203.04836 (2022) - [i14]Michal Debski, Zbigniew Lonc, Karolina Okrasa
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws. CoRR abs/2205.13270 (2022) - [i13]Robert Ganian, Thekla Hamm, Viktoriia Korchemna, Karolina Okrasa
The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width. CoRR abs/2210.06845 (2022) - [i12]Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On digraphs without onion star immersions. CoRR abs/2211.15477 (2022) - 2021
- [j4]Jana Novotná, Karolina Okrasa
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. Algorithmica 83(8): 2634-2650 (2021) - [j3]Karolina Okrasa
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs. SIAM J. Comput. 50(2): 487-508 (2021) - [c8]Karolina Okrasa
Complexity of the List Homomorphism Problem in Hereditary Graph Classes. STACS 2021: 54:1-54:17 - [i11]Lukasz Bozyk, Oscar Defrain, Karolina Okrasa, Michal Pilipczuk:
On objects dual to tree-cut decompositions. CoRR abs/2103.14667 (2021) - [i10]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík
Tuza's Conjecture for Threshold Graphs. CoRR abs/2105.09871 (2021) - 2020
- [j2]Karolina Okrasa
Subexponential algorithms for variants of the homomorphism problem in string graphs. J. Comput. Syst. Sci. 109: 126-144 (2020) - [c7]Karolina Okrasa
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. ESA 2020: 74:1-74:24 - [c6]Hubie Chen, Bart M. P. Jansen
Sparsification Lower Bounds for List H-Coloring. ISAAC 2020: 58:1-58:17 - [c5]Thomas Bellitto, Shaohua Li
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs. ISAAC 2020: 59:1-59:15 - [c4]Lukasz Bozyk
Vertex Deletion into Bipartite Permutation Graphs. IPEC 2020: 5:1-5:16 - [c3]Karolina Okrasa
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. SODA 2020: 1578-1590 - [i9]Karolina Okrasa, Marta Piecyk, Pawel Rzazewski:
Full complexity classification of the list homomorphism problem for bounded-treewidth graphs. CoRR abs/2006.11155 (2020) - [i8]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. CoRR abs/2009.08353 (2020) - [i7]Thomas Bellitto, Shaohua Li, Karolina Okrasa, Marcin Pilipczuk, Manuel Sorge:
The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs. CoRR abs/2009.12892 (2020) - [i6]Karolina Okrasa, Pawel Rzazewski:
Complexity of the list homomorphism problem in hereditary graph classes. CoRR abs/2010.03393 (2020) - [i5]Lukasz Bozyk, Jan Derbisz, Tomasz Krawczyk, Jana Novotná
Vertex deletion into bipartite permutation graphs. CoRR abs/2010.11440 (2020)
2010 – 2019
- 2019
- [j1]Carla Groenland
H-colouring Pt-free graphs in subexponential time. Discret. Appl. Math. 267: 184-189 (2019) - [c2]Jana Novotná
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. IPEC 2019: 23:1-23:11 - [c1]Karolina Okrasa
Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs. WG 2019: 1-13 - [i4]Karolina Okrasa, Pawel Rzazewski:
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. CoRR abs/1906.08371 (2019) - [i3]Jana Novotná
Subexponential-time algorithms for finding large induced sparse subgraphs. CoRR abs/1910.01082 (2019) - 2018
- [i2]Karolina Okrasa, Pawel Rzazewski:
Intersecting edge distinguishing colorings of hypergraphs. CoRR abs/1804.10470 (2018) - [i1]Karolina Okrasa, Pawel Rzazewski:
Subexponential algorithms for variants of homomorphism problem in string graphs. CoRR abs/1809.09345 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: