Reconfiguration over Tree Decompositions. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Marcin Wrochna (IPEC, 2014)

Reconfiguring Independent Sets in Claw-Free Graphs. - Paul S. Bonsma; Marcin Kaminski 001; Marcin Wrochna (SWAT, 2014)

Reconfiguration in bounded bandwidth and treedepth. - Marcin Wrochna (CoRR, 2014)

Edge Bipartization faster than 2k. - Marcin Pilipczuk; Michal Pilipczuk; Marcin Wrochna (CoRR, 2015)

Edge Bipartization Faster Than 2^k. - Marcin Pilipczuk; Michal Pilipczuk; Marcin Wrochna (IPEC, 2016)

Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. - Bart M. P. Jansen; Marcin Pilipczuk; Marcin Wrochna (IPEC, 2017)

Square-free graphs are multiplicative. - Marcin Wrochna (J. Comb. Theory B, 2017)

Polynomial Kernelization for Removing Induced Claws and Diamonds. - Marek Cygan; Marcin Pilipczuk; Michal Pilipczuk; Erik Jan van Leeuwen; Marcin Wrochna (Theory Comput. Syst., 2017)

On Directed Feedback Vertex Set Parameterized by Treewidth. - Marthe Bonamy; Lukasz Kowalik; Jesper Nederlof; Michal Pilipczuk; Arkadiusz Socala; Marcin Wrochna (WG, 2018)

Reconfiguration in bounded bandwidth and tree-depth. - Marcin Wrochna (J. Comput. Syst. Sci., 2018)

Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. - Fedor V. Fomin; Daniel Lokshtanov; Saket Saurabh 001; Michal Pilipczuk; Marcin Wrochna (ACM Trans. Algorithms, 2018)

On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. - Michal Pilipczuk; Marcin Wrochna (ACM Trans. Comput. Theory, 2018)

Integer Programming and Incidence Treedepth. - Eduard Eiben; Robert Ganian; Dusan Knop; Sebastian Ordyniak; Michal Pilipczuk; Marcin Wrochna (IPCO, 2019)

Cutwidth: Obstructions and Algorithmic Aspects. - Archontia C. Giannopoulou; Michal Pilipczuk; Jean-Florent Raymond; Dimitrios M. Thilikos; Marcin Wrochna (Algorithmica, 2019)

Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor. - Bart M. P. Jansen; Marcin Pilipczuk; Marcin Wrochna (Algorithmica, 2019)

Edge Bipartization Faster than $$2^k$$ 2 k. - Marcin Pilipczuk; Michal Pilipczuk; Marcin Wrochna (Algorithmica, 2019)

Improved hardness for H-colourings of G-colourable graphs. - Marcin Wrochna; Stanislav Zivný (CoRR, 2019)

The step Sidorenko property and non-norming edge-transitive graphs. - Daniel Král'; Taísa L. Martins; Péter Pál Pach; Marcin Wrochna (J. Comb. Theory A, 2019)

On inverse powers of graphs and topological implications of Hedetniemi's conjecture. - Marcin Wrochna (J. Comb. Theory B, 2019)

Hedetniemi's Conjecture and Strongly Multiplicative Graphs. - Claude Tardif; Marcin Wrochna (SIAM J. Discret. Math., 2019)

Tight Lower Bounds for the Complexity of Multicoloring. - Marthe Bonamy; Lukasz Kowalik; Michal Pilipczuk; Arkadiusz Socala; Marcin Wrochna (ACM Trans. Comput. Theory, 2019)

PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions. - Marcin Wrochna (IPEC, 2020)

Improved hardness for H-colourings of G-colourable graphs. - Marcin Wrochna; Stanislav Zivný (SODA, 2020)

Sallow: a heuristic algorithm for treedepth decompositions. - Marcin Wrochna (CoRR, 2020)

The Power of the Combined Basic LP and Affine Relaxation for Promise CSPs. - Joshua Brakensiek; Venkatesan Guruswami; Marcin Wrochna; Stanislav Zivný (Electron. Colloquium Comput. Complex., 2020)

The Power of the Combined Basic Linear Programming and Affine Relaxation for Promise Constraint Satisfaction Problems. - Joshua Brakensiek; Venkatesan Guruswami; Marcin Wrochna; Stanislav Zivný (SIAM J. Comput., 2020)

Homomorphism Reconfiguration via Homotopy. - Marcin Wrochna (SIAM J. Discret. Math., 2020)

Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. - Dusan Knop; Michal Pilipczuk; Marcin Wrochna (ACM Trans. Comput. Theory, 2020)

Treewidth-Pliability and PTAS for Max-CSPs. - Miguel Romero 001; Marcin Wrochna; Stanislav Zivný (SODA, 2021)

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. - Archontia C. Giannopoulou; Michal Pilipczuk; Jean-Florent Raymond; Dimitrios M. Thilikos; Marcin Wrochna (SIAM J. Discret. Math., 2021)

The Complexity of Promise SAT on Non-Boolean Domains. - Alex Brandts; Marcin Wrochna; Stanislav Zivný (ACM Trans. Comput. Theory, 2021)

A note on hardness of promise hypergraph colouring. - Marcin Wrochna (CoRR, 2022)

Topology and Adjunction in Promise Constraint Satisfaction. - Andrei A. Krokhin; Jakub Oprsal; Marcin Wrochna; Stanislav Zivný (SIAM J. Comput., 2023)

PTAS for Sparse General-valued CSPs. - Balázs F. Mezei; Marcin Wrochna; Stanislav Zivný (ACM Trans. Algorithms, 2023)

Pliability and Approximating Max-CSPs. - Miguel Romero 001; Marcin Wrochna; Stanislav Zivný (J. ACM, 2023)

Complexity of Approximate Conflict-Free, Linearly-Ordered, and Nonmonochromatic Hypergraph Colourings. - Tamio-Vesa Nakajima; Zephyr Verwimp; Marcin Wrochna; Stanislav Zivný (ICALP, 2025)