Lin Chen

According to our database, Lin Chen authored at least 27 papers between 1989 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2000

A selected tour of the theory of identification matrices.

Lin Chen

Theor. Comput. Sci., 2000

1999

Provably Fastest Parallel Algorithms for Bipartite Permutation Graphs.

Lin Chen, Julius Y. Jiang, Maung T. Nyeu

Parallel Process. Lett., 1999

On the Power of some Pram Models.

Selim G. Akl, Lin Chen

Parallel Algorithms Appl., 1999

Graph Isomorphism and Identification Matrices: Sequential Algorithms.

Lin Chen

J. Comput. Syst. Sci., 1999

1998

Optimal Circular Arc Representations: Properties, Recognition, and Construction.

Lin Chen

J. Comput. Syst. Sci., 1998

1997

Optimal Bucket Sorting and Overlap Representations.

Lin Chen

Parallel Algorithms Appl., 1997

Efficient Parallel Recognition of Some Circular Arc Graphs, II.

Lin Chen

Algorithmica, 1997

Tight Lower Bounds for Computing Shortest Paths on Proper Interval and Bipartite Permutation Graphs.

Lin Chen

Proceedings of the Parallel Computing Technologies, 1997

Optimal Computation of Shortest Paths on Doubly Convex Bipartite Graphs.

Lin Chen

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

A Provably Fastest Parallel Algorithm for the Recognition of the Consecutive Ones Property with Selected Applications.

Lin Chen

Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS '97), 1997

1996

Graph Isomorphism and Identification Matrices: Parallel Algorithms.

Lin Chen

IEEE Trans. Parallel Distributed Syst., 1996

Partitioning Graphs Into Hamiltonian Ones.

Lin Chen

Parallel Comput., 1996

Improving Space Efficiency for a Family of Operations.

Lin Chen

Inf. Sci., 1996

Optimal Operations on Red-Black Trees.

Lin Chen, René Schott

Int. J. Found. Comput. Sci., 1996

Optimal overlap representations.

Lin Chen

Proceedings of the 1996 International Symposium on Parallel Architectures, 1996

1995

Solving the Shortest-Paths Problem on Bipartite Permutation Graphs Efficiently.

Lin Chen

Inf. Process. Lett., 1995

Efficient Parallel Algorithms on Proper Circular Arc Graphs.

Selim G. Akl, Lin Chen

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1995

Optimal Circular Arc Representations.

Lin Chen

Proceedings of the Euro-Par '95 Parallel Processing, 1995

1994

Parallel graph isomorphism detection with identification matrices.

Lin Chen

Proceedings of the International Symposium on Parallel Architectures, 1994

Revisiting Circular Arc Graphs.

Lin Chen

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

Efficient parallel algorithms for bipartite permutation graphs.

Lin Chen, Yaacov Yesha

Networks, 1993

Efficient Parallel Recognition of Some Circular Arc Graphs, I.

Lin Chen

Algorithmica, 1993

1992

Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals.

Lin Chen

Inf. Process. Lett., 1992

1991

Parallel Recognition of the Consecutive Ones Property with Applications.

Lin Chen, Yaacov Yesha

J. Algorithms, 1991

Logarithmic Time NC Algorithms for Comparability Graphs and Circle Graphs.

Lin Chen

Proceedings of the Advances in Computing and Information, 1991

1990

Efficient Deterministic Parallel Algorithms for Integer Sorting.

Lin Chen

Proceedings of the Advances in Computing and Information, 1990

1989

NC Algorithms for Circular-Arc Graphs.

Lin Chen

Proceedings of the Algorithms and Data Structures, 1989