An LP-Rounding $2 sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. - Fabrizio Grandoni 001; Tomasz Kociumaka; Michal Wlodarczyk 001 (CoRR, 2014)

Clustering reveals limits of parameter identifiability in multi-parameter models of biochemical dynamics. - Karol Nienaltowski; Michal Wlodarczyk 001; Tomasz Lipniacki; Michal Komorowski (BMC Syst. Biol., 2015)

An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. - Fabrizio Grandoni 001; Tomasz Kociumaka; Michal Wlodarczyk 001 (Inf. Process. Lett., 2015)

When the Optimum is also Blind: a New Perspective on Universal Optimization. - Marek Adamczyk; Fabrizio Grandoni 001; Stefano Leonardi 001; Michal Wlodarczyk 001 (ICALP, 2017)

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 001 (SIROCCO, 2017)

Random Order Contention Resolution Schemes. - Marek Adamczyk; Michal Wlodarczyk 001 (FOCS, 2018)

Connected Components at Scale via Local Contractions. - Jakub Lacki; Vahab S. Mirrokni; Michal Wlodarczyk 001 (CoRR, 2018)

Constant-Factor FPT Approximation for Capacitated k-Median. - Marek Adamczyk; Jaroslaw Byrka; Jan Marcinkowski; Syed Mohammad Meesum; Michal Wlodarczyk 001 (ESA, 2019)

Losing Treewidth by Separating Subsets. - Anupam Gupta 001; Euiwoong Lee; Jason Li 006; Pasin Manurangsi; Michal Wlodarczyk 001 (SODA, 2019)

A Subquadratic Approximation Scheme for Partition. - Marcin Mucha; Karol Wegrzycki; Michal Wlodarczyk 001 (SODA, 2019)

Clifford Algebras Meet Tree Decompositions. - Michal Wlodarczyk 001 (Algorithmica, 2019)

Inapproximability within W[1]: the case of Steiner Orientation. - Michal Wlodarczyk 001 (CoRR, 2019)

Multi-dimensional mechanism design via random order contention resolution schemes. - Marek Adamczyk; Michal Wlodarczyk 001 (SIGecom Exch., 2019)

On Problems Equivalent to (min, +)-Convolution. - Marek Cygan; Marcin Mucha; Karol Wegrzycki; Michal Wlodarczyk 001 (ACM Trans. Algorithms, 2019)

Parameterized Inapproximability for Steiner Orientation by Gap Amplification. - Michal Wlodarczyk 001 (ICALP, 2020)

To Close Is Easier Than To Open: Dual Parameterization To k-Median. - Jaroslaw Byrka; Szymon Dudycz; Pasin Manurangsi; Jan Marcinkowski; Michal Wlodarczyk 001 (WAOA, 2020)

On the Hardness of Compressing Weights. - Bart M. P. Jansen; Shivesh Kumar Roy; Michal Wlodarczyk 001 (MFCS, 2021)

Vertex deletion parameterized by elimination distance and even less. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (STOC, 2021)

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. - Huib Donkers; Bart M. P. Jansen; Michal Wlodarczyk 001 (Algorithmica, 2022)

Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. - Ashwin Jacob; Michal Wlodarczyk 001; Meirav Zehavi (ESA, 2023)

5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (ESA, 2023)

Planar Disjoint Paths, Treewidth, and Kernels. - Michal Wlodarczyk 001; Meirav Zehavi (FOCS, 2023)

Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. - Juhi Chaudhary; Harmender Gahlawat; Michal Wlodarczyk 001; Meirav Zehavi (IPEC, 2023)

Sidestepping Barriers for Dominating Set in Parameterized Complexity. - Ioannis Koutis; Michal Wlodarczyk 001; Meirav Zehavi (IPEC, 2023)

5-Approximation for $ mathcal{H}$-Treewidth Essentially as Fast as $ mathcal{H}$-Deletion Parameterized by Solution Size. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (CoRR, 2023)

Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-Hard. - Michal Wlodarczyk 001 (ISAAC, 2024)

Does Subset Sum Admit Short Proofs? - Michal Wlodarczyk 001 (ISAAC, 2024)

Long directed detours: Reduction to 2-Disjoint Paths. - Ashwin Jacob; Michal Wlodarczyk 001; Meirav Zehavi (Inf. Process. Lett., 2024)

Optimal Polynomial-Time Compression for Boolean Max CSP. - Bart M. P. Jansen; Michal Wlodarczyk 001 (ACM Trans. Comput. Theory, 2024)

Losing Treewidth In The Presence Of Weights. - Michal Wlodarczyk 001 (SODA, 2025)

Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes. - Bart M. P. Jansen; Jari J. H. de Kroon; Michal Wlodarczyk 001 (J. Comput. Syst. Sci., 2025)

Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. - Bart M. P. Jansen; Michal Wlodarczyk 001 (SIAM J. Comput., 2025)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. - Michal Wlodarczyk 001 (Algorithmica, 2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. - Michal Pilipczuk; Giannos Stamoulis; Michal Wlodarczyk 001 (CoRR, 2025)

Going Beyond Surfaces in Diameter Approximation. - Michal Wlodarczyk 001 (CoRR, 2025)