The following pages link to Michał Włodarczyk (Q477618):
Displaying 21 items.
- An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph (Q477619) (← links)
- Clifford algebras meet tree decompositions (Q1725639) (← links)
- Evacuation from a disc in the presence of a faulty robot (Q1742766) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- On Problems Equivalent to (min,+)-Convolution (Q4629984) (← links)
- Clifford Algebras Meet Tree Decompositions (Q4634415) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- On Problems Equivalent to (min,+)-Convolution (Q5111352) (← links)
- (Q5111366) (← links)
- A Subquadratic Approximation Scheme for Partition (Q5236186) (← links)
- Losing Treewidth by Separating Subsets (Q5236288) (← links)
- (Q5874535) (← links)
- On the Hardness of Compressing Weights (Q6168482) (← links)
- (Q6192482) (← links)
- Long directed detours: reduction to 2-disjoint paths (Q6551717) (← links)
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth (Q6638112) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
- Finding long directed cycles is hard even when DFVS is small or girth is large (Q6657027) (← links)
- 5-approximation for \(\mathcal{H}\)-treewidth essentially as fast as \(\mathcal{H}\)-deletion parameterized by solution size (Q6657028) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
