|
|
(3 intermediate revisions by 3 users not shown) |
| Property / MaRDI profile type |
| | |
| Property / MaRDI profile type: MaRDI publication profile / rank |
| | Normal rank |
| Property / full work available at URL |
| | |
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2011.08.007 / rank |
| | Normal rank |
| Property / OpenAlex ID |
| | |
| Property / OpenAlex ID: W2148517677 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Integer Programming and Combinatorial Optimization / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A matching problem with side conditions / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Matching, matroids, and extensions / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Valuated matroids: A new look at the greedy algorithm / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A greedy-algorithm characterization of valuated \(\Delta\)-matroids / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Valuated matroids / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Augmentation Problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Restricted \(t\)-matchings in bipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Minimal edge-coverings of pairs of sets / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Directed vertex-connectivity augmentation / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Submodular functions and optimization. / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q3138921 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Faster scaling algorithms for general graph matching problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Some simplified NP-complete graph problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Maximum skew-symmetric flows and matchings / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Finding maximum square-free 2-matchings in bipartite graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On Four-Connecting a Triconnected Graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Finding a Smallest Augmentation to Biconnect a Graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2721988 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4472504 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Independence free graphs and vertex connectivity augmentation / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the optimal vertex-connectivity augmentation / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A note on the vertex-connectivity augmentation problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Operations on M‐Convex Functions on Jump Systems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Even factors, jump systems, and discrete convexity / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On shredders and vertex connectivity augmentation / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The membership problem in jump systems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On Maximum Cost $K_{t,t}$‐Free <i>t</i>‐Matchings of Bipartite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Convexity and Steinitz's exchange property / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Discrete Convex Analysis / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Combinatorial algorithms for matchings, even factors and square-free 2-factors / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: An approximation algorithm for minimum-cost vertex-connectivity problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A Weighted <i>k<sub>t, t</sub></i>-Free <i>t</i>-Factor Algorithm for Bipartite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Augmenting undirected node-connectivity by one / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q2921669 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A smallest augmentation to 3-connect a graph / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Pfaffian forms and \(\Delta\)-matroids / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: \(\Delta\)-matroids with the strong exchange conditions / rank |
| | Normal rank |
links / mardi / name | links / mardi / name |
| | |