2013. A Completeness Theory for Polynomial (Turing) Kernelization. In Proceedings of the 8th International Symposium on Parameterized and Exact Computation (LNCS), Vol. 8246. Springer, 202-215. → p. 10.Hermelin, D, Kratsch, S, Sołtys, K, Wahlström, M, Wu, X A completeness theory ...
In Proceedings of the 8th International Symposium on Parameterized and Exact Computation (LNCS), Vol. 8246. Springer, 202-215. → p. 10.Danny Hermelin, Stefan Kratsch, Karolina Sołtys, Magnus Wahlstrom, and Xi Wu. A completeness theory for polynomial (turing) kernelization. Algorithmica, 71...