Zvi Gotthilf

	2011
13		Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: Restricted Common Superstring and Restricted Common Supersequence. CPM 2011: 467-478
12		Amihood Amir, Zvi Gotthilf, B. Riva Shalom: Weighted Shortest Common Supersequence. SPIRE 2011: 44-54
	2010
11		Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein: Restricted LCS. SPIRE 2010: 250-257
10		Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: On Shortest Common Superstring and Swap Permutations. SPIRE 2010: 270-278
9		Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa: Permuted Common Supersequence CoRR abs/1004.0424: (2010)
8		Amihood Amir, Zvi Gotthilf, B. Riva Shalom: Weighted LCS. J. Discrete Algorithms 8(3): 273-281 (2010)
	2009
7		Amihood Amir, Zvi Gotthilf, B. Riva Shalom: Weighted LCS. IWOCA 2009: 36-47
6		Zvi Gotthilf, Moshe Lewenstein: Improved Approximation Results on the Shortest Common Supersequence Problem. SPIRE 2009: 277-284
5		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
4		Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein: Constrained LCS: Hardness and Approximation. CPM 2008: 255-262
3		Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt: A Approximation Algorithm for the Minimum Maximal Matching Problem. WAOA 2008: 267-278
	2007
2		Zvi Gotthilf, Moshe Lewenstein: Approximating Constrained LCS. SPIRE 2007: 164-172
	2005
1		Zvi Gotthilf, Moshe Lewenstein: Tighter Approximations for Maximum Induced Matchings in Regular Graphs. WAOA 2005: 270-281

Coauthor Index

1	Amihood Amir	[7] [8] [12]
2	Raphaël Clifford	[9] [13]
3	Danny Hermelin	[4] [11]
4	Gad M. Landau	[11]
5	Moshe Lewenstein	[1] [2] [3] [4] [5] [6] [9] [10] [11] [13]
6	Alexandru Popa	[9] [10] [13]
7	Elad Rainshmidt	[3]
8	B. Riva Shalom	[7] [8] [12]

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page