  We describe a heuristic algorithm for computing treedepth decompositions,
submitted for the PACE 2020 challenge. It relies on a variety of greedy
algorithms computing elimination orderings, as well as a Divide & Conquer
approach on balanced cuts obtained using a from-scratch reimplementation of the
2016 FlowCutter algorithm by Hamann & Strasser [ACM JEA 2018].
