Parameterized Complexity of Superstring Problems

Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh. Parameterized Complexity of Superstring Problems. In Ferdinando Cicalese, Ely Porat, Ugo Vaccaro, editors, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. Volume 9133 of Lecture Notes in Computer Science, pages 89-99, Springer, 2015. [doi]

Abstract

Abstract is missing.