default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNissan Lev-Tov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j6]Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern:
Conflict-Free Coloring of points on a line with respect to a set of intervals. Comput. Geom. 45(9): 508-514 (2012)- 2010
- [c6]Nissan Lev-Tov, Niklas Carlsson, Zongpeng Li, Carey Williamson, Song Zhang:
Dynamic file-selection policies for bundling in BitTorrent-like systems. IWQoS 2010: 1-9
2000 – 2009
- 2009
- [j5]Nissan Lev-Tov, David Peleg:
Conflict-free coloring of unit disks. Discret. Appl. Math. 157(7): 1521-1532 (2009) - [c5]Chen Avin
, Ran Giladi, Nissan Lev-Tov, Zvi Lotker:
From Trees to DAGs: Improving the Performance of Bridged Ethernet Networks. GLOBECOM 2009: 1-6 - 2008
- [j4]Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
Polynomial-time approximation schemes for piercing and covering with applications in wireless networks. Comput. Geom. 39(3): 209-218 (2008) - 2007
- [c4]Matthew J. Katz, Nissan Lev-Tov, Gila Morgenstern:
Conflict-Free Coloring of Points on a Line with respect to a Set of Intervals. CCCG 2007: 93-96 - [c3]Paz Carmi, Matthew J. Katz, Nissan Lev-Tov:
Covering Points by Unit Disks of Fixed Location. ISAAC 2007: 644-655 - 2005
- [j3]Nissan Lev-Tov, David Peleg:
Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Networks 47(4): 489-501 (2005) - 2004
- [c2]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. STACS 2004: 418-427 - 2003
- [j2]Ron Holzman, Nissan Law-yone:
Network structure and strong equilibrium in route selection games. Math. Soc. Sci. 46(2): 193-205 (2003) - 2002
- [j1]Sharon Aviran, Nissan Lev-Tov, Shmuel Onn, Uriel G. Rothblum:
Vertex characterization of partition polytopes of bipartitions and of planar point sets. Discret. Appl. Math. 124(1-3): 1-15 (2002) - [c1]Nissan Lev-Tov, David Peleg:
Exact Algorithms and Approximation Schemes for Base Station Placement Problems. SWAT 2002: 90-99
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
