Exact Algorithms and Approximation Schemes for Base Station Placement Problems. - Nissan Lev-Tov; David Peleg (SWAT, 2002)

Vertex characterization of partition polytopes of bipartitions and of planar point sets. - Sharon Aviran; Nissan Lev-Tov; Shmuel Onn; Uriel G. Rothblum (Discret. Appl. Math., 2002)

Network structure and strong equilibrium in route selection games. - Ron Holzman; Nissan Law-yone (Math. Soc. Sci., 2003)

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Nissan Lev-Tov; Angelo Monti; David Peleg; Gianluca Rossi; Riccardo Silvestri (STACS, 2004)

Polynomial time approximation schemes for base station coverage with minimum total radii. - Nissan Lev-Tov; David Peleg (Comput. Networks, 2005)

Covering Points by Unit Disks of Fixed Location. - Paz Carmi; Matthew J. Katz; Nissan Lev-Tov (ISAAC, 2007)

Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. - Paz Carmi; Matthew J. Katz; Nissan Lev-Tov (Comput. Geom., 2008)

From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. - Chen Avin; Ran Giladi; Nissan Lev-Tov; Zvi Lotker (GLOBECOM, 2009)

Conflict-free coloring of unit disks. - Nissan Lev-Tov; David Peleg (Discret. Appl. Math., 2009)

Dynamic file-selection policies for bundling in BitTorrent-like systems. - Nissan Lev-Tov; Niklas Carlsson; Zongpeng Li; Carey Williamson; Song Zhang 003 (IWQoS, 2010)

Conflict-Free Coloring of points on a line with respect to a set of intervals. - Matthew J. Katz; Nissan Lev-Tov; Gila Morgenstern (Comput. Geom., 2012)