| * | 2009 |
|---|
| 8 | EE | Nissan Lev-Tov,
David Peleg:
Conflict-free coloring of unit disks.
Discrete Applied Mathematics 157(7): 1521-1532 (2009) |
| 2008 |
|---|
| 7 | EE | Paz Carmi,
Matthew J. Katz,
Nissan Lev-Tov:
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks.
Comput. Geom. 39(3): 209-218 (2008) |
| 2007 |
|---|
| 6 | | Matthew J. Katz,
Nissan Lev-Tov,
Gila Morgenstern:
Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals.
CCCG 2007: 93-96 |
| 5 | EE | Paz Carmi,
Matthew J. Katz,
Nissan Lev-Tov:
Covering Points by Unit Disks of Fixed Location.
ISAAC 2007: 644-655 |
| 2005 |
|---|
| 4 | EE | Nissan Lev-Tov,
David Peleg:
Polynomial time approximation schemes for base station coverage with minimum total radii.
Computer Networks 47(4): 489-501 (2005) |
| 2004 |
|---|
| 3 | EE | Christoph Ambühl,
Andrea E. F. Clementi,
Miriam Di Ianni,
Nissan Lev-Tov,
Angelo Monti,
David Peleg,
Gianluca Rossi,
Riccardo Silvestri:
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
STACS 2004: 418-427 |
| 2002 |
|---|
| 2 | EE | Nissan Lev-Tov,
David Peleg:
Exact Algorithms and Approximation Schemes for Base Station Placement Problems.
SWAT 2002: 90-99 |
| 1 | | Sharon Aviran,
Nissan Lev-Tov,
Shmuel Onn,
Uriel G. Rothblum:
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
Discrete Applied Mathematics 124(1-3): 1-15 (2002) |
