default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZvi Gotthilf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[c10]Raphaël Clifford
, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
Restricted Common Superstring and Restricted Common Supersequence. CPM 2011: 467-478- [c9]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted Shortest Common Supersequence. SPIRE 2011: 44-54 - 2010
- [j2]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. J. Discrete Algorithms 8(3): 273-281 (2010) - [c8]Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein:
Restricted LCS. SPIRE 2010: 250-257 - [c7]Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
On Shortest Common Superstring and Swap Permutations. SPIRE 2010: 270-278 - [i1]Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
Permuted Common Supersequence. CoRR abs/1004.0424 (2010)
2000 – 2009
- 2009
- [j1]Zvi Gotthilf, Moshe Lewenstein:
Improved algorithms for the k simple shortest paths and the replacement paths problems. Inf. Process. Lett. 109(7): 352-355 (2009) - [c6]Amihood Amir, Zvi Gotthilf, B. Riva Shalom:
Weighted LCS. IWOCA 2009: 36-47 - [c5]Zvi Gotthilf, Moshe Lewenstein:
Improved Approximation Results on the Shortest Common Supersequence Problem. SPIRE 2009: 277-284 - 2008
- [c4]Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein:
Constrained LCS: Hardness and Approximation. CPM 2008: 255-262 - [c3]Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt:
A Approximation Algorithm for the Minimum Maximal Matching Problem. WAOA 2008: 267-278 - 2007
- [c2]Zvi Gotthilf, Moshe Lewenstein:
Approximating Constrained LCS. SPIRE 2007: 164-172 - 2005
- [c1]Zvi Gotthilf, Moshe Lewenstein:
Tighter Approximations for Maximum Induced Matchings in Regular Graphs. WAOA 2005: 270-281
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 2024-04-24 23:10 CEST 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:
