A parameterized view on matroid optimization problems
type: Item
instance of: scholarly article
title: A parameterized view on matroid optimization problems
zbMATH Open document ID: 1180.90275
author: Dániel Marx
published in: Theoretical Computer Science
publication date: 2009-11-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5624931
zbMATH Keywords: matroids
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: combinatorial optmization
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.027
OpenAlex ID: W1972514464
cites work: Finding and counting given length cycles
cites work: Parametrized complexity theory.
cites work: Q4860774
cites work: Q4133994
cites work: Matroid matching and some applications
cites work: Q4039893
cites work: Parameterized coloring problems on chordal graphs
cites work: Q3740256
cites work: Applications of Menger's graph theorem
cites work: Q4028099
cites work: Matroid theory and its applications in electric network theory and in statics
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Fast construction of irreducible polynomials over finite fields
cites work: Q3851616
DOI: 10.1016/J.TCS.2009.07.027
description: scientific article; zbMATH DE number 5624931