Moshe Lewenstein

	2009
63		Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein: Generalized Substring Compression. CPM 2009: 26-38
62		Zvi Gotthilf, Moshe Lewenstein: Improved Approximation Results on the Shortest Common Supersequence Problem. SPIRE 2009: 277-284
61		Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009)
60		Zvi Gotthilf, Moshe Lewenstein: Improved algorithms for the k simple shortest paths and the replacement paths problems. Inf. Process. Lett. 109(7): 352-355 (2009)
	2008
59		Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein: Constrained LCS: Hardness and Approximation. CPM 2008: 255-262
58		Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein: On the Longest Common Parameterized Subsequence. CPM 2008: 303-315
57		Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt: A Approximation Algorithm for the Minimum Maximal Matching Problem. WAOA 2008: 267-278
56		Moshe Lewenstein: Dictionary Matching and Indexing (Exact and with Errors). Encyclopedia of Algorithms 2008
55		Moshe Lewenstein: Parameterized Matching. Encyclopedia of Algorithms 2008
	2007
54		Carmel Kent, Moshe Lewenstein, Dafna Sheinwald: On Demand String Sorting over Unbounded Alphabets. CPM 2007: 16-27
53		Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur: Finding Witnesses by Peeling. CPM 2007: 28-39
52		Amihood Amir, Johannes Fischer, Moshe Lewenstein: Two-Dimensional Range Minimum Queries. CPM 2007: 286-294
51		Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz: Optimization problems in multiple-interval graphs. SODA 2007: 268-277
50		Tsvi Kopelowitz, Moshe Lewenstein: Dynamic weighted ancestors. SODA 2007: 565-574
49		Zvi Gotthilf, Moshe Lewenstein: Approximating Constrained LCS. SPIRE 2007: 164-172
48		Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein: Range Non-overlapping Indexing and Successive List Indexing. WADS 2007: 625-636
47		Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol: Dynamic text and static pattern matching. ACM Transactions on Algorithms 3(2): (2007)
46		Carmit Hazay, Moshe Lewenstein, Dina Sokol: Approximate parameterized matching. ACM Transactions on Algorithms 3(3): (2007)
45		Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein: Parameterized matching with mismatches. J. Discrete Algorithms 5(1): 135-140 (2007)
44		Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)
	2006
43		Moshe Lewenstein, Gabriel Valiente: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings Springer 2006
42		Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein: Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) 2006: 358-369
41		Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006)
	2005
40		Carmit Hazay, Moshe Lewenstein, Dekel Tsur: Two Dimensional Parameterized Matching. CPM 2005: 266-279
39		Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini: Dotted interval graphs and high throughput genotyping. SODA 2005: 339-348
38		Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein: Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78
37		Zvi Gotthilf, Moshe Lewenstein: Tighter Approximations for Maximum Induced Matchings in Regular Graphs. WAOA 2005: 270-281
36		Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005)
35		David Gamarnik, Moshe Lewenstein, Maxim Sviridenko: An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett. 33(5): 467-474 (2005)
34		Don Coppersmith, Moshe Lewenstein: Constructive Bounds on Ordered Factorizations. SIAM J. Discrete Math. 19(2): 301-303 (2005)
	2004
33		Carmit Hazay, Moshe Lewenstein, Dina Sokol: Approximate Parameterized Matching. ESA 2004: 414-425
32		Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat: Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792
31		Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9
30		Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein: Dictionary matching and indexing with errors and don't cares. STOC 2004: 91-100
29		Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004)
	2003
28		Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-
27		Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat: Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942
26		Moshe Lewenstein, Maxim Sviridenko: Approximating asymmetric maximum TSP. SODA 2003: 646-654
25		Richard Cole, Moshe Lewenstein: Multidimensional matching and fast search in suffix trees. SODA 2003: 851-852
24		Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol: Dynamic Text and Static Pattern Matching. WADS 2003: 340-352
23		Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. WADS 2003: 353-364
22		Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. Inf. Comput. 181(1): 57-74 (2003)
21		Moshe Lewenstein, Maxim Sviridenko: A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. SIAM J. Discrete Math. 17(2): 237-248 (2003)
	2002
20		Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002)
	2001
19		Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25
18		Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. SODA 2001: 279-288
17		Amihood Amir, Ely Porat, Moshe Lewenstein: Approximate subset matching with Don't Cares. SODA 2001: 305-306
16		Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein: Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001)
	2000
15		Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate Swapped Matching. FSTTCS 2000: 302-311
14		Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. SODA 2000: 794-803
13		Amihood Amir, Ayelet Butman, Moshe Lewenstein: Real scaled matching. SODA 2000: 815-816
12		Martin Charles Golumbic, Moshe Lewenstein: New results on induced matchings. Discrete Applied Mathematics 101(1-3): 157-165 (2000)
11		Amihood Amir, Moshe Lewenstein, Noa Lewenstein: Pattern Matching in Hypertext. J. Algorithms 35(1): 82-99 (2000)
10		Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000)
9		Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh: Text Indexing and Dictionary Matching with One Error. J. Algorithms 37(2): 309-325 (2000)
	1999
8		Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh: Indexing and Dictionary Matching with One Error. WADS 1999: 181-192
7		Tirza Hirst, Moshe Lewenstein: Alternation and Bounded Concurrency Are Reverse Equivalent. Inf. Comput. 152(2): 173-187 (1999)
6		Amihood Amir, Ayelet Butman, Moshe Lewenstein: Real Scaled Matching. Inf. Process. Lett. 70(4): 185-190 (1999)
	1998
5		Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Efficient Special Cases of Pattern Matching with Swaps. CPM 1998: 209-220
4		Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68(3): 125-132 (1998)
	1997
3		Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. FOCS 1997: 144-153
2		Amihood Amir, Moshe Lewenstein, Noa Lewenstein: Pattern Matching In Hypertext. WADS 1997: 160-173
1		Amihood Amir, Alberto Apostolico, Moshe Lewenstein: Inverse Pattern Matching. J. Algorithms 24(2): 325-339 (1997)

Coauthor Index

1	Amihood Amir	[1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [13] [14] [15] [17] [18] [20] [22] [23] [24] [27] [29] [31] [38] [41] [44] [47] [52] [61]
2	Alberto Apostolico	[1] [45]
3	Yonatan Aumann	[3] [10] [27] [39] [41] [53]
4	Ayelet Butman	[6] [13] [23] [31] [44] [51] [61]
5	Richard Cole	[18] [19] [22] [25] [27] [30] [42]
6	Don Coppersmith	[34]
7	Péter L. Erdös	[45]
8	Johannes Fischer	[52]
9	David Gamarnik	[35]
10	Martin Charles Golumbic	[12] [16]
11	Zvi Gotthilf	[37] [49] [57] [59] [60] [62]
12	Lee-Ad Gottlieb	[30]
13	Ramesh Hariharan	[18] [19] [22]
14	Carmit Hazay	[33] [40] [46]
15	Danny Hermelin	[51] [59]
16	Tirza Hirst	[7] [16]
17	Piotr Indyk	[32]
18	Haim Kaplan	[28] [36]
19	Orgad Keller	[48] [58] [63]
20	Carmel Kent	[54]
21	Dmitry Keselman	[8] [9]
22	Tsvi Kopelowitz	[38] [42] [48] [50] [58] [63]
23	Gad M. Landau	[3] [4] [5] [8] [9] [10] [24] [47]
24	Shir Landau	[63]
25	Noa Lewenstein	[2] [3] [4] [5] [8] [9] [10] [11] [38] [53]
26	Ohad Lipsky	[32]
27	Oren Melamud	[39]
28	Ron Y. Pinter	[39]
29	Ely Porat	[14] [15] [17] [18] [19] [20] [22] [23] [27] [29] [31] [32] [41] [44] [61]
30	Elad Rainshmidt	[57]
31	Dror Rawitz	[51]
32	Michael Rodeh	[8] [9]
33	Nira Shafrir	[28] [36]
34	Dafna Sheinwald	[54]
35	Dina Sokol	[24] [33] [46] [47]
36	Maxim Sviridenko	[21] [26] [28] [35] [36]
37	Dekel Tsur	[31] [40] [44] [53]
38	Gabriel Valiente	[43]
39	Zohar Yakhini	[39]