Sagi Snir

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Shlomo Moran

> Home > Persons > Sagi Snir

Publications

2012
[j21]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/GronauMS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GronauMS12
Ilan Gronau, Shlomo Moran, Sagi Snir:
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges. Random Struct. Algorithms 40(3): 350-384 (2012)
2011
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/talg/MoranSS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/MoranSS11
Shlomo Moran, Sagi Snir, Wing-Kin Sung:
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds. ACM Trans. Algorithms 7(4): 42:1-42:20 (2011)
2008
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/MoranS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/MoranS08
Shlomo Moran, Sagi Snir:
Convex recolorings of strings and trees: Definitions, hardness results and algorithms. J. Comput. Syst. Sci. 74(5): 850-869 (2008)
[c11]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/GronauMS08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/GronauMS08
Ilan Gronau, Shlomo Moran, Sagi Snir:
Fast and reliable reconstruction of phylogenetic trees with very short edges. SODA 2008: 379-388
2007
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcss/MoranS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/MoranS07
Shlomo Moran, Sagi Snir:
Efficient approximation of convex recolorings. J. Comput. Syst. Sci. 73(7): 1078-1089 (2007)
2005
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/approx/MoranS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/MoranS05
Shlomo Moran, Sagi Snir:
Efficient Approximation of Convex Recolorings. APPROX-RANDOM 2005: 192-208
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/wabi/MoranRS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wabi/MoranRS05
Shlomo Moran, Satish Rao, Sagi Snir:
Using Semi-definite Programming to Enhance Supertree Resolvability. WABI 2005: 89-103
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/wads/MoranS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/MoranS05
Shlomo Moran, Sagi Snir:
Convex Recolorings of Strings and Trees: Definitions, Hardness Results and Algorithms. WADS 2005: 218-232
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0505077
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0505077
Shlomo Moran, Sagi Snir:
Efficient Approximation of Convex Recolorings. CoRR abs/cs/0505077 (2005)
2000
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/MoranS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MoranS00
Shlomo Moran, Sagi Snir:
Simple and efficient network decomposition and synchronization. Theor. Comput. Sci. 243(1-2): 217-241 (2000)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.