The following pages link to (Q3085455):
Displayed 50 items.
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Gain-sparsity and symmetry-forced rigidity in the plane (Q262309) (← links)
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks (Q273172) (← links)
- An extension of Lehman's theorem and ideal set functions (Q298985) (← links)
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- Antistrong digraphs (Q345072) (← links)
- Graph orientations with set connectivity requirements (Q442326) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- A faster algorithm for packing branchings in digraphs (Q494431) (← links)
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs (Q894472) (← links)
- Base polyhedra and the linking property (Q1631626) (← links)
- Path-contractions, edge deletions and connectivity preservation (Q1713475) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Blocking optimal structures (Q1752656) (← links)
- On orienting graphs for connectivity: Projective planes and Halin graphs (Q1758272) (← links)
- Subgraph polytopes and independence polytopes of count matroids (Q1785403) (← links)
- Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
- Envy-free matchings with lower quotas (Q1986955) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- On the global rigidity of tensegrity graphs (Q2043364) (← links)
- Packing of mixed hyperarborescences with flexible roots via matroid intersection (Q2048562) (← links)
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems (Q2061881) (← links)
- Upper and lower degree-constrained graph orientation with minimum penalty (Q2062132) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem (Q2089770) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
- Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
- Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
- On the complexity of finding well-balanced orientations with upper bounds on the out-degrees (Q2106523) (← links)
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\) (Q2109111) (← links)
- Globally balancing spanning trees (Q2111190) (← links)
- Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- Sparse graphs and an augmentation problem (Q2118121) (← links)
- Rainbow and monochromatic circuits and cocircuits in binary matroids (Q2124622) (← links)
- Checking the admissibility of odd-vertex pairings is hard (Q2142685) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Fair integral submodular flows (Q2166258) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- Eulerian orientations and vertex-connectivity (Q2217466) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Matchings under distance constraints. I (Q2241576) (← links)