Y. Daniel Liang

Publication Activity (10 Years)

Years Active: 1990-2022
Publications (10 Years): 1

Top Topics

Detailed Design

Architectural Design

Top Venues

Publications

E. Miles Gertis, Y. Daniel Liang
Design and Implementation of an Automatic Word Match Generator. FTC (3) (2022)
Hong Zhang, Y. Daniel Liang
Undergraduate computer graphics using Java 3D. ACM Southeast Regional Conference (1) (2005)
Y. Daniel Liang, Maw-Shang Chang
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs. Acta Informatica 34 (5) (1997)
Y. Daniel Liang
Parallel Algorithms for the Domination Problems in Trapezoid Graphs. Discret. Appl. Math. 74 (3) (1997)
Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang
Effincient Domination of Permutation Graphs and Trapezoid Graphs. COCOON (1997)
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) (1996)
Chongkye Rhee, Y. Daniel Liang
An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. Inf. Process. Lett. 57 (5) (1996)
Y. Daniel Liang, Chongkye Rhee
Finding Biconnected Components in O(n) Time for a Class of Graphs. Inf. Process. Lett. 60 (3) (1996)
Chongkye Rhee, Y. Daniel Liang
Finding a Maximum Matching in a Permutation Graph. Acta Informatica 32 (8) (1995)
Y. Daniel Liang, Norbert Blum
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. Inf. Process. Lett. 56 (4) (1995)
Y. Daniel Liang
Teaching dynamic programming techniques using permutation graphs. SIGCSE (1995)
Y. Daniel Liang, Chongkye Rhee
An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. ACM Conference on Computer Science (1995)
Y. Daniel Liang
Steiner Set and Connected Domination in Trapezoid Graphs. Inf. Process. Lett. 56 (2) (1995)
Y. Daniel Liang, Chongkye Rhee
Linear Algorithms for Two Independent Set Problems in Permutation Graphs. ACM Conference on Computer Science (1994)
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) (1994)
Y. Daniel Liang
Dominations in Trapezoid Graphs. Inf. Process. Lett. 52 (6) (1994)
Y. Daniel Liang
On the Feedback Vertex Set Problem in Permutation Graphs. Inf. Process. Lett. 52 (3) (1994)
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) (1994)
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)
Y. Daniel Liang, Chongkye Rhee
Finding a Maximum Matching in a Circular-Arc Graph. Inf. Process. Lett. 45 (4) (1993)
Y. Daniel Liang, Glenn K. Manacher
Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. ACM Conference on Computer Science (1993)
Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan
NC algorithms for dominations in permutation graphs. SAC (1992)
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) (1991)
Y. Daniel Liang, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan
Efficient parallel algorithms for finding biconnected components of some intersection graphs. ACM Conference on Computer Science (1991)
Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
Parallel algorithms for ranking of trees. SPDP (1990)