Department of Applied Mathematics and Physics

Graduate School of
Informatics

Kyoto University

Yoshida Honmachi, Sakyo,

Kyoto 606-8501, Japan

**Phone:** +81-75-753-5514 **Fax:** +81-75-753-5514 **Email:** **Office:** Engineering Bld. 8, Room 317

**Areas of Interest:**

- Approximation Algorithms
- Graph Algorithms
- Discrete Mathematics
- Graph Theory

**Publications:**

- Ehab Morsy, Hiroshi Nagamochi,

An improved approximation algorithm for capacitated multicast routings in networks,

In Proceedings of International Symposium on Scheduling 2006 (ISS2006) July 18-20, 2006 in Arcadia Ichigaya, Tokyo, Japan.

- Ehab Morsy, Hiroshi Nagamochi,

Approximation algorithms for multicast routings in a network with multi-sources,

IEICE Transactions vol. E90-A, no. 5, 2007, pp. 900-906.

- Ehab Morsy, Hiroshi 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, 2007, 342-353.

**Links:**

**Academic
Degree:** Master of Science (Suez Canal University, Egypt)

**Last Updated:** September 20, 2007