Nissan Lev-Tov

According to our database1, Nissan Lev-Tov authored at least 11 papers between 2002 and 2012.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2012
Conflict-Free Coloring of points on a line with respect to a set of intervals.
Comput. Geom., 2012

2010
Dynamic file-selection policies for bundling in BitTorrent-like systems.
Proceedings of the 18th International Workshop on Quality of Service, 2010

2009
Conflict-free coloring of unit disks.
Discret. Appl. Math., 2009

From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks.
Comput. Geom., 2008

2007
Covering Points by Unit Disks of Fixed Location.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2005
Polynomial time approximation schemes for base station coverage with minimum total radii.
Comput. Networks, 2005

2004
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
Proceedings of the STACS 2004, 2004

2003
Network structure and strong equilibrium in route selection games.
Math. Soc. Sci., 2003

2002
Vertex characterization of partition polytopes of bipartitions and of planar point sets.
Discret. Appl. Math., 2002

Exact Algorithms and Approximation Schemes for Base Station Placement Problems.
Proceedings of the Algorithm Theory, 2002


  Loading...