Abstract : DAIA is a two-phases heuristic algorithm that searches for good treedepth decompositions of graphs. First it builds a treedepth decomposition partitionning recursively the vertices. Then it modifies the resulting tree in order to reduce its height.