Zvi Gotthilf

According to our database, Zvi Gotthilf authored at least 12 papers between 2005 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2011

Weighted Shortest Common Supersequence.

Amihood Amir, Zvi Gotthilf, B. Riva Shalom

Proceedings of the String Processing and Information Retrieval, 2011

Restricted Common Superstring and Restricted Common Supersequence.

Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

Weighted LCS.

Amihood Amir, Zvi Gotthilf, B. Riva Shalom

J. Discrete Algorithms, 2010

Permuted Common Supersequence

Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

CoRR, 2010

On Shortest Common Superstring and Swap Permutations.

Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa

Proceedings of the String Processing and Information Retrieval, 2010

Restricted LCS.

Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein

Proceedings of the String Processing and Information Retrieval, 2010

2009

Improved algorithms for the k simple shortest paths and the replacement paths problems.

Zvi Gotthilf, Moshe Lewenstein

Inf. Process. Lett., 2009

Improved Approximation Results on the Shortest Common Supersequence Problem.

Zvi Gotthilf, Moshe Lewenstein

Proceedings of the String Processing and Information Retrieval, 2009

2008

A Approximation Algorithm for the Minimum Maximal Matching Problem.

Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Constrained LCS: Hardness and Approximation.

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein

Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

2007

Approximating Constrained LCS.

Zvi Gotthilf, Moshe Lewenstein

Proceedings of the String Processing and Information Retrieval, 2007

2005

Tighter Approximations for Maximum Induced Matchings in Regular Graphs.

Zvi Gotthilf, Moshe Lewenstein

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005