dblp.uni-trier.dewww.uni-trier.de

Y. Daniel Liang

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2005
22EEHong Zhang, Y. Daniel Liang: Undergraduate computer graphics using Java 3D. ACM Southeast Regional Conference (1) 2005: 12-13
1997
21 Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang: Effincient Domination of Permutation Graphs and Trapezoid Graphs. COCOON 1997: 232-241
20 Y. Daniel Liang, Maw-Shang Chang: Minimum Feedback Vertex Sets in Comparability Graphs and Convex Bipartite Graphs. Acta Inf. 34(5): 337-346 (1997)
19EEY. Daniel Liang: Parallel Algorithms for the Domination Problems in Trapezoid Graphs. Discrete Applied Mathematics 74(3): 241-249 (1997)
1996
18EEChongkye Rhee, Y. Daniel Liang: An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. Inf. Process. Lett. 57(5): 287-290 (1996)
17EEY. Daniel Liang, Chongkye Rhee: Finding Biconnected Components in O(n) Time for a Class of Graphs. Inf. Process. Lett. 60(3): 159-163 (1996)
16 Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan: An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph. SIAM J. Comput. 25(2): 404-419 (1996)
1995
15EEY. Daniel Liang, Chongkye Rhee: An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. ACM Conference on Computer Science 1995: 104-108
14EEY. Daniel Liang: Teaching dynamic programming techniques using permutation graphs. SIGCSE 1995: 56-60
13 Chongkye Rhee, Y. Daniel Liang: Finding a Maximum Matching in a Permutation Graph Acta Inf. 32(8): 779-792 (1995)
12EEY. Daniel Liang: Steiner Set and Connected Domination in Trapezoid Graphs. Inf. Process. Lett. 56(2): 101-108 (1995)
11EEY. Daniel Liang, Norbert Blum: Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. Inf. Process. Lett. 56(4): 215-219 (1995)
1994
10EEY. Daniel Liang, Chongkye Rhee: Linear Algorithms for Two Independent Set Problems in Permutation Graphs. ACM Conference on Computer Science 1994: 90-93
9 Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher: NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing 1994: 45-57
8 Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan: Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs. Inf. Process. Lett. 49(1): 45-50 (1994)
7 Y. Daniel Liang: On the Feedback Vertex Set Problem in Permutation Graphs. Inf. Process. Lett. 52(3): 123-129 (1994)
6 Y. Daniel Liang: Dominations in Trapezoid Graphs. Inf. Process. Lett. 52(6): 309-315 (1994)
5 Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan: A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations. Inf. Sci. 76(3-4): 177-195 (1994)
1993
4EEY. Daniel Liang, Glenn K. Manacher: An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. ACM Conference on Computer Science 1993: 390-397
3 Y. Daniel Liang, Chongkye Rhee: Finding a Maximum Matching in a Circular-Arc Graph. Inf. Process. Lett. 45(4): 185-190 (1993)
1991
2 Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan: A New Approach for the Domination Problem on Permutation Graphs. Inf. Process. Lett. 37(4): 219-224 (1991)
1990
1EEY. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan: Parallel algorithms for ranking of trees. SPDP 1990: 26-31

Coauthor Index

1Norbert Blum [11]
2Maw-Shang Chang [20]
3Sudarshan K. Dhall [1] [2] [5] [8] [16]
4Raymond Greenlaw [9]
5S. Lakshmivarahan (Sivaramakrishnan Lakshmivarahan) [1] [2] [5] [8] [16]
6Chin Lung Lu [21]
7Glenn K. Manacher [4] [9]
8Chong Jye Rhee [2] [8] [16]
9Chongkye Rhee [3] [10] [13] [15] [17] [18]
10Chuan Yi Tang [21]
11Hong Zhang [22]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)