Michal Wlodarczyk

73 papers A* 12A 6B 11Journal 44

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. J. Comput. Syst. Sci. Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
2026	J	`jnl`	Optimal Path Partitions in Subcubic and Almost-subcubic Graphs. CoRR Tomás Masarík, Michal Wlodarczyk, Mehmet Akif Yildiz
2026	A*	`conf`	Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. SODA Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk
2026	A	`conf`	Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors. STACS Roohani Sharma, Michal Wlodarczyk
2026	J	`jnl`	Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors. CoRR Roohani Sharma, Michal Wlodarczyk
2025	B	`conf`	Designing Compact ILPs via Fast Witness Verification. IPEC Michal Wlodarczyk
2025	J	`jnl`	Designing Compact ILPs via Fast Witness Verification. CoRR Michal Wlodarczyk
2025	A	`conf`	Going Beyond Surfaces in Diameter Approximation. ESA Michal Wlodarczyk
2025	J	`jnl`	Going Beyond Surfaces in Diameter Approximation. CoRR Michal Wlodarczyk
2025	A*	`conf`	Losing Treewidth In The Presence Of Weights. SODA Michal Wlodarczyk
2025	J	`jnl`	Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. SIAM J. Comput. Bart M. P. Jansen, Michal Wlodarczyk
2025	J	`jnl`	Planar Disjoint Shortest Paths is Fixed-Parameter Tractable. CoRR Michal Pilipczuk, Giannos Stamoulis, Michal Wlodarczyk
2025	J	`jnl`	Single-exponential FPT algorithms for enumerating secluded F-free subgraphs and deleting to scattered graph classes. J. Comput. Syst. Sci. Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2025	J	`jnl`	Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. Algorithmica Michal Wlodarczyk
2024	B	`conf`	Constant Approximating Disjoint Paths on Acyclic Digraphs Is W[1]-Hard. ISAAC Michal Wlodarczyk
2024	J	`jnl`	Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard. CoRR Michal Wlodarczyk
2024	B	`conf`	Does Subset Sum Admit Short Proofs? ISAAC Michal Wlodarczyk
2024	J	`jnl`	Does Subset Sum Admit Short Proofs? CoRR Michal Wlodarczyk
2024	J	`jnl`	Long directed detours: Reduction to 2-Disjoint Paths. Inf. Process. Lett. Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2024	J	`jnl`	Losing Treewidth In The Presence Of Weights. CoRR Michal Wlodarczyk
2024	J	`jnl`	Optimal Polynomial-Time Compression for Boolean Max CSP. ACM Trans. Comput. Theory Bart M. P. Jansen, Michal Wlodarczyk
2023	J	`jnl`	5-Approximation for $\mathcal{H}$-Treewidth Essentially as Fast as $\mathcal{H}$-Deletion Parameterized by Solution Size. CoRR Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	A	`conf`	5-Approximation for ℋ-Treewidth Essentially as Fast as ℋ-Deletion Parameterized by Solution Size. ESA Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	J	`jnl`	Finding Long Directed Cycles Is Hard Even When DFVS Is Small Or Girth Is Large. CoRR Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023	A	`conf`	Finding Long Directed Cycles Is Hard Even When DFVS Is Small or Girth Is Large. ESA Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023	B	`conf`	Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. IPEC Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. CoRR Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Long Directed Detours: Reduction to 2-Disjoint Paths. CoRR Ashwin Jacob, Michal Wlodarczyk, Meirav Zehavi
2023	A*	`conf`	Planar Disjoint Paths, Treewidth, and Kernels. FOCS Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Planar Disjoint Paths, Treewidth, and Kernels. CoRR Michal Wlodarczyk, Meirav Zehavi
2023	B	`conf`	Sidestepping Barriers for Dominating Set in Parameterized Complexity. IPEC Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Sidestepping Barriers for Dominating Set in Parameterized Complexity. CoRR Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi
2023	J	`jnl`	Single-Exponential FPT Algorithms for Enumerating Secluded F-Free Subgraphs and Deleting to Scattered Graph Classes. CoRR Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	B	`conf`	Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes. ISAAC Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2023	A*	`conf`	Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. ICALP Michal Wlodarczyk
2023	J	`jnl`	Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth. CoRR Michal Wlodarczyk
2022	J	`jnl`	Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion. CoRR Bart M. P. Jansen, Michal Wlodarczyk
2022	A*	`conf`	Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion. STOC Bart M. P. Jansen, Michal Wlodarczyk
2022	J	`jnl`	Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. Algorithmica Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
2021	B	`conf`	On the Hardness of Compressing Weights. MFCS Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
2021	J	`jnl`	On the Hardness of Compressing Weights. CoRR Bart M. P. Jansen, Shivesh Kumar Roy, Michal Wlodarczyk
2021	B	`conf`	Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. IPEC Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
2021	J	`jnl`	Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. CoRR Huib Donkers, Bart M. P. Jansen, Michal Wlodarczyk
2021	J	`jnl`	Vertex Deletion Parameterized by Elimination Distance and Even Less. CoRR Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2021	A*	`conf`	Vertex deletion parameterized by elimination distance and even less. STOC Bart M. P. Jansen, Jari J. H. de Kroon, Michal Wlodarczyk
2020	A	`conf`	Optimal Polynomial-Time Compression for Boolean Max CSP. ESA Bart M. P. Jansen, Michal Wlodarczyk
2020	J	`jnl`	Optimal polynomial-time compression for Boolean Max CSP. CoRR Bart M. P. Jansen, Michal Wlodarczyk
2020	A*	`conf`	Parameterized Inapproximability for Steiner Orientation by Gap Amplification. ICALP Michal Wlodarczyk
2020	B	`conf`	To Close Is Easier Than To Open: Dual Parameterization To k-Median. WAOA Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk
2020	J	`jnl`	To Close Is Easier Than To Open: Dual Parameterization To k-Median. CoRR Jaroslaw Byrka, Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski, Michal Wlodarczyk
2019	A*	`conf`	A Subquadratic Approximation Scheme for Partition. SODA Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2019	J	`jnl`	Clifford Algebras Meet Tree Decompositions. Algorithmica Michal Wlodarczyk
2019	A	`conf`	Constant-Factor FPT Approximation for Capacitated k-Median. ESA Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
2019	J	`jnl`	Inapproximability within W[1]: the case of Steiner Orientation. CoRR Michal Wlodarczyk
2019	A*	`conf`	Losing Treewidth by Separating Subsets. SODA Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2019	J	`jnl`	Multi-dimensional mechanism design via random order contention resolution schemes. SIGecom Exch. Marek Adamczyk, Michal Wlodarczyk
2019	J	`jnl`	On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2018	J	`jnl`	Connected Components at Scale via Local Contractions. CoRR Jakub Lacki, Vahab S. Mirrokni, Michal Wlodarczyk
2018	J	`jnl`	Constant factor FPT approximation for capacitated k-median. CoRR Marek Adamczyk, Jaroslaw Byrka, Jan Marcinkowski, Syed Mohammad Meesum, Michal Wlodarczyk
2018	J	`jnl`	Losing Treewidth by Separating Subsets. CoRR Anupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk
2018	A*	`conf`	Random Order Contention Resolution Schemes. FOCS Marek Adamczyk, Michal Wlodarczyk
2018	J	`jnl`	Random Order Contention Resolution Schemes. CoRR Marek Adamczyk, Michal Wlodarczyk
2018	J	`jnl`	Subquadratic Approximation Scheme for Partition. CoRR Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2017	B	`conf`	Evacuation from a Disc in the Presence of a Faulty Robot. SIROCCO Jurek Czyzowicz, Konstantinos Georgiou, Maxime Godon, Evangelos Kranakis, Danny Krizanc, Wojciech Rytter, Michal Wlodarczyk
2017	A*	`conf`	On Problems Equivalent to (min, +)-Convolution. ICALP Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2017	J	`jnl`	On problems equivalent to (min, +)-convolution. CoRR Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2017	A*	`conf`	When the Optimum is also Blind: a New Perspective on Universal Optimization. ICALP Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
2017	J	`jnl`	When the Optimum is also Blind: a New Perspective on Universal Optimization. CoRR Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk
2016	B	`conf`	Clifford Algebras Meet Tree Decompositions. IPEC Michal Wlodarczyk
2016	J	`jnl`	Clifford algebras meet tree decompositions. CoRR Michal Wlodarczyk
2015	J	`jnl`	An LP-rounding 2√2-approximation for restricted maximum acyclic subgraph. Inf. Process. Lett. Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk
2015	J	`jnl`	Clustering reveals limits of parameter identifiability in multi-parameter models of biochemical dynamics. BMC Syst. Biol. Karol Nienaltowski, Michal Wlodarczyk, Tomasz Lipniacki, Michal Komorowski
2014	J	`jnl`	An LP-Rounding $2\sqrt{2}$ Approximation for Restricted Maximum Acyclic Subgraph. CoRR Fabrizio Grandoni, Tomasz Kociumaka, Michal Wlodarczyk