Michal Wlodarczyk

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 50

Top Topics

Parameterized Complexity

Tree Decompositions

Top Venues

Publications

Bart M. P. Jansen, Michal Wlodarczyk
Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory 16 (1) (2024)
Michal Wlodarczyk, Meirav Zehavi
Planar Disjoint Paths, Treewidth, and Kernels. FOCS (2023)
Michal Wlodarczyk, Meirav Zehavi
Planar Disjoint Paths, Treewidth, and Kernels. CoRR (2023)
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR (2023)
Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC (2023)
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. CoRR (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. ISAAC (2023)
Michal Wlodarczyk
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. CoRR (2023)
Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR (2023)
Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
Sidestepping Barriers for Dominating Set in Parameterized Complexity. CoRR (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA (2023)
Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. ESA (2023)
Michal Wlodarczyk
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. ICALP (2023)
Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR (2023)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes. CoRR (2023)
Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. Algorithmica 84 (11) (2022)
Bart M. P. Jansen, Michal Wlodarczyk
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. STOC (2022)
Bart M. P. Jansen, Michal Wlodarczyk
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. CoRR (2022)
Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. IPEC (2021)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Vertex Deletion Parameterized by Elimination Distance and Even Less. CoRR (2021)
Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
On the Hardness of Compressing Weights. MFCS (2021)
Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
Vertex deletion parameterized by elimination distance and even less. STOC (2021)
Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
On the Hardness of Compressing Weights. CoRR (2021)
Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. CoRR (2021)
Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk
To Close Is Easier Than To Open: Dual Parameterization To k-Median. CoRR (2020)
Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk
To Close Is Easier Than To Open: Dual Parameterization To k-Median. WAOA (2020)
Bart M. P. Jansen, Michal Wlodarczyk
Optimal Polynomial-Time Compression for Boolean Max CSP. ESA (2020)
Michal Wlodarczyk
Parameterized Inapproximability for Steiner Orientation by Gap Amplification. ICALP (2020)
Bart M. P. Jansen, Michal Wlodarczyk
Optimal polynomial-time compression for Boolean Max CSP. CoRR (2020)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms 15 (1) (2019)
Marek Adamczyk, Michal Wlodarczyk
Multi-dimensional mechanism design via random order contention resolution schemes. SIGecom Exch. 17 (2) (2019)
Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
A Subquadratic Approximation Scheme for Partition. SODA (2019)
Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
Constant-Factor FPT Approximation for Capacitated k-Median. ESA (2019)
Michal Wlodarczyk
Clifford Algebras Meet Tree Decompositions. Algorithmica 81 (2) (2019)
Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
Losing Treewidth by Separating Subsets. SODA (2019)
Michal Wlodarczyk
Inapproximability within W[1]: the case of Steiner Orientation. CoRR (2019)
Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk
Connected Components at Scale via Local Contractions. CoRR (2018)
Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
Subquadratic Approximation Scheme for Partition. CoRR (2018)
Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
Losing Treewidth by Separating Subsets. CoRR (2018)
Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
Constant factor FPT approximation for capacitated k-median. CoRR (2018)
Marek Adamczyk, Michal Wlodarczyk
Random Order Contention Resolution Schemes. CoRR (2018)
Marek Adamczyk, Michal Wlodarczyk
Random Order Contention Resolution Schemes. FOCS (2018)
Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP (2017)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On problems equivalent to (min, +)-convolution. CoRR (2017)
Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR (2017)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On Problems Equivalent to (min, +)-Convolution. ICALP (2017)
Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk
Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO (2017)
Michal Wlodarczyk
Clifford algebras meet tree decompositions. CoRR (2016)
Michal Wlodarczyk
Clifford Algebras Meet Tree Decompositions. IPEC (2016)
Karol Nienaltowski, Michal Wlodarczyk, Tomasz Lipniacki, Michal Komorowski
Clustering reveals limits of parameter identifiability in multi-parameter models of biochemical dynamics. BMC Syst. Biol. 9 (2015)
Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. 115 (2) (2015)
Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR (2014)