Zvi Gotthilf

13 papers B 4C 6Journal 3
YearRankTypeTitle / Venue / Authors
2011 B conf
Restricted Common Superstring and Restricted Common Supersequence.
CPM
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
2011 C conf
Weighted Shortest Common Supersequence.
SPIRE
Amihood Amir, Zvi Gotthilf, B. Riva Shalom
2010 C conf
On Shortest Common Superstring and Swap Permutations.
SPIRE
Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
2010 J jnl
Permuted Common Supersequence
CoRR
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
2010 C conf
Restricted LCS.
SPIRE
Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein
2010 J jnl
Weighted LCS.
J. Discrete Algorithms
Amihood Amir, Zvi Gotthilf, B. Riva Shalom
2009 C conf
Improved Approximation Results on the Shortest Common Supersequence Problem.
SPIRE
Zvi Gotthilf, Moshe Lewenstein
2009 J jnl
Improved algorithms for the k simple shortest paths and the replacement paths problems.
Inf. Process. Lett.
Zvi Gotthilf, Moshe Lewenstein
2009 C conf
Weighted LCS.
IWOCA
Amihood Amir, Zvi Gotthilf, B. Riva Shalom
2008 B conf
A Approximation Algorithm for the Minimum Maximal Matching Problem.
WAOA
Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt
2008 B conf
Constrained LCS: Hardness and Approximation.
CPM
Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein
2007 C conf
Approximating Constrained LCS.
SPIRE
Zvi Gotthilf, Moshe Lewenstein
2005 B conf
Tighter Approximations for Maximum Induced Matchings in Regular Graphs.
WAOA
Zvi Gotthilf, Moshe Lewenstein