#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1993

2019

- This year (1)
- Last 5 years (34)
- Last 10 years (66)

#### Supplemental Content

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Amihood Amir, Moshe Lewenstein, Ely Porat
- SODA
- 2000

The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length m and every length m substring of the text T. Currently, the fastest algorithms… (More)

- Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein
- STOC
- 2004

This paper considers various flavors of the following online problem: preprocess a text or collection of strings, so that given a query string p, all matches of p with the text can be reported… (More)

- Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
- J. ACM
- 2005

A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall's theorem, one can represent such a multigraph as a combination of at most n2 cycle… (More)

- Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein
- Algorithmica
- 2001

Abstract. A matching in a graph is a set of edges no two of which share a common vertex. In this paper we introduce a new, specialized type of matching which we call uniquely restricted matchings,… (More)

- Martin Charles Golumbic, Moshe Lewenstein
- Discrete Applied Mathematics
- 2000

A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced… (More)

- Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
- Proceedings 38th Annual Symposium on Foundations…
- 1997

Let a text string T of n symbols and a pattern string P of m symbols from alphabet /spl Sigma/ be given. A swapped version T' of T is a length n string derived from T by a series of local swaps,… (More)

Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more then one interval associated with it. We initiate the study of optimization problems in… (More)

- Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
- J. Algorithms
- 2000

The indexing problem is where a text is preprocessed and subsequent queries of the form “Find all occurrences of pattern P in the text” are answered in time proportional to the length of the query… (More)

- Zvi Gotthilf, Moshe Lewenstein
- Inf. Process. Lett.
- 2009

Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k… (More)

- Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
- ICALP
- 2003

We introduce a new matching criterion - function matching - that captures several different applications. The function matching problem has as its input a text T of length n over alphabet ΣT and a… (More)