Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.

Ehab Morsy

2010 – today

see FAQ

What is the meaning of the colors in the publication list?

2013
[c5]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/sofsem/Morsy13
- ask others
Ehab Morsy: Approximating the k-Splittable Capacitated Network Design Problem. SOFSEM 2013: 344-355
[i1]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1305-1121
- ask others
John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal: Storage and Search in Dynamic Peer-to-Peer Networks. CoRR abs/1305.1121 (2013)
2011
[j7]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jco/MorsyN11
- ask others
Ehab Morsy, Hiroshi Nagamochi: Approximating capacitated tree-routings in networks. J. Comb. Optim. 21(2): 254-267 (2011)
[j6]
- view
  - electronic edition @ jgaa.info
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jgaa/KarakawaMN11
- ask others
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi: Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl. 15(3): 345-371 (2011)
2010
[j5]
- view
  - electronic edition @ ieice.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ieicet/MorsyN10
- ask others
Ehab Morsy, Hiroshi Nagamochi: Approximation to the Minimum Cost Edge Installation Problem. IEICE Transactions 93-A(4): 778-786 (2010)
[j4]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jda/MorsyN10
- ask others
Ehab Morsy, Hiroshi Nagamochi: On the approximation of the generalized capacitated tree-routing problem. J. Discrete Algorithms 8(3): 311-320 (2010)
[j3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/OtaMN10
- ask others
Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi: A plane graph representation of triconnected graphs. Theor. Comput. Sci. 411(44-46): 3979-3993 (2010)

2000 – 2009

see FAQ

What is the meaning of the colors in the publication list?

2009
[c4]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/walcom/KarakawaMN09
- ask others
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi: Minmax Tree Cover in the Euclidean Space. WALCOM 2009: 202-213
2008
[j2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/MorsyN08
- ask others
Ehab Morsy, Hiroshi Nagamochi: An improved approximation algorithm for capacitated multicast routings in networks. Theor. Comput. Sci. 390(1): 81-91 (2008)
[c3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/cocoon/MorsyN08
- ask others
Ehab Morsy, Hiroshi Nagamochi: Approximating the Generalized Capacitated Tree-Routing Problem. COCOON 2008: 621-630
2007
[j1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ieicet/MorsyN07
- ask others
Ehab Morsy, Hiroshi Nagamochi: Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. IEICE Transactions 90-A(5): 900-906 (2007)
[c2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/isaac/MorsyN07
- ask others
Ehab Morsy, Hiroshi Nagamochi: Approximation to the Minimum Cost Edge Installation Problem. ISAAC 2007: 292-303
[c1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/tamc/MorsyN07
- ask others
Ehab Morsy, Hiroshi Nagamochi: Approximating Capacitated Tree-Routings in Networks. TAMC 2007: 342-353

Coauthor Index

see FAQ

What is the meaning of the colors in the coauthor index?