Ehab Morsy

According to our database, Ehab Morsy authored at least 20 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

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

2017

Genetic algorithms to balanced tree structures in graphs.

Riham Moharam, Ehab Morsy

Swarm Evol. Comput., 2017

2016

Efficient computation of sparse structures.

David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan

Random Struct. Algorithms, 2016

An extension of Hall's theorem for partitioned bipartite graphs.

Ehab Morsy

Inf. Process. Lett., 2016

Approximating the k-splittable capacitated network design problem.

Ehab Morsy

Discret. Optim., 2016

2015

Approximation algorithms for inventory constrained scheduling on a single machine.

Ehab Morsy, Erwin Pesch

J. Sched., 2015

Multi-Objective transmitters Placement Problem in wireless Networks.

Mahmoud Gamal, Ehab Morsy, Ahmed Fathy

Proceedings of the Sixth International Symposium on Information and Communication Technology, 2015

Genetic algorithms for balanced spanning tree problem.

Riham Moharam, Ehab Morsy, Ismail A. Ismail

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

Genetic Algorithms for the Tree T-Spanner Problem.

Riham Moharam, Ehab Morsy, Ismail A. Ismail

Proceedings of the 1st International Conference on Advanced Intelligent System and Informatics, 2015

2013

Storage and search in dynamic peer-to-peer networks.

John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal

Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Efficient Computation of Balanced Structures.

David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Aravind Srinivasan

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011

Minmax Tree Cover in the Euclidean Space.

Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi

J. Graph Algorithms Appl., 2011

Approximating capacitated tree-routings in networks.

Ehab Morsy, Hiroshi Nagamochi

J. Comb. Optim., 2011

2010

A plane graph representation of triconnected graphs.

Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi

Theor. Comput. Sci., 2010

On the approximation of the generalized capacitated tree-routing problem.

Ehab Morsy, Hiroshi Nagamochi

J. Discrete Algorithms, 2010

Approximation to the Minimum Cost Edge Installation Problem.

Ehab Morsy, Hiroshi Nagamochi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

2009

Approximation algorithms to the capacitated tree-routings in networks.

Ehab Morsy

PhD thesis, 2009

2008

An improved approximation algorithm for capacitated multicast routings in networks.

Ehab Morsy, Hiroshi Nagamochi

Theor. Comput. Sci., 2008

Approximating the Generalized Capacitated Tree-Routing Problem.

Ehab Morsy, Hiroshi Nagamochi

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Approximation Algorithms for Multicast Routings in a Network with Multi-Sources.

Ehab Morsy, Hiroshi Nagamochi

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007