Michał Włodarczyk

From MaRDI portal
Person:477618


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
SIAM Journal on Computing
2025-01-23Paper
Finding long directed cycles is hard even when DFVS is small or girth is large
 
2025-01-06Paper
5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size
 
2025-01-06Paper
Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
Journal of Computer and System Sciences
2024-12-27Paper
Tight bounds for chordal/interval vertex deletion parameterized by treewidth
 
2024-11-14Paper
Long directed detours: reduction to 2-disjoint paths
Information Processing Letters
2024-06-07Paper
Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
 
2024-02-12Paper
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Vertex deletion parameterized by elimination distance and even less
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
On the Hardness of Compressing Weights
 
2023-08-08Paper
scientific article; zbMATH DE number 7651202 (Why is no real title available?)
 
2023-02-07Paper
Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
Algorithmica
2022-10-27Paper
Constant-Factor FPT Approximation for Capacitated k-Median
 
2022-05-11Paper
To close is easier than to open: dual parameterization to \(k\)-median
 
2022-03-22Paper
On Problems Equivalent to (min,+)-Convolution
 
2020-05-27Paper
When the optimum is also blind: a new perspective on universal optimization
 
2020-05-27Paper
Losing Treewidth by Separating Subsets
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
A subquadratic approximation scheme for partition
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
On problems equivalent to \((\min,+)\)-convolution
ACM Transactions on Algorithms
2019-03-28Paper
Clifford algebras meet tree decompositions
Algorithmica
2019-02-14Paper
Evacuation from a disc in the presence of a faulty robot
 
2018-04-12Paper
Clifford algebras meet tree decompositions
 
2018-04-10Paper
An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph
Information Processing Letters
2014-12-09Paper


Research outcomes over time


This page was built for person: Michał Włodarczyk