On the Parameterized Complexity Of Grid Contraction

DOI10.4230/lipics.swat.2020.34OpenAlexW3037235467MaRDI QIDQ6059202

Prafullkumar Tale, Uéverton dos Santos Souza, Saket Saurabh

Publication date: 2 November 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12281/pdf/LIPIcs-SWAT-2020-34.pdf/

zbMATH Keywords

lower boundkernelizationFPTgrid contraction

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (5)

On the parameterized complexity of maximum degree contraction problem ⋮ On the parameterized complexity of grid contraction ⋮ Reducing the vertex cover number via edge contractions ⋮ A single exponential-time FPT algorithm for cactus contraction ⋮ On the Parameterized Complexity of Maximum Degree Contraction Problem.

This page was built for publication: On the Parameterized Complexity Of Grid Contraction