Welcome to my Homepage

Contact Details:
Name                    : Ehab Morsy
Permenant Address : Department of Mathematics, Faculty of Science,
                              Suez Canal UniversityIsmailia 22541, Egypt
Current Address     :  Institute of Information Systems,
                              University of Siegen, Germany
 
Mobile                  :  +2-01000135455 (Egypt)
                              +49-017686750289 (Germany)
E-mail                  :  ehabmorsy@gmail.com
                              ehab.morsy@uni-siegen.de
 
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 Cross-Layer Handoff Ordering Scheme for Two-Tier Cellular CDMA Networks, International Journal of Intelligent Computing and Information Science, vol. 13, no. 1, pp. 125-140, 2013. 
  • A. Hamad, E. Morsy, S. Adel, Performance analysis of a handoff scheme for two-tier cellular CDMA networks, Egyptian Informatics Journal, vol. 12, no. 2, pp. 139-149, 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. 345-371, 2011.
  • E. Morsy and H. Nagamochi, Approximating capacitated tree-routings in networks, Journal of Combinatorial Optimization, vol. 21, no. 2, pp. 254-267, 2011.
  • S. Ota, E. Morsy, H. Nagamochi, A plane graph representation of a triconnected graph, Theoretical Computer Science, vol. 411, pp. 3979-3993, 2010.
  • E. Morsy and H. Nagamochi, On the approximation of the generalized capacitated tree-routing problem, Journal of Discrete Algorithms, vol. 8, pp. 311-320, 2010.
  • E. Morsy, H. Nagamochi : Approximation to the minimum cost edge installation problem, IEICE Transactions, E93-A, no.4, pp. 778-786, 2010.
  • N. Sherif and E. Morsy, On computation of matrix logarithm, Journal of Applied Mathematics and Informatics, vol. 27, no. 1, pp. 105-121, 2009.
  • N. Sherif and E. Morsy, Structured solutions of a quadratic matrix equation, International Journal of Applied Mathematics, vol. 21, no. 1, pp. 35-49, 2008.
  • N. Sherif and E. Morsy, Computing real logarithm of a real matrix, International Journal of Algebra, vol. 2, no. 3, pp. 131-142, 2008.
  • E. Morsy and H. Nagamochi, An improved approximation algorithm for capacitated multicast routings in networks, Theoretical Computer Science, vol. 390, no. 1, pp. 81-91, 2008.
  • E. Morsy and H. Nagamochi, Approximation algorithms for multicast routings in a network with multi-sources, IEICE Transactions vol. E90-A, no. 5, pp. 900-906, 2007.

Conferences (refereed):

  • John Augustine, Anisur Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal, Search and Storage in Dynamic Peer-to-Peer Networks, the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), July 23-25, 2013, Montreal, QC, Canada, 53-62.
  • 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 8-12, 2013, Riga, Latvia, Lecture Notes in Computer Science, volume 7966, Springer 2013, 581-593.
  • E. Morsy, Approximating the k-Splittable Capacitated Network Design Problem, Proceedings of the 39th 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, 344-355.
  • 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 18-20, 2009, Indian Statistical Institute, Kolkata, India, Lecture Notes in Computer Science, volume 5431, Springer 2009, 202-213.
  • E. Morsy and H. Nagamochi, Approximating the generalized capacitated tree-routing, 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, 621-630.
  • E. Morsy and H. Nagamochi, Approximation to the minimum cost edge installation problem, The 18th International Symposium on Algorithms and Computation (ISAAC) December 17-19, 2007, Sendai, Japan, Lecture Notes in Computer Science, volume 4835, Springer 2007, 292-303.
  • E. Morsy and H. Nagamochi, Approximating capacitated tree-routings 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, 342-353.
  • 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 18-20, 2006, Arcadia Ichigaya, Tokyo, Japan, pp. 12-17. 

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 27-March 1, 2014, Augsburg, Germany.
  • E. Morsy and E. Pesch, Approximation Algorithms for Inventory Constrained Scheduling on a Single Machine, the INFORMS Annual Meeting,  October 6-9, 2013, Minneapolis, USA.
  •  E. Morsy, Approximating the k-Splittable Capacitated Network Design Problem, the International Conference on Operations Research (OR2013), September 3-6, 2013, Rotterdam, Netherland.
  • E. Morsy, Approximating the k-Splittable Capacitated Network Design Problem, the 11th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP2013), June 23-28, 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.
 
       
    Subpages (1): farm practice cource