Covering Vectors by Spaces: Regular Matroids
From MaRDI portal
Publication:4555045
DOI10.1137/17M1151250zbMath1400.05045arXiv1710.02300OpenAlexW2900588169WikidataQ128945340 ScholiaQ128945340MaRDI QIDQ4555045
Saket Saurabh, Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
Publication date: 19 November 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.02300
Combinatorics in computer science (68R05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Decomposition width of matroids
- An FPT algorithm for edge subset feedback edge set
- Parameterized graph separation problems
- Testing branch-width
- Decomposition of regular matroids
- Recognizing graphic matroids
- Branch-width and well-quasi-ordering in matroids and graphs.
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Clustering with local restrictions
- The highly connected matroids in minor-closed classes
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Approximating clique-width and branch-width
- Solving Rota's Conjecture
- Deciding First Order Properties of Matroids
- Fourier meets M\"{o}bius: fast subset convolution
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- On the inherent intractability of certain coding problems (Corresp.)
- The Complexity of Multiterminal Cuts
- The intractability of computing the minimum distance of a code
- Constructive algorithm for path-width of matroids
- Spanning Circuits in Regular Matroids
- Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Kernelization Lower Bounds Through Colors and IDs
- Parameterized Algorithms to Preserve Connectivity
- Matroid Secretary for Regular and Decomposable Matroids
- Algorithms and Data Structures
- On the Complexity of Some Enumeration Problems for Matroids
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
- Parameterized Algorithms
- The steiner problem in graphs
- A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
- Finding Branch-Decompositions and Rank-Decompositions
