Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Ehab Morsy" ( http://dblp.L3S.de/Authors/Ehab_Morsy )

  Author page on DBLP  Author page in RDF  Community of Ehab Morsy in ASPL-2

Publication years (Num. hits)
2007 (3) 2008 (2) 2009 (1) 2010 (3) 2011 (2)
Publication types (Num. hits)
article(7) inproceedings(4)
Venues (Conferences, Journals, ...)
IEICE Transactions(2) Theor. Comput. Sci.(2) COCOON(1) ISAAC(1) J. Comb. Optim.(1) J. Discrete Algorithms(1) J. Graph Algorithms Appl.(1) TAMC(1) WALCOM(1)
Authors
Ehab Morsy(11) Hiroshi Nagamochi(11) Seigo Karakawa(2) Shunsuke Ota(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 4 keywords
Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Ehab Morsy, Hiroshi Nagamochi Approximating capacitated tree-routings in networks. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Minmax Tree Cover in the Euclidean Space. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2011 DBLP  BibTeX  RDF
1Shunsuke Ota, Ehab Morsy, Hiroshi Nagamochi A plane graph representation of triconnected graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ehab Morsy, Hiroshi Nagamochi Approximation to the Minimum Cost Edge Installation Problem. Search on Bibsonomy IEICE Transactions The full citation details ... 2010 DBLP  BibTeX  RDF
1Ehab Morsy, Hiroshi Nagamochi On the approximation of the generalized capacitated tree-routing problem. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi Minmax Tree Cover in the Euclidean Space. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minmax Tree Cover, Balanced Partition, Tree Cover, Approximation Algorithms, Graph Algorithms
1Ehab Morsy, Hiroshi Nagamochi An improved approximation algorithm for capacitated multicast routings in networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ehab Morsy, Hiroshi Nagamochi Approximating the Generalized Capacitated Tree-Routing Problem. Search on Bibsonomy COCOON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Ehab Morsy, Hiroshi Nagamochi Approximation Algorithms for Multicast Routings in a Network with Multi-Sources. Search on Bibsonomy IEICE Transactions The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Ehab Morsy, Hiroshi Nagamochi Approximating Capacitated Tree-Routings in Networks. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Tree Cover, Approximation Algorithm, Graph Algorithm, Network Optimization, Routing Problems
1Ehab Morsy, Hiroshi Nagamochi Approximation to the Minimum Cost Edge Installation Problem. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Approximation algorithm, Graph algorithm, Network optimization, Routing problem
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.