Title: Maximum edge-disjoint paths problem in bounded treewidth graphs Abstract: I will present an algorithm to find a constant approximation for MEDP in bounded treewidth graphs with only a constant congestion. More precisely, for any integer $k$, our algorithm find a $f(k)$-approximation with $g(k)$ congestion in any graph of treewidth $k$. This is a joint work with Chandra Chekuri and Bruce Shepherd.