The following pages link to (Q3085455):
Displayed 50 items.
- Graded sparse graphs and body-length-direction frameworks (Q2255800) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Mechanism design with costly verification and limited punishments (Q2295836) (← links)
- Polymatroid-based capacitated packing of branchings (Q2334055) (← links)
- Orientations and detachments of graphs with prescribed degrees and connectivity (Q2339815) (← links)
- Decomposition into two trees with orientation constraints (Q2339817) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- Sparse hypergraphs with applications in combinatorial rigidity (Q2341719) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs (Q2359795) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- A generalized-polymatroid approach to disjoint common independent sets in two matroids (Q2421866) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819) (← links)
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- A simple algorithm and min-max formula for the inverse arborescence problem (Q2661220) (← links)
- Connectivity of orientations of 3-edge-connected graphs (Q2662789) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- On Maximal Independent Arborescence Packing (Q2832576) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- The Generalized Terminal Backup Problem (Q2947440) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- On integer network synthesis problem with tree-metric cost (Q3121495) (← links)
- Minimum Cost Globally Rigid Subgraphs (Q3295269) (← links)
- Matroids of gain graphs in applied discrete geometry (Q3450280) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
- Minimum Cuts and Sparsification in Hypergraphs (Q4561257) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- Extended formulations of lower-truncated transversal polymatroids (Q4999331) (← links)
- On basic operations related to network induction of discrete convex functions (Q4999338) (← links)
- (Q5005108) (← links)
- Market Pricing for Matroid Rank Valuations (Q5013570) (← links)
- The Steiner Problem for Count Matroids (Q5041203) (← links)
- Sparse Graphs and an Augmentation Problem (Q5041749) (← links)
- Globally Rigid Augmentation of Rigid Graphs (Q5043054) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (Q5085130) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- Structured Connectivity Augmentation (Q5111243) (← links)
- Path-Contractions, Edge Deletions and Connectivity Preservation (Q5111736) (← links)
- (Q5136288) (← links)
- List Coloring of Two Matroids through Reduction to Partition Matroids (Q5157385) (← links)
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation (Q5219668) (← links)
- Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) (← links)
- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)