Y. Daniel Liang

According to our database1, Y. Daniel Liang
  • authored at least 24 papers between 1990 and 2005.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2005
Undergraduate computer graphics using Java 3D.
Proceedings of the 43nd Annual Southeast Regional Conference, 2005

1997
Parallel Algorithms for the Domination Problems in Trapezoid Graphs.
Discrete Applied Mathematics, 1997

Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs.
Acta Inf., 1997

Effincient Domination of Permutation Graphs and Trapezoid Graphs.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph.
SIAM J. Comput., 1996

An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application.
Inf. Process. Lett., 1996

Finding Biconnected Components in O(n) Time for a Class of Graphs.
Inf. Process. Lett., 1996

1995
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits.
Inf. Process. Lett., 1995

Steiner Set and Connected Domination in Trapezoid Graphs.
Inf. Process. Lett., 1995

Finding a Maximum Matching in a Permutation Graph.
Acta Inf., 1995

Teaching dynamic programming techniques using permutation graphs.
Proceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, 1995

An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs.
Proceedings of the 1995 ACM 23rd Annual Conference on Computer Science, CSC '95, Nashville, TN, USA, February 28, 1995

1994
A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations.
Inf. Sci., 1994

Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.
Inf. Process. Lett., 1994

Dominations in Trapezoid Graphs.
Inf. Process. Lett., 1994

On the Feedback Vertex Set Problem in Permutation Graphs.
Inf. Process. Lett., 1994

NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract).
Proceedings of the Parallel and Distributed Computing, 1994

Linear Algorithms for Two Independent Set Problems in Permutation Graphs.
Proceedings of the ACM 22rd Annual Computer Science Conference on Scaling up: Meeting the Challenge of Complexity in Real-World Computing Applications, 1994

1993
Finding a Maximum Matching in a Circular-Arc Graph.
Inf. Process. Lett., 1993

An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs.
Proceedings of the ACM 21th Conference on Computer Science, 1993

1992
NC algorithms for dominations in permutation graphs.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

1991
A New Approach for the Domination Problem on Permutation Graphs.
Inf. Process. Lett., 1991

Efficient parallel algorithms for finding biconnected components of some intersection graphs.
Proceedings of the 19th annual conference on Computer Science, 1991

1990
Parallel algorithms for ranking of trees.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990


  Loading...