On demand string sorting over unbounded alphabets
- Carmel Kent
- Moshe Lewenstein
- et al.
- 2012
- Theoretical Computer Science
Paper
Publications
13 results for Moshe Lewenstein
On the longest common rigid subsequence problem
- Nikhil Bansal
- Moshe Lewenstein
- et al.
- 2008
- Algorithmica (New York)
PaperConstructive bounds on ordered factorizations
- Don Coppersmith
- Moshe Lewenstein
- 2005
- SIAM Journal on Discrete Mathematics
PaperApproximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Haim Kaplan
- Moshe Lewenstein
- et al.
- 2005
- Journal of the ACM
PaperAn improved upper bound for the TSP in cubic 3-edge-connected graphs
- David Gamarnik
- Moshe Lewenstein
- et al.
- 2005
- Operations Research Letters
PaperApproximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Haim Kaplan
- Moshe Lewenstein
- et al.
- 2003
- FOCS 2003
Conference paperA 5/8 approximation algorithm for the maximum asymmetric TSP
- Moshe Lewenstein
- Maxim Sviridenko
- 2003
- SIAM Journal on Discrete Mathematics
PaperApproximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- H. Kaplan
- M. Lewenstein
- et al.
- 2003
- FOCS 2003
Conference paperOverlap matching
- Amihood Amir
- Richard Cole
- et al.
- 2003
- Information and Computation
PaperUniquely restricted matchings
- Martin C. Golumbic
- T. Hirst
- et al.
- 2001
- Algorithmica (New York)
Paper