| 2026 | ESA | Dynamic Detours. | Daniel Dadush, Michal Pilipczuk, Amadeus Reinald, Marek Sokolowski, Michal Wlodarczyk |
| 2026 | SODA | Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. | Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk |
| 2026 | STACS | Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors. | Roohani Sharma, Michal Wlodarczyk |
| 2026 | WG | Optimal Path Partitions in Subcubic and Almost-Subcubic Graphs. | Toms Masark, Michal Wlodarczyk, Mehmet Akif Yildiz |
| 2025 | ESA | Going Beyond Surfaces in Diameter Approximation. | Michal Wlodarczyk |
| 2025 | SODA | Losing Treewidth In The Presence Of Weights. | Michal Wlodarczyk |
| 2024 | ISAAC | Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-Hard. | Michal Wlodarczyk |
| 2024 | ISAAC | Does Subset Sum Admit Short Proofs? | Michal Wlodarczyk |
| 2023 | ESA | Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. | Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi |
| 2023 | ESA | 5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2023 | FOCS | Planar Disjoint Paths, Treewidth, and Kernels. | Michal Wlodarczyk, Meirav Zehavi |
| 2023 | ICALP | Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. | Michal Wlodarczyk |
| 2023 | ISAAC | Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2022 | STOC | Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. | Bart M. P. Jansen, Michal Wlodarczyk |
| 2021 | MFCS | On the Hardness of Compressing Weights. | Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk |
| 2021 | STOC | Vertex deletion parameterized by elimination distance and even less. | Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk |
| 2020 | ESA | Optimal Polynomial-Time Compression for Boolean Max CSP. | Bart M. P. Jansen, Michal Wlodarczyk |
| 2020 | ICALP | Parameterized Inapproximability for Steiner Orientation by Gap Amplification. | Michal Wlodarczyk |
| 2020 | WAOA | To Close Is Easier Than To Open: Dual Parameterization To k-Median. | Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk |
| 2019 | ESA | Constant-Factor FPT Approximation for Capacitated k-Median. | Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk |
| 2019 | SODA | Losing Treewidth by Separating Subsets. | Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk |
| 2019 | SODA | A Subquadratic Approximation Scheme for Partition. | Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk |
| 2018 | FOCS | Random Order Contention Resolution Schemes. | Marek Adamczyk, Michal Wlodarczyk |
| 2017 | ICALP | When the Optimum is also Blind: a New Perspective on Universal Optimization. | Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk |
| 2017 | ICALP | On Problems Equivalent to (min, +)-Convolution. | Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk |
| 2017 | SIROCCO | Evacuation from a Disc in the Presence of a Faulty Robot. | Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk |