#### Filter Results:

- Full text PDF available (71)

#### Publication Year

1985

2018

- This year (4)
- Last 5 years (8)
- Last 10 years (34)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sudipto Das, Ömer Egecioglu, Amr El Abbadi
- 2010 IEEE 26th International Conference on Data…
- 2010

The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understanding of… (More)

- Ömer Egecioglu, Jeffrey B. Remmel
- J. Comb. Theory, Ser. A
- 1986

We construct a family of extremely simple bijections that yield Cayley’s famous formula for counting trees. The weight preserving properties of these bijections furnish a number of multivariate… (More)

- Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
- 2007 IEEE 23rd International Conference on Data…
- 2007

This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline query computation, an… (More)

- Abdullah N. Arslan, Ömer Egecioglu
- Stringology
- 2004

Given strings S1, S2, and P , the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 such that P is a subsequence… (More)

- Ömer Egecioglu, Teofilo F. Gonzalez
- Comput. Geom.
- 1996

We analyze the problem of computing the minimum number er(C) of internal simplexes that need to be removed from a simplicial 2-complex C so that the remaining complex can be nulled by deleting a… (More)

- Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner
- RECOMB
- 2001

The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach was designed to… (More)

- Ömer Egecioglu, Bahman Kalantari
- Inf. Process. Lett.
- 1989

Given a set P with n points in R , its diameter, dP , is the maximum of the Euclidean distances between its points. We describe an algorithm that in m ≤ n iterations obtains r1 < r2 < . . . < rm ≤ dP… (More)

- Ömer Egecioglu, Jeffrey B. Remmel
- Discrete Applied Mathematics
- 1991

Egecioglu, ii. and J.B. Remmel, Brick tabloids and the connection matrices between bases of symmetric functions, Discrete Applied Mathematics 34 (1991) 107-120. Let H, denote the space of symmetric… (More)

- Ömer Egecioglu, Ambuj K. Singh
- Distributed Computing
- 1994

Implementations of inter-process communication and synchronization in distributed systems usually rely on the existence of unique ids for the processes. We consider the problem of generating such ids… (More)

- James Abello, Ömer Egecioglu, Krishna Kumar
- Discrete & Computational Geometry
- 1995

The recognition problem for visibility graphs of simple polygons is not known to be in NP, nor is it known to be NP-hard. It is, however, known to be in PSPACE. Further, every such visibility graph… (More)