Publications

Michał Włodarczyk

Number of publications: 28

2023

• Michał Włodarczyk , Bart M. P. Jansen, Jari J. H. de Kroon, 5-Approximation for H-Treewidth Essentially as Fast as H-Deletion Parameterized by Solution Size, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023, 274 2023, p. 66:1-66:16. See in PBN
• Michał Włodarczyk , Meirav Zehavi, Ashwin Jacob, Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large, 31st Annual European Symposium on Algorithms, Amsterdam, the Netherlands, 4 September 2023 - 8 September 2023, 274 2023, p. 65:1-65:17. See in PBN
• Michał Włodarczyk , Juhi Chaudhary, Harmender Gahlawat, Meirav Zehavi, Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, the Netherlands, 6 September 2023 - 8 September 2023, 285 2023, p. 10:1-10:22. See in PBN
• Meirav Zehavi, Michał Włodarczyk , Planar Disjoint Paths, Treewidth, and Kernels, 64th IEEE Annual Symposium on Foundations of Computer Science, Santa Cruz, the United States of America, 6 November 2023 - 9 November 2023. See in PBN
• Michał Włodarczyk , Meirav Zehavi, Ioannis Koutis, Sidestepping Barriers for Dominating Set in Parameterized Complexity, 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, the Netherlands, 6 September 2023 - 8 September 2023, 285 2023, p. 31:1-31:17. See in PBN
• Michał Włodarczyk , Bart M. P. Jansen, Jari J. H. de Kroon, Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes, The 34th International Symposium on Algorithms and Computation (ISAAC 2023), Kyoto, Japan, 4 December 2023 - 6 December 2023, 283 2023, p. 42:1-42:18. See in PBN
• Michał Włodarczyk , Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth, 50th EATCS International Colloquium on Automata, Languages and Programming, Padeborn, Germany, 10 July 2023 - 14 July 2023, 261 2023, p. 106:1-20. See in PBN

2022

• Bart M. P. Jansen, Michał Włodarczyk , Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rzym, Italy, 20 June 2022 - 24 June 2022. See in PBN
• Huib Donkers, Bart M. P. Jansen, Michał Włodarczyk , Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size, Algorithmica, 84 (11) 2022, p. 3407-3458. See in PBN

2021

• Bart M.P. Jansen, Shivesh K. Roy, Michał Włodarczyk , On the Hardness of Compressing Weights, 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 23 August 2021 - 27 August 2021. See in PBN
• Huib Donkers, Bart M.P. Jansen, Michał Włodarczyk , Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Lisbon, Portugal, 8 September 2021 - 10 September 2021. See in PBN
• Jarosław Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michał Włodarczyk , To Close Is Easier Than To Open: Dual Parameterization To k-Median, 18th Workshop on Approximation and Online Algorithms, Pisa, Italy, 9 September 2020 - 10 September 2020. See in PBN
• Bart M. P. Jansen, Jari J. H. de Kroon, Michał Włodarczyk , Vertex deletion parameterized by elimination distance and even less, 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual, Italy, 21 June 2021 - 25 June 2021. See in PBN

2020

• Bart M.P. Jansen, Michał Włodarczyk , Optimal Polynomial-Time Compression for Boolean Max CSP, 28th Annual European Symposium on Algorithms, Pisa, Italy, 7 September 2020 - 9 September 2020. See in PBN
• Michał Włodarczyk , Parameterized Inapproximability for Steiner Orientation by Gap Amplification, 47th International Colloquium on Automata, Languages and Programming, Saarbrücken, Germany, 8 July 2020 - 11 July 2020. See in PBN

2019

• Marcin Mucha , Karol Węgrzycki, Michał Włodarczyk , A Subquadratic Approximation Scheme for Partition, 30th ACM-SIAM Symposium on Discrete Algorithms, San Diego, the United States of America, 6 January 2019 - 9 January 2019. See in PBN
• Michał Włodarczyk , Clifford Algebras Meet Tree Decompositions, Algorithmica, 81 (2) 2019, p. 497-518. See in PBN
• Marek Adamczyk, Jarosław Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michał Włodarczyk , Constant-factor FPT approximation for capacitated k-median, 27th Annual European Symposium on Algorithms (ESA 2019), Monachium, Germany, 9 September 2019 - 13 September 2019. See in PBN
• Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michał Włodarczyk , Losing Treewidth by Separating Subsets, 30th ACM-SIAM Symposium on Discrete Algorithms, San Diego, the United States of America, 6 January 2019 - 9 January 2019. See in PBN
• Marek Adamczyk, Michał Włodarczyk , Multi-dimensional mechanism design via random order contention resolution schemes, ACM SIGecom Exchanges, 17 2019, p. 46--53. See in PBN
• Marek Cygan , Marcin Mucha , Karol Węgrzycki, Michał Włodarczyk , On Problems Equivalent to (min,+)-Convolution, ACM Transactions on Algorithms, 15 (1) 2019, p. 1-25. See in PBN

2018

• Michał Włodarczyk , Marek Adamczyk, Random Order Contention Resolution Schemes, 59th Annual IEEE Symposium on Foundations of Computer Science, Paris, France, 7 October 2018 - 9 October 2018. See in PBN

2017

• Marek Cygan , Marcin Mucha , Karol Węgrzycki, Michał Włodarczyk , On Problems Equivalent to (min, +)-Convolution, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 July 2017 - 14 July 2017. See in PBN
• Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michał Włodarczyk , When the Optimum is also Blind: a New Perspective on Universal Optimization, 44th International Colloquium on Automata, Languages, and Programming, Warszawa, Poland, 10 July 2017 - 14 July 2017. See in PBN

2015

• Fabrizio Grandoni, Tomasz Kociumaka, Michał Włodarczyk , An LP-rounding 2\sqrt{2}-approximation for restricted maximum acyclic subgraph, Information Processing Letters, 2015. See in PBN
• Michał Komorowski, Tomasz Lipniacki, Karol Nienałtowski, Michał Włodarczyk , Clustering reveals limits of parameter identifiability in multi-parameter models of biochemical dynamics, BMC Systems Biology, 2015. See in PBN

Others

• Michał Włodarczyk , Clifford Algebras Meet Tree Decompositions, 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), , p. 497–518. See in PBN
• Jerzy Czyżowicz, Wojciech Rytter , Michał Włodarczyk , Evacuation from a Disc in the Presence of a Faulty Robot., Lecture Notes in Computer Science. See in PBN