Nissan Lev-Tov

Vertex characterization of partition polytopes of bipartitions and of planar point sets

Uriel G. Rothblum, Nissan Lev-Tov, Shmuel Onn, 2002, Discret. Appl. Math..

EÆ ient Algorithms for Low-EnergyBounded-Hop Broad ast in Ad-Ho Wireless Networks ( Extended Abstra t )

D. Peleg, Gianlu a Rossi, A. Clementi, 2003 .

Covering Points by Unit Disks of Fixed Location

Matthew J. Katz, Paz Carmi, Nissan Lev-Tov, 2007, ISAAC.

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks

Andrea E. F. Clementi, Gianluca Rossi, David Peleg, 2004, STACS.

Dynamic file-selection policies for bundling in BitTorrent-like systems

Carey L. Williamson, Niklas Carlsson, Zongpeng Li, 2010, 2010 IEEE 18th International Workshop on Quality of Service (IWQoS).

Network structure and strong equilibrium in route selection games

Ron Holzman, Nissan Lev-Tov, R. Holzman, 2003, Math. Soc. Sci..

Polynomial time approximation schemes for base station coverage with minimum total radii

David Peleg, Nissan Lev-Tov, D. Peleg, 2005, Comput. Networks.

Polynomial-time approximation schemes for piercing and covering with applications in wireless networks

Matthew J. Katz, Paz Carmi, Nissan Lev-Tov, 2008, Comput. Geom..

Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals

Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern, 2012, CCCG.

From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks

Chen Avin, Nissan Lev-Tov, Ran Giladi, 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.