Nissan Lev-Tov

11 papers A 1B 3Journal 5Unranked 2
YearRankTypeTitle / Venue / Authors
2012 J jnl
Conflict-Free Coloring of points on a line with respect to a set of intervals.
Comput. Geom.
Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern
2010 B conf
Dynamic file-selection policies for bundling in BitTorrent-like systems.
IWQoS
Nissan Lev-Tov, Niklas Carlsson, Zongpeng Li, Carey Williamson, Song Zhang
2009 J jnl
Conflict-free coloring of unit disks.
Discret. Appl. Math.
Nissan Lev-Tov, David Peleg
2009 B conf
From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.
GLOBECOM
Chen Avin, Ran Giladi, Nissan Lev-Tov, Zvi Lotker
2008 J jnl
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks.
Comput. Geom.
Paz Carmi, Matthew J. Katz, Nissan Lev-Tov
2007 — conf
Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals.
CCCG
Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern
2007 B conf
Covering Points by Unit Disks of Fixed Location.
ISAAC
Paz Carmi, Matthew J. Katz, Nissan Lev-Tov
2005 J jnl
Polynomial time approximation schemes for base station coverage with minimum total radii.
Comput. Networks
Nissan Lev-Tov, David Peleg
2004 A conf
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
STACS
Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
2002 — conf
Exact Algorithms and Approximation Schemes for Base Station Placement Problems.
SWAT
Nissan Lev-Tov, David Peleg
2002 J jnl
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
Discret. Appl. Math.
Sharon Aviran, Nissan Lev-Tov, Shmuel Onn, Uriel G. Rothblum