Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. - Karolina Okrasa; Marta Piecyk; Pawel Rzazewski (ESA, 2020)

Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. - Marta Piecyk; Pawel Rzazewski (STACS, 2021)

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 (ISAAC, 2022)

Faster 3-Coloring of Small-Diameter Graphs. - Michal Debski; Marta Piecyk; Pawel Rzazewski (SIAM J. Discret. Math., 2022)

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)

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 (ICALP, 2024)

C_{2k+1}-Coloring of Bounded-Diameter Graphs. - Marta Piecyk (MFCS, 2024)

Graph Reconstruction with Connectivity Queries. - Kacper Kluk; Hoang La; Marta Piecyk (WG, 2024)

C2k+1-coloring of bounded-diameter graphs. - Marta Piecyk (CoRR, 2024)

Kernelization for list H-coloring for graphs with small vertex cover. - Marta Piecyk; Astrid Pieterse; Pawel Rzazewski; Magnus Wahlström (CoRR, 2025)

On Approximate MMS Allocations on Restricted Graph Classes. - Václav Blazej; Michal Debski; Zbigniew Lonc; Marta Piecyk; Pawel Rzazewski (CoRR, 2025)