Publication:5111387

DOI10.4230/LIPIcs.ICALP.2017.56zbMath1441.68106MaRDI QIDQ5111387

Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Daniel Lokshtanov

Publication date: 27 May 2020

zbMATH Keywords

parameterized complexity; spanning set; regular matroids

Mathematics Subject Classification ID

68W40: Analysis of algorithms

05B35: Combinatorial aspects of matroids and geometric lattices

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q27: Parameterized complexity, tractability and kernelization