Marta Piecyk

According to our database, Marta Piecyk authored at least 7 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

C_2k+1-coloring of bounded-diameter graphs.

Marta Piecyk

CoRR, 2024

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters.

Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters.

Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski

CoRR, 2023

2022

Faster 3-Coloring of Small-Diameter Graphs.

Michal Debski, Marta Piecyk, Pawel Rzazewski

SIAM J. Discret. Math., September, 2022

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws.

Michal Debski, Zbigniew Lonc, Karolina Okrasa, Marta Piecyk, Pawel Rzazewski

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth.

Marta Piecyk, Pawel Rzazewski

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

2020

Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs.

Karolina Okrasa, Marta Piecyk, Pawel Rzazewski

Proceedings of the 28th Annual European Symposium on Algorithms, 2020