Tighter Approximations for Maximum Induced Matchings in Regular Graphs. - Zvi Gotthilf; Moshe Lewenstein (WAOA, 2005)

Approximating Constrained LCS. - Zvi Gotthilf; Moshe Lewenstein (SPIRE, 2007)

Constrained LCS: Hardness and Approximation. - Zvi Gotthilf; Danny Hermelin; Moshe Lewenstein (CPM, 2008)

A Approximation Algorithm for the Minimum Maximal Matching Problem. - Zvi Gotthilf; Moshe Lewenstein; Elad Rainshmidt (WAOA, 2008)

Improved Approximation Results on the Shortest Common Supersequence Problem. - Zvi Gotthilf; Moshe Lewenstein (SPIRE, 2009)

Improved algorithms for the k simple shortest paths and the replacement paths problems. - Zvi Gotthilf; Moshe Lewenstein (Inf. Process. Lett., 2009)

Restricted LCS. - Zvi Gotthilf; Danny Hermelin; Gad M. Landau; Moshe Lewenstein (SPIRE, 2010)

On Shortest Common Superstring and Swap Permutations. - Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (SPIRE, 2010)

Permuted Common Supersequence - Raphaël Clifford; Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (CoRR, 2010)

Weighted LCS. - Amihood Amir; Zvi Gotthilf; B. Riva Shalom (J. Discrete Algorithms, 2010)

Restricted Common Superstring and Restricted Common Supersequence. - Raphaël Clifford; Zvi Gotthilf; Moshe Lewenstein; Alexandru Popa 001 (CPM, 2011)

Weighted Shortest Common Supersequence. - Amihood Amir; Zvi Gotthilf; B. Riva Shalom (SPIRE, 2011)