Karolina Okrasa

Orcid: 0000-0003-1414-3507

According to our database1, Karolina Okrasa authored at least 20 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tree decompositions meet induced matchings: beyond Max Weight Independent Set.
CoRR, 2024

2023
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs.
Algorithmica, May, 2023

2022
On objects dual to tree-cut decompositions.
J. Comb. Theory, Ser. B, 2022

Tuza's Conjecture for Threshold Graphs.
Discret. Math. Theor. Comput. Sci., 2022

On digraphs without onion star immersions.
CoRR, 2022

Vertex Deletion into Bipartite Permutation Graphs.
Algorithmica, 2022

Computing List Homomorphisms in Geometric Intersection Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

The Complexity of k-Means Clustering when Little is Known.
Proceedings of the International Conference on Machine Learning, 2022

Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs.
SIAM J. Comput., 2021

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
Algorithmica, 2021

Complexity of the List Homomorphism Problem in Hereditary Graph Classes.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020
Subexponential algorithms for variants of the homomorphism problem in string graphs.
J. Comput. Syst. Sci., 2020

Sparsification Lower Bounds for List H-Coloring.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
H-colouring Pt-free graphs in subexponential time.
Discret. Appl. Math., 2019

2018
Intersecting edge distinguishing colorings of hypergraphs.
CoRR, 2018


  Loading...