Follow
Michal Wlodarczyk
Michal Wlodarczyk
Verified email at mimuw.edu.pl - Homepage
Title
Cited by
Cited by
Year
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
862019
Random order contention resolution schemes
M Adamczyk, M Włodarczyk
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
372018
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
332019
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
332017
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
312018
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
302021
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
272019
Connected components at scale via local contractions
J Łącki, V Mirrokni, M Włodarczyk
arXiv preprint arXiv:1807.10727, 2018
222018
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-9, 2015
182015
Clifford algebras meet tree decompositions
M Włodarczyk
Algorithmica 81, 497-518, 2019
152019
Parameterized inapproximability for steiner orientation by gap amplification
M Włodarczyk
47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
8*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
82017
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
BMP Jansen, M Włodarczyk
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
62022
Long Directed Detours: Reduction to -Disjoint Paths
A Jacob, M Włodarczyk, M Zehavi
arXiv preprint arXiv:2301.06105, 2023
32023
Preprocessing for outerplanar vertex deletion: An elementary kernel of quartic size
H Donkers, BMP Jansen, M Włodarczyk
Algorithmica 84 (11), 3407-3458, 2022
32022
To Close Is Easier Than To Open: Dual Parameterization To k-Median
J Byrka, S Dudycz, P Manurangsi, J Marcinkowski, M Włodarczyk
Approximation and Online Algorithms: 18th International Workshop, WAOA 2020 …, 2021
22021
Optimal polynomial-time compression for Boolean Max CSP
BMP Jansen, M Włodarczyk
28th Annual European Symposium on Algorithms (ESA 2020), 2020
22020
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
22015
Planar disjoint paths, treewidth, and kernels
M Włodarczyk, M Zehavi
arXiv preprint arXiv:2307.06792, 2023
12023
Multi-dimensional mechanism design via random order contention resolution schemes
M Adamczyk, M Włodarczyk
ACM SIGecom Exchanges 17 (2), 46-53, 2020
12020
The system can't perform the operation now. Try again later.
Articles 1–20