The following pages link to Ehab Morsy (Q410723):
Displaying 17 items.
- A plane graph representation of triconnected graphs (Q410724) (← links)
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- Approximation algorithms for inventory constrained scheduling on a single machine (Q906561) (← links)
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
- Approximating the \(k\)-splittable capacitated network design problem (Q1751198) (← links)
- An improved approximation algorithm for capacitated multicast routings in networks (Q2474074) (← links)
- An extension of Hall's theorem for partitioned bipartite graphs (Q2630339) (← links)
- Efficient computation of sparse structures (Q2820273) (← links)
- Approximating the k-Splittable Capacitated Network Design Problem (Q2927658) (← links)
- (Q3504906) (← links)
- Approximating the Generalized Capacitated Tree-Routing Problem (Q3511374) (← links)
- (Q3511979) (← links)
- Efficient Computation of Balanced Structures (Q5327467) (← links)
- Approximation to the Minimum Cost Edge Installation Problem (Q5387765) (← links)
- Approximating Capacitated Tree-Routings in Networks (Q5425447) (← links)
- Minmax tree cover in the Euclidean space (Q5891341) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)