Search the dblp DataBase
Nissan Lev-Tov :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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. [Citation Graph (0, 0)][DBLP ] STACS, 2004, pp:418-427 [Conf ] Nissan Lev-Tov , David Peleg Exact Algorithms and Approximation Schemes for Base Station Placement Problems. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:90-99 [Conf ] Nissan Lev-Tov , David Peleg Polynomial time approximation schemes for base station coverage with minimum total radii. [Citation Graph (0, 0)][DBLP ] Computer Networks, 2005, v:47, n:4, pp:489-501 [Journal ] Sharon Aviran , Nissan Lev-Tov , Shmuel Onn , Uriel G. Rothblum Vertex characterization of partition polytopes of bipartitions and of planar point sets. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2002, v:124, n:1-3, pp:1-15 [Journal ] Matthew J. Katz , Nissan Lev-Tov , Gila Morgenstern Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals. [Citation Graph (0, 0)][DBLP ] CCCG, 2007, pp:93-96 [Conf ] Covering Points by Unit Disks of Fixed Location. [Citation Graph (, )][DBLP ] From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. [Citation Graph (, )][DBLP ] Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. [Citation Graph (, )][DBLP ] Conflict-free coloring of unit disks. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs