Stability in graphs with matroid constraints
From MaRDI portal
Cites work
- A parameterized view on matroid optimization problems
- Algorithms for Weighted Independent Transversals and Strong Colouring
- Complexity results for rainbow matchings
- Deterministic truncation of linear matroids
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Finding independent transversals efficiently
- Fundamentals of parameterized complexity
- Graphs and geometry
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 7788370 (Why is no real title available?)
- Independent Sets in Asteroidal Triple-Free Graphs
- Independent systems of representatives in weighted graphs
- Kernelization Lower Bounds by Cross-Composition
- Kernelization. Theory of parameterized preprocessing
- Large rainbow matchings in general graphs
- Listing all potential maximal cliques of a graph
- On Forming Committees
- On maximal independent sets of vertices in claw-free graphs
- On maximum bipartite matching with separation
- Parameterized algorithms
- Parameterized algorithms and kernels for rainbow matching
- Quadratic vertex kernel for rainbow matching
- Rainbow independent sets in certain classes of graphs
- Rainbow independent sets on dense graph classes
- Smallest-last ordering and clustering and graph coloring algorithms
- Some Matching Problems for Bipartite Graphs
- Tight kernel bounds for problems on graphs with small degeneracy
- Transversals in row-latin rectangles
- Treewidth and minimum fill-in: Grouping the minimal separators
This page was built for publication: Stability in graphs with matroid constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891128)
