 | 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 |
