#### Filter Results:

- Full text PDF available (0)

#### Publication Year

1990

1993

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ruey-Der Lou, Majid Sarrafzadeh, Charles Tzu-Chi Lee
- SODA
- 1990

Given a point set p, a chain is a subset C C p of points in which for any two points one is dominated by the other. A two-chain is a subset of p that can be partitioned into two chains. A two-chain with maximum cardinality among all possible two-chains is called a maximum two-chain. In this paper we present a O(nlog n) time and O(n) space algorithm for… (More)

- Majid Sarrafzadeh, Ruey-Der Lou
- Algorithmica
- 1993

Consider a weighted transitive graph, where each vertex is assigned a positive weight. Given a positive integerk, the maximumk-covering problem is to findk disjoint cliques covering a set of vertices with maximum total weight. An 0(kn 2)-time algorithm to solve the problem in a transitive graph is proposed, wheren is the number of vertices. Based on the… (More)

- Ruey-Der Lou, Majid Sarrafzadeh
- SIAM J. Comput.
- 1993

Given a two-dimensional point set p, a chain C is a subset of p in which for every two points one is dominated by the other. A k-chain is a subset of p that can be partitioned into k-chains. The size of a k-chain is the total number of its points. A k-chain with maximum size, among all possible k-chains, is called a maximum k-chain. First geometric… (More)

- Ruey-Der Lou, Majid Sarrafzadeh
- Discrete Applied Mathematics
- 1992

- Ruey-Der Lou, Kuo-Feng Liao, Majid Sarrafzadeh
- Journal of Circuits, Systems, and Computers
- 1992

- Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda
- Mathematical systems theory
- 1992

In thegeneral circular permutation layout problem there are two concentric circles,C in andC out. There are a set ofn inner terminals onC in and a set ofn outer terminals onC out: terminalsi onC in and π i onC out are to be connected by means of a wire, where 1 ≤i ≤n. All wires must be realized in the interior ofC out. Each wire can intersectC in at most… (More)

- ‹
- 1
- ›