The following pages link to András Frank (Q226797):
Displayed 50 items.
- A Survey on Covering Supermodular Functions (Q2971606) (← links)
- (Q2999648) (← links)
- (Q3039389) (← links)
- (Q3085455) (← links)
- On Integer Multiflow Maximization (Q3128211) (← links)
- (Q3142412) (← links)
- Covering directed and odd cuts (Q3220093) (← links)
- (Q3220319) (← links)
- (Q3353050) (← links)
- Variations for Lovász’ Submodular Ideas (Q3601919) (← links)
- (Q3617665) (← links)
- (Q3617674) (← links)
- A Primal-Dual Algorithm for Submodular Flows (Q3680637) (← links)
- (Q3682499) (← links)
- (Q3688403) (← links)
- (Q3858297) (← links)
- (Q3859792) (← links)
- (Q3929415) (← links)
- A weighted matroid intersection algorithm (Q3942972) (← links)
- (Q3958239) (← links)
- (Q3972951) (← links)
- Augmenting Graphs to Meet Edge-Connectivity Requirements (Q3989009) (← links)
- (Q4093489) (← links)
- On sparse subgraphs preserving connectivity properties (Q4201383) (← links)
- Two Arc-Disjoint Paths in Eulerian Digraphs (Q4210224) (← links)
- (Q4263470) (← links)
- (Q4263711) (← links)
- (Q4263712) (← links)
- (Q4273846) (← links)
- (Q4386300) (← links)
- (Q4398362) (← links)
- (Q4537741) (← links)
- (Q4537742) (← links)
- (Q4635969) (← links)
- On Kuhn's Hungarian Method?A tribute from Hungary (Q4680450) (← links)
- An Algorithm for Submodular Functions on Graphs (Q4739952) (← links)
- Note on the path‐matching formula (Q4798108) (← links)
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs (Q4837644) (← links)
- (Q4871749) (← links)
- A Discrete Convex Min-Max Formula for Box-TDI Polyhedra (Q5085130) (← 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)
- Sink-Stable Sets of Digraphs (Q5246079) (← links)
- Algorithms – ESA 2005 (Q5475837) (← links)
- Node-Capacitated Ring Routing (Q5704085) (← links)
- An orientation theorem with parity conditions (Q5954236) (← links)
- Fair Integral Network Flows (Q6121632) (← links)
- Discrete Decreasing Minimization, Part I: Base-polyhedra with Applications in Network Optimization (Q6305730) (← links)
- Discrete Decreasing Minimization, Part II: Views from Discrete Convex Analysis (Q6305817) (← links)