On the Power of Tree-Depth for Fully Polynomial FPT Algorithms

Yoichi Iwata, Tomoaki Ogasawara, Naoto Ohsaka. On the Power of Tree-Depth for Fully Polynomial FPT Algorithms. In Rolf Niedermeier, Brigitte Vallée, editors, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France. Volume 96 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.