| |
| 2008 | ||
|---|---|---|
| 4 | EE | Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein: Constrained LCS: Hardness and Approximation. CPM 2008: 255-262 |
| 3 | EE | Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt: A Approximation Algorithm for the Minimum Maximal Matching Problem. WAOA 2008: 267-278 |
| 2007 | ||
| 2 | EE | Zvi Gotthilf, Moshe Lewenstein: Approximating Constrained LCS. SPIRE 2007: 164-172 |
| 2005 | ||
| 1 | EE | Zvi Gotthilf, Moshe Lewenstein: Tighter Approximations for Maximum Induced Matchings in Regular Graphs. WAOA 2005: 270-281 |
| 1 | Danny Hermelin | [4] |
| 2 | Moshe Lewenstein | [1] [2] [3] [4] |
| 3 | Elad Rainshmidt | [3] |