E-LIB Suche - Ergebnisse für: Okrasa, Karolina

1

Max Weight Independent Set in Graphs with No Long Claws: An..:

Majewski, Konrad ; Masařík, Tomáš ; Masaříková, Jana...
ACM Transactions on Computation Theory. 16 (2024) 2 - p. 1-18 , 2024

Link: https://doi.org/10.1145/..

2

The Fine-Grained Complexity of Graph Homomorphism Parameter..:

Ganian, Robert ; Hamm, Thekla ; Korchemna, Viktoriia..
ACM Transactions on Algorithms. 20 (2024) 3 - p. 1-26 , 2024

Link: https://doi.org/10.1145/..

3

Sparsification Lower Bounds for ListH-Coloring:

Chen, Hubie ; Jansen, Bart M. P. ; Okrasa, Karolina..
ACM Transactions on Computation Theory. 15 (2023) 3-4 - p. 1-23 , 2023

Link: https://doi.org/10.1145/..

4

Tuza's Conjecture for Threshold Graphs:

Bonamy, Marthe ; Bożyk, Łukasz ; Grzesik, Andrzej...
Discrete Mathematics & Theoretical Computer Science. 24, no. 1 (2022) Graph Theory - p. , 2022

Link: https://doi.org/10.46298..

5

The Complexity of Routing Problems in Forbidden-Transition ..:

Bellitto, Thomas ; Li, Shaohua ; Okrasa, Karolina..
Algorithmica. 85 (2022) 5 - p. 1202-1250 , 2022

Link: https://doi.org/10.1007/..

6

Computing List Homomorphisms in Geometric Intersection Grap..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Kisfaludi-Bak, Sándor ; Okrasa, Karolina ; Rzążewski, Paweł - p. 313-327 , 2022

Link: https://doi.org/10.1007/..

7

Vertex Deletion into Bipartite Permutation Graphs:

Bożyk, Łukasz ; Derbisz, Jan ; Krawczyk, Tomasz..
Algorithmica. 84 (2022) 8 - p. 2271-2291 , 2022

Link: https://doi.org/10.1007/..

8

On objects dual to tree-cut decompositions:

Bożyk, Łukasz ; Defrain, Oscar ; Okrasa, Karolina.
Journal of Combinatorial Theory, Series B. 157 (2022) - p. 401-428 , 2022

Link: https://doi.org/10.1016/..

9

Fine-Grained Complexity of the Graph Homomorphism Problem f..:

Okrasa, Karolina ; Rzaͅżewski, Paweł
SIAM Journal on Computing. 50 (2021) 2 - p. 487-508 , 2021

Link: https://doi.org/10.1137/..

10

Tuza's Conjecture for Threshold Graphs:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,

Bonamy, Marthe ; Bożyk, Łukasz ; Grzesik, Andrzej... - p. 765-771 , 2021

Link: https://doi.org/10.1007/..

11

Subexponential-Time Algorithms for Finding Large Induced Sp..:

Novotná, Jana ; Okrasa, Karolina ; Pilipczuk, Michał...
Algorithmica. 83 (2020) 8 - p. 2634-2650 , 2020

Link: https://doi.org/10.1007/..

12

Fine-grained complexity of graph homomorphism problem for b..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Okrasa, Karolina ; Rzążewski, Paweł - p. 1578-1590 , 2020

Link: https://dl.acm.org/doi/1..

13

Subexponential algorithms for variants of the homomorphism ..:

Okrasa, Karolina ; Rzążewski, Paweł
Journal of Computer and System Sciences. 109 (2020) - p. 126-144 , 2020

Link: https://doi.org/10.1016/..

14

H-colouring Pt-free graphs in subexponential time:

Groenland, Carla ; Okrasa, Karolina ; Rzążewski, Paweł...
Discrete Applied Mathematics. 267 (2019) - p. 184-189 , 2019

Link: https://doi.org/10.1016/..

15

Subexponential Algorithms for Variants of Homomorphism Prob..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Okrasa, Karolina ; Rzążewski, Paweł - p. 1-13 , 2019

Link: https://doi.org/10.1007/..