The following pages link to Alina Ene (Q896266):
Displaying 24 items.
- The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
- Submodular unsplittable flow on trees (Q1801021) (← links)
- Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs (Q2843249) (← links)
- Geometric packing under non-uniform constraints (Q2874559) (← links)
- (Q2969615) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Prize-Collecting Survivable Network Design in Node-Weighted Graphs (Q3167388) (← links)
- Submodular Unsplittable Flow on Trees (Q3186514) (← links)
- Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs (Q3638868) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs (Q4582017) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- (Q4598139) (← links)
- Node-weighted Network Design in Planar and Minor-closed Families of Graphs (Q5032022) (← links)
- (Q5136319) (← links)
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (Q5259611) (← links)
- Routing under balance (Q5361864) (← links)
- (Q5365098) (← links)
- On Routing Disjoint Paths in Bounded Treewidth Graphs (Q5369517) (← links)
- Approximation algorithms and hardness of integral concurrent flow (Q5415510) (← links)
- The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs (Q5418998) (← links)
- Approximation Algorithms for Submodular Multiway Partition (Q5495000) (← links)
- Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems (Q5741731) (← links)
- Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant Congestion (Q5741732) (← links)
