dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Shlomo Moran (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlan Gronau, Shlomo Moran, Sagi Snir: Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. Random Struct. Algorithms 40(3): 350-384 (2012)
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Sagi Snir, Wing-Kin Sung: Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. ACM Transactions on Algorithms 7(4): 42 (2011)
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlan Gronau, Shlomo Moran, Sagi Snir: Fast and reliable reconstruction of phylogenetic trees with very short edges. SODA 2008: 379-388
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Sagi Snir: Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci. 74(5): 850-869 (2008)
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Sagi Snir: Efficient approximation of convex recolorings. J. Comput. Syst. Sci. 73(7): 1078-1089 (2007)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Sagi Snir: Efficient Approximation of Convex Recolorings. APPROX-RANDOM 2005: 192-208
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Satish Rao, Sagi Snir: Using Semi-definite Programming to Enhance Supertree Resolvability. WABI 2005: 89-103
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Sagi Snir: Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. WADS 2005: 218-232
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Sagi Snir: Efficient Approximation of Convex Recolorings CoRR abs/cs/0505077: (2005)
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLShlomo Moran, Sagi Snir: Simple and efficient network decomposition and synchronization. Theor. Comput. Sci. 243(1-2): 217-241 (2000)

Selection of 10 from 127 records - Shlomo Moran has 64 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page