Name : Ehab Morsy
Permenant Address : Department of Mathematics, Faculty of Science,
Current Address : Institute of Information Systems,
Mobile : +201000135455 (Egypt)
+49017686750289 (Germany)
Research Interests:
Graph Algorithms, Approximation Algorithms, Discrete Mathematics,
Combinatorial Optimization, distributed algorithms, Scheduling Problems.
Publications:
Journals:  A. Hamad, E. Morsy, S. Adel, Design and Analysis of a
CrossLayer Handoff Ordering Scheme for TwoTier Cellular CDMA Networks,
International Journal of Intelligent Computing and Information Science,
vol. 13, no. 1, pp. 125140, 2013.
 A. Hamad, E. Morsy, S. Adel, Performance analysis of a
handoff scheme for twotier cellular CDMA networks, Egyptian Informatics
Journal, vol. 12, no. 2, pp. 139149, 2011.
 S.
Karakawa, E. Morsy, and H. Nagamochi, Minmax tree cover in the Euclidean space,
Journal of Graph Algorithms and Applications, vol. 15, no. 3, pp. 345371,
2011.
 E. Morsy and H. Nagamochi, Approximating capacitated
treeroutings in networks, Journal of Combinatorial Optimization, vol. 21,
no. 2, pp. 254267, 2011.
 S. Ota, E. Morsy, H. Nagamochi, A plane graph representation
of a triconnected graph, Theoretical Computer Science, vol. 411, pp. 39793993,
2010.
 E. Morsy and H. Nagamochi, On the approximation of the
generalized capacitated treerouting problem, Journal of Discrete
Algorithms, vol. 8, pp. 311320, 2010.
 E. Morsy, H. Nagamochi : Approximation to the minimum cost
edge installation problem, IEICE Transactions, E93A, no.4, pp. 778786,
2010.
 N. Sherif and E. Morsy, On computation of matrix logarithm,
Journal of Applied Mathematics and Informatics, vol. 27, no. 1, pp.
105121, 2009.
 N. Sherif and E. Morsy, Structured solutions of a quadratic
matrix equation, International Journal of Applied Mathematics, vol. 21,
no. 1, pp. 3549, 2008.
 N. Sherif and E. Morsy, Computing real logarithm of a real
matrix, International Journal of Algebra, vol. 2, no. 3, pp. 131142,
2008.
 E. Morsy and H. Nagamochi, An improved approximation
algorithm for capacitated multicast routings in networks, Theoretical
Computer Science, vol. 390, no. 1, pp. 8191, 2008.
 E. Morsy and H. Nagamochi, Approximation algorithms for
multicast routings in a network with multisources, IEICE Transactions
vol. E90A, no. 5, pp. 900906, 2007.
Conferences (refereed):
 John Augustine, Anisur Molla, Ehab Morsy, Gopal Pandurangan,
Peter Robinson, Eli Upfal, Search and Storage in Dynamic PeertoPeer
Networks, the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA), July 2325, 2013, Montreal, QC, Canada, 5362.
 David G. Harris, Ehab Morsy, Gopal Pandurangan, Peter
Robinson and Aravind Srinivasan, Efficient Computation of
Balanced Structures, the 40th International Colloquium on Automata,
Languages and Programming (ICALP 2013), July 812, 2013, Riga, Latvia, Lecture
Notes in Computer Science, volume 7966, Springer 2013, 581593.
 E. Morsy, Approximating the kSplittable Capacitated Network
Design Problem, Proceedings of the 39^{th} International
Conference on Current Trends in Theory and Practice of Computer Science,
January 26–31, 2013, Czech Republic, Lecture Notes in Computer Science, volume
7741, Springer 2013, 344355.
 S. Karakawa, E. Morsy, and H. Nagamochi, Minmax tree cover in
the Euclidean space, Proceedings of the Third Annual Workshop on
Algorithms and Computation (WALCOM 2009), February 1820, 2009, Indian
Statistical Institute, Kolkata, India, Lecture Notes in Computer Science,
volume 5431, Springer 2009, 202213.
 E. Morsy and H. Nagamochi, Approximating the generalized
capacitated treerouting, The 14th Annual International Computing and
Combinatorics Conference (COCOON 2008), June 27 29, 2008, Dalian, China,
Lecture Notes in Computer Science, volume 5092, Springer 2008, 621630.
 E. Morsy and H. Nagamochi, Approximation to the minimum cost
edge installation problem, The 18th International Symposium on Algorithms
and Computation (ISAAC) December 1719, 2007, Sendai, Japan, Lecture Notes
in Computer Science, volume 4835, Springer 2007, 292303.
 E. Morsy and H. Nagamochi, Approximating capacitated
treeroutings in networks, The 4th Annual Conference on Theory and
Applications of Models of Computation (TAMC07), Shanghai, China, May 22 to
25, 2007, Lecture Notes in Computer Science, volume 4484, Springer 2007,
342353.
 E. Morsy and H. Nagamochi, An improved approximation
algorithm for capacitated multicast routings in networks, Proceedings of
the International Symposium on Scheduling 2006 (ISS2006), July 1820,
2006, Arcadia Ichigaya, Tokyo, Japan, pp. 1217.
Other talks:
 E.
Morsy and E. Pesch, On the Inventory
Constrained Scheduling on a Single Machine, Approaches to Scheduling and Project
Planning in the Field of Logistics, February 27March 1, 2014, Augsburg,
Germany.
 E.
Morsy and E. Pesch, Approximation Algorithms for Inventory Constrained
Scheduling on a Single Machine, the INFORMS Annual Meeting, October 69, 2013, Minneapolis, USA.
 E.
Morsy, Approximating the kSplittable Capacitated Network Design Problem, the International Conference on Operations Research
(OR2013), September 36, 2013, Rotterdam, Netherland.
 E. Morsy,
Approximating the kSplittable Capacitated Network Design Problem, the
11th Workshop on Models and Algorithms for Planning and Scheduling
Problems (MAPSP2013), June 2328, 2013, Pont à Mousson, France.
 E. Morsy and H. Nagamochi, An improved approximation
algorithm for capacitated multicast routings in networks, the Kyoto
Tsukuba joint workshop 2007, Kyoto, Japan.
