Marta Piecyk

Orcid: 0000-0001-9162-8300

According to our database1, Marta Piecyk authored at least 9 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph Reconstruction with Connectivity Queries.
CoRR, 2024

C<sub>2k+1</sub>-coloring of bounded-diameter graphs.
CoRR, 2024

C_{2k+1}-Coloring of Bounded-Diameter Graphs.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters.
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.
CoRR, 2023

2022
Faster 3-Coloring of Small-Diameter Graphs.
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.
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.
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.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020


  Loading...