Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Michał Włodarczyk
Observed names:
M Włodarczyk,
Michal Wlodarczyk,
Michal Włodarczyk,
Wlodarczyk, Michal,
Włodarczyk, Michał
Institution:
University of Warsaw
Observed institutions:
Ben-Gurion University of the Negev,
National Science Centre,
University of Warsaw,
Eindhoven University of Technology
ORCID:
0000-0003-0968-8414
Observed ORCID:
0000-0003-0968-8414
OpenAlex ID:
A5103139616
Works
59
Awards
2
Vertex deletion parameterized by elimination distance and even less
2021
·
Bart M. P. Jansen
, Jari J. H. de Kroon
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
59
PDF
Evacuation from a Disc in the Presence of a Faulty Robot
2017
·
Jurek Czyzowicz
, Konstantinos Georgiou
, et al.
·
Lecture notes in computer science
·
52
A Subquadratic Approximation Scheme for Partition
2019
·
Marcin Mucha
, Karol Węgrzycki
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
49
PDF
Random Order Contention Resolution Schemes
2018
·
Marek Adamczyk
, Michal Wlodarczyk
·
Annual Symposium on Foundations of Computer Science
·
47
PDF
Losing Treewidth by Separating Subsets
2019
·
Anupam Gupta
, Euiwoong Lee
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
43
Random Order Contention Resolution Schemes
2018
·
Włodarczyk, Michał
, Adamczyk, Marek
·
ReIn UW (University of Warsaw)
·
36
Connected Components at Scale via Local Contractions
2018
·
Łącki, Jakub
, Mirrokni, Vahab
, et al.
·
arXiv (Cornell University)
·
28
PDF
Constant factor FPT approximation for capacitated k-median
2018
·
Adamczyk, Marek
, Byrka, Jarosław
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
26
PDF
Clifford Algebras Meet Tree Decompositions
2018
·
Michał Włodarczyk
·
Algorithmica
·
21
PDF
Losing Treewidth by Separating Subsets
2018
·
Gupta, Anupam
, Lee, Euiwoong
, et al.
·
arXiv (Cornell University)
·
20
PDF
Clustering reveals limits of parameter identifiability in multi-parameter models of biochemical dynamics
2015
·
Karol Nienałtowski
, Michał Włodarczyk
, et al.
·
BMC Systems Biology
·
20
PDF
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
2022
·
Bart M. P. Jansen
, Michał Włodarczyk
·
ACM Symposium on Theory of Computing (STOC)
·
15
PDF
Planar Disjoint Paths, Treewidth, and Kernels
2023
·
Michał Włodarczyk
, Meirav Zehavi
·
Annual Symposium on Foundations of Computer Science
·
14
PDF
Parameterized Inapproximability for Steiner Orientation by Gap Amplification
2019
·
Włodarczyk, Michał
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
14
PDF
Optimal Polynomial-Time Compression for Boolean Max CSP
2023
·
Bart M. P. Jansen
, Michał Włodarczyk
·
ACM Transactions on Computation Theory
·
13
PDF
On Problems Equivalent to (min,+)-Convolution
2017
·
Cygan, Marek
, Mucha, Marcin
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
13
PDF
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
2022
·
Huib Donkers
, Bart M. P. Jansen
, et al.
·
Algorithmica
·
12
PDF
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion
2025
·
Bart M. P. Jansen
, Michał Włodarczyk
·
SIAM Journal on Computing
·
9
Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
2026
·
Michał Pilipczuk
, Giannos Stamoulis
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
8
PDF
When the Optimum is also Blind: a New Perspective on Universal Optimization
2017
·
Adamczyk, Marek
, Grandoni, Fabrizio
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
8
PDF
Long directed detours: Reduction to 2-Disjoint Paths
2024
·
Ashwin Jacob
, Michał Włodarczyk
, et al.
·
Information Processing Letters
·
7
PDF
Losing Treewidth In The Presence Of Weights
2025
·
Michal Włodarczyk
·
Society for Industrial and Applied Mathematics eBooks
·
5
PDF
Single-exponential FPT algorithms for enumerating secluded F -free subgraphs and deleting to scattered graph classes
2024
·
Bart M.P. Jansen
, Jari J.H. de Kroon
, et al.
·
Journal of Computer and System Sciences
·
4
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large
2023
·
Jacob, Ashwin
, Włodarczyk, Michał
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
On the Hardness of Compressing Weights
2021
·
Jansen, Bart M. P.
, Roy, Shivesh K.
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
4
PDF
Show more works
View as search
Works count:
59
Citation count:
572
H-index:
14
I10-index:
17
Year
Topic
Type