scientific article; zbMATH DE number 3750968
From MaRDI portal
Publication:3934404
Cited in
(39)- An application of submodular flows
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Matroid matching and some applications
- The ellipsoid method and its consequences in combinatorial optimization
- An appraisal of computational complexity for operations researchers
- Structural properties of matroid matchings
- The membership problem in jump systems
- Maximum genus and maximum nonseparating independent set of a 3-regular graph
- The linear delta-matroid parity problem
- A constrained independent set problem for matroids
- Approximating minimum feedback vertex sets in hypergraphs
- Fractional matroid matchings
- New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems
- Complexity of packing common bases in matroids
- Locally defined independence systems on graphs
- Generalized matroid matching
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Matroid matching with Dilworth truncation
- A linear programming formulation of Mader's edge-disjoint paths problem
- On the complexity of packing rainbow spanning trees
- Packing A-paths in group-labelled graphs via linear matroid parity
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- Packing non-zero \(A\)-paths via matroid matching
- An algorithm for weighted fractional matroid matching
- On feedback vertex set: new measure and new structures
- Applications of matroids in electric network theory
- Weighted linear matroid parity
- A weighted linear matroid parity algorithm
- Optimal general factor problem and jump system intersection
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Matroid Intersection under Restricted Oracles
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank
- Lower bounds for matroid optimization problems with a linear constraint
- Optimal general factor problem and jump system intersection
- Spanning trees of 3-uniform hypergraphs
- Bidirectional retracting-free double tracings and upper embeddability of graphs
- On matroid parity and matching polytopes
- Matchings and \(\Delta\)-matroids
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3934404)
