New upper bounds on the decomposability of planar graphs and fixed parameter algorithms