On problems equivalent to (min,+)-convolution M Cygan, M Mucha, K Węgrzycki, M Włodarczyk ACM Transactions on Algorithms (TALG) 15 (1), 1-25, 2019 | 56 | 2019 |

Evacuation from a disc in the presence of a faulty robot J Czyzowicz, K Georgiou, M Godon, E Kranakis, D Krizanc, W Rytter, ... International Colloquium on Structural Information and Communication …, 2017 | 27 | 2017 |

Random order contention resolution schemes M Adamczyk, M Włodarczyk 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 25 | 2018 |

A subquadratic approximation scheme for partition M Mucha, K Węgrzycki, M Włodarczyk Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 22 | 2019 |

Constant factor FPT approximation for capacitated k-median M Adamczyk, J Byrka, J Marcinkowski, SM Meesum, M Włodarczyk 27th Annual European Symposium on Algorithms (ESA 2019), 2018 | 21 | 2018 |

Losing treewidth by separating subsets A Gupta, E Lee, J Li, P Manurangsi, M Włodarczyk Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 19 | 2019 |

Connected components at scale via local contractions J Łącki, V Mirrokni, M Włodarczyk arXiv preprint arXiv:1807.10727, 2018 | 17 | 2018 |

Clustering reveals limits of parameter identifiability in multi-parameter models of biochemical dynamics K Nienałtowski, M Włodarczyk, T Lipniacki, M Komorowski BMC systems biology 9 (1), 1-9, 2015 | 17 | 2015 |

Vertex deletion parameterized by elimination distance and even less BMP Jansen, JJH de Kroon, M Włodarczyk Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 14 | 2021 |

Clifford algebras meet tree decompositions M Włodarczyk Algorithmica 81 (2), 497-518, 2019 | 13 | 2019 |

Parameterized inapproximability for steiner orientation by gap amplification M Włodarczyk 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 6* | 2019 |

When the Optimum is also Blind: a New Perspective on Universal Optimization M Adamczyk, F Grandoni, S Leonardi, M Wlodarczyk 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 5 | 2017 |

Optimal polynomial-time compression for Boolean Max CSP BMP Jansen, M Włodarczyk 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 2 | 2020 |

An LP-rounding 22-approximation for restricted maximum acyclic subgraph F Grandoni, T Kociumaka, M Włodarczyk Information Processing Letters 115 (2), 182-185, 2015 | 2 | 2015 |

To Close Is Easier Than To Open: Dual Parameterization To *k*-MedianJ Byrka, S Dudycz, P Manurangsi, J Marcinkowski, M Włodarczyk International Workshop on Approximation and Online Algorithms, 113-126, 2020 | 1 | 2020 |

Preprocessing for outerplanar vertex deletion: An elementary kernel of quartic size H Donkers, BMP Jansen, M Włodarczyk Algorithmica, 1-52, 2022 | | 2022 |

Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion BMP Jansen, M Włodarczyk arXiv preprint arXiv:2202.02174, 2022 | | 2022 |

On the Hardness of Compressing Weights BMP Jansen, SK Roy, M Włodarczyk arXiv preprint arXiv:2107.02554, 2021 | | 2021 |

Multi-dimensional mechanism design via random order contention resolution schemes M Adamczyk, M Włodarczyk ACM SIGecom Exchanges 17 (2), 46-53, 2020 | | 2020 |

Approximation algorithms: new results for stochastic and parameterized problems M Włodarczyk | | 2019 |