Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. - Ehab Morsy; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

Approximating the Generalized Capacitated Tree-Routing Problem. - Ehab Morsy; Hiroshi Nagamochi (COCOON, 2008)

An improved approximation algorithm for capacitated multicast routings in networks. - Ehab Morsy; Hiroshi Nagamochi (Theor. Comput. Sci., 2008)

Approximation algorithms to the capacitated tree-routings in networks. - Ehab Morsy (2009)

Approximation to the Minimum Cost Edge Installation Problem. - Ehab Morsy; Hiroshi Nagamochi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

On the approximation of the generalized capacitated tree-routing problem. - Ehab Morsy; Hiroshi Nagamochi (J. Discrete Algorithms, 2010)

A plane graph representation of triconnected graphs. - Shunsuke Ota; Ehab Morsy; Hiroshi Nagamochi (Theor. Comput. Sci., 2010)

Approximating capacitated tree-routings in networks. - Ehab Morsy; Hiroshi Nagamochi (J. Comb. Optim., 2011)

Minmax Tree Cover in the Euclidean Space. - Seigo Karakawa; Ehab Morsy; Hiroshi Nagamochi (J. Graph Algorithms Appl., 2011)

Efficient Computation of Balanced Structures. - David G. Harris 001; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Aravind Srinivasan (ICALP (2), 2013)

Storage and search in dynamic peer-to-peer networks. - John Augustine; Anisur Rahaman Molla; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Eli Upfal (SPAA, 2013)

Genetic Algorithms for the Tree T-Spanner Problem. - Riham Moharam; Ehab Morsy; Ismail A. Ismail (AISI, 2015)

Genetic algorithms for balanced spanning tree problem. - Riham Moharam; Ehab Morsy; Ismail A. Ismail (FedCSIS, 2015)

Multi-Objective transmitters Placement Problem in wireless Networks. - Mahmoud Gamal; Ehab Morsy; Ahmed Fathy (SoICT, 2015)

Approximation algorithms for inventory constrained scheduling on a single machine. - Ehab Morsy; Erwin Pesch (J. Sched., 2015)

Approximating the k-splittable capacitated network design problem. - Ehab Morsy (Discret. Optim., 2016)

An extension of Hall's theorem for partitioned bipartite graphs. - Ehab Morsy (Inf. Process. Lett., 2016)

Efficient computation of sparse structures. - David G. Harris 001; Ehab Morsy; Gopal Pandurangan; Peter Robinson 002; Aravind Srinivasan (Random Struct. Algorithms, 2016)

Genetic algorithms to balanced tree structures in graphs. - Riham Moharam; Ehab Morsy (Swarm Evol. Comput., 2017)

A Discrete Chimp Optimization Algorithm for Minimizing Tardy/Lost Penalties on a Single Machine Scheduling Problem. - Riham Moharam; Ahmed Fouad Ali; Ehab Morsy; Mohamed Ali Ahmed; Mostafa-Sami M. Mostafa (IEEE Access, 2022)