Michal Wlodarczyk

activity

20242026

collaborators

3 papers

cs.DS2026

Dynamic Detours

Daniel Dadush, MichaÅ Pilipczuk, Amadeus Reinald +2

Fix a parameter $k \in N$ . We give dynamic data structures that for a fully dynamic undirected graph $G$ , updated over time by edge insertions and edge deletions, can answe…

cs.DS2025

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable

MichaÅ Pilipczuk, Giannos Stamoulis, MichaÅ WÅodarczyk

In the Disjoint Shortest Paths problem one is given a graph $G$ and a set $T = {(s_{1}, t_{1}), \dots, (s_{k}, t_{k})}$ of $k$ vertex pairs. The question is whether there exist verte…

cs.DS2024

Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard

MichaÅ WÅodarczyk

In the Disjoint Paths problem, one is given a graph with a set of $k$ vertex pairs $(s_{i}, t_{i})$ and the task is to connect each $s_{i}$ to $t_{i}$ with a path, so that the $k$ paths are…