NC Algorithms for Circular-Arc Graphs. - Lin Chen 001 (WADS, 1989)

Efficient Deterministic Parallel Algorithms for Integer Sorting. - Lin Chen 001 (ICCI, 1990)

Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs. - Lin Chen 001 (ICCI, 1991)

Parallel Recognition of the Consecutive Ones Property with Applications. - Lin Chen 001; Yaacov Yesha (J. Algorithms, 1991)

Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals. - Lin Chen 001 (Inf. Process. Lett., 1992)

Efficient Parallel Recognition of Some Circular Arc Graphs, I. - Lin Chen 001 (Algorithmica, 1993)

Efficient parallel algorithms for bipartite permutation graphs. - Lin Chen 001; Yaacov Yesha (Networks, 1993)

Revisiting Circular Arc Graphs. - Lin Chen 001 (ISAAC, 1994)

Parallel graph isomorphism detection with identification matrices. - Lin Chen 001 (ISPAN, 1994)

Optimal Circular Arc Representations. - Lin Chen 001 (Euro-Par, 1995)

Efficient Parallel Algorithms on Proper Circular Arc Graphs. - Selim G. Akl; Lin Chen 001 (PDPTA, 1995)

Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently. - Lin Chen 001 (Inf. Process. Lett., 1995)

Optimal overlap representations. - Lin Chen 001 (ISPAN, 1996)

Optimal Operations on Red-Black Trees. - Lin Chen 001; René Schott (Int. J. Found. Comput. Sci., 1996)

Improving Space Efficiency for a Family of Operations. - Lin Chen 001 (Inf. Sci., 1996)

Partitioning Graphs Into Hamiltonian Ones. - Lin Chen 001 (Parallel Comput., 1996)

Graph Isomorphism and Identification Matrices: Parallel Algorithms. - Lin Chen 001 (IEEE Trans. Parallel Distributed Syst., 1996)

A Provably Fastest Parallel Algorithm for the Recognition of the Consecutive Ones Property with Selected Applications. - Lin Chen 001 (ICPADS, 1997)

Optimal Computation of Shortest Paths on Doubly Convex Bipartite Graphs. - Lin Chen 001 (ICPADS, 1997)

Tight Lower Bounds for Computing Shortest Paths on Proper Interval and Bipartite Permutation Graphs. - Lin Chen 001 (PaCT, 1997)

Efficient Parallel Recognition of Some Circular Arc Graphs, II. - Lin Chen 001 (Algorithmica, 1997)

Optimal Bucket Sorting and Overlap Representations. - Lin Chen 001 (Parallel Algorithms Appl., 1997)

Optimal Circular Arc Representations: Properties, Recognition, and Construction. - Lin Chen 001 (J. Comput. Syst. Sci., 1998)

Graph Isomorphism and Identification Matrices: Sequential Algorithms. - Lin Chen 001 (J. Comput. Syst. Sci., 1999)

On the Power of some Pram Models. - Selim G. Akl; Lin Chen 001 (Parallel Algorithms Appl., 1999)

Provably Fastest Parallel Algorithms for Bipartite Permutation Graphs. - Lin Chen 001; Julius Y. Jiang; Maung T. Nyeu (Parallel Process. Lett., 1999)

A selected tour of the theory of identification matrices. - Lin Chen 001 (Theor. Comput. Sci., 2000)