Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Karolina Okrasa
Fine-Grained Complexity of Graph Homomorphism Problem for Bounded-Treewidth Graphs
Related publications
Maximum Induced Forests in Graphs of Bounded Treewidth
Electronic Journal of Combinatorics
Combinatorics
Applied Mathematics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
A Complexity Dichotomy for Hitting Connected Minors on Bounded Treewidth Graphs: The Chair and the Banner Draw the Boundary
Minimum Activation Cost Node-Disjoint Paths in Graphs With Bounded Treewidth
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On Some Fine-Grained Questions in Algorithms and Complexity
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics
Mathematics
Group, Graphs, Algorithms: The Graph Isomorphism Problem
Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems
Linköping Studies in Science and Technology. Dissertations
