Ehab Morsy

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 5

Top Topics

Genetic Algorithm

Top Venues

Discret. Optim.

Inf. Process. Lett.

Publications

Riham Moharam, Ahmed Fouad Ali, Ehab Morsy, Mohamed Ali Ahmed, Mostafa-Sami M. Mostafa
A Discrete Chimp Optimization Algorithm for Minimizing Tardy/Lost Penalties on a Single Machine Scheduling Problem. IEEE Access 10 (2022)
Riham Moharam, Ehab Morsy
Genetic algorithms to balanced tree structures in graphs. Swarm Evol. Comput. 32 (2017)
Ehab Morsy
Approximating the k-splittable capacitated network design problem. Discret. Optim. 22 (2016)
David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
Efficient computation of sparse structures. Random Struct. Algorithms 49 (2) (2016)
Ehab Morsy
An extension of Hall's theorem for partitioned bipartite graphs. Inf. Process. Lett. 116 (11) (2016)
Mahmoud Gamal, Ehab Morsy, Ahmed Fathy
Multi-Objective transmitters Placement Problem in wireless Networks. SoICT (2015)
Riham Moharam, Ehab Morsy, Ismail A. Ismail
Genetic Algorithms for the Tree T-Spanner Problem. AISI (2015)
Ehab Morsy, Erwin Pesch
Approximation algorithms for inventory constrained scheduling on a single machine. J. Sched. 18 (6) (2015)
Riham Moharam, Ehab Morsy, Ismail A. Ismail
Genetic algorithms for balanced spanning tree problem. FedCSIS (2015)
Ehab Morsy
Approximating the k-Splittable Capacitated Network Design Problem. SOFSEM (2013)
David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan
Efficient Computation of Balanced Structures. ICALP (2) (2013)
John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
Storage and Search in Dynamic Peer-to-Peer Networks CoRR (2013)
John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal
Storage and search in dynamic peer-to-peer networks. SPAA (2013)
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl. 15 (3) (2011)
Ehab Morsy, Hiroshi Nagamochi
Approximating capacitated tree-routings in networks. J. Comb. Optim. 21 (2) (2011)
Ehab Morsy, Hiroshi Nagamochi
Approximation to the Minimum Cost Edge Installation Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (4) (2010)
Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi
A plane graph representation of triconnected graphs. Theor. Comput. Sci. 411 (44-46) (2010)
Ehab Morsy, Hiroshi Nagamochi
On the approximation of the generalized capacitated tree-routing problem. J. Discrete Algorithms 8 (3) (2010)
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
Minmax Tree Cover in the Euclidean Space. WALCOM (2009)
Ehab Morsy, Hiroshi Nagamochi
An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. 390 (1) (2008)
Ehab Morsy, Hiroshi Nagamochi
Approximating the Generalized Capacitated Tree-Routing Problem. COCOON (2008)
Ehab Morsy, Hiroshi Nagamochi
Approximating Capacitated Tree-Routings in Networks. TAMC (2007)
Ehab Morsy, Hiroshi Nagamochi
Approximation to the Minimum Cost Edge Installation Problem. ISAAC (2007)
Ehab Morsy, Hiroshi Nagamochi
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (5) (2007)