On the Kernelization Complexity of String Problems

DOI10.1007/978-3-319-08783-2_13zbMath1423.68200OpenAlexW4249701285MaRDI QIDQ2920454

Saket Saurabh, Ashutosh Rai, M. S. Ramanujan, Manu Basavaraju, Fahad Panolan

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_13

zbMATH Keywords

parameterized complexitykernelizationclosest stringcross-composition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (1)

Unnamed Item

This page was built for publication: On the Kernelization Complexity of String Problems