Parallel algorithms for ranking of trees. - Y. Daniel Liang; Sudarshan K. Dhall; S. Lakshmivarahan (SPDP, 1990)

Efficient parallel algorithms for finding biconnected components of some intersection graphs. - Y. Daniel Liang; Sudarshan K. Dhall; Sivaramakrishnan Lakshmivarahan (ACM Conference on Computer Science, 1991)

A New Approach for the Domination Problem on Permutation Graphs. - Y. Daniel Liang; Chong Jye Rhee; Sudarshan K. Dhall; S. Lakshmivarahan (Inf. Process. Lett., 1991)

NC algorithms for dominations in permutation graphs. - Y. Daniel Liang; Chong Jye Rhee; Sudarshan K. Dhall; S. Lakshmivarahan (SAC, 1992)

An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. - Y. Daniel Liang; Glenn K. Manacher (ACM Conference on Computer Science, 1993)

Finding a Maximum Matching in a Circular-Arc Graph. - Y. Daniel Liang; Chongkye Rhee (Inf. Process. Lett., 1993)

Linear Algorithms for Two Independent Set Problems in Permutation Graphs. - Y. Daniel Liang; Chongkye Rhee (ACM Conference on Computer Science, 1994)

NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). - Y. Daniel Liang; Raymond Greenlaw; Glenn K. Manacher (Canada-France Conference on Parallel and Distributed Computing, 1994)

On the Feedback Vertex Set Problem in Permutation Graphs. - Y. Daniel Liang (Inf. Process. Lett., 1994)

Dominations in Trapezoid Graphs. - Y. Daniel Liang (Inf. Process. Lett., 1994)

Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs. - Chong Jye Rhee; Y. Daniel Liang; Sudarshan K. Dhall; S. Lakshmivarahan (Inf. Process. Lett., 1994)

A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations. - Y. Daniel Liang; Sudarshan K. Dhall; S. Lakshmivarahan (Inf. Sci., 1994)

An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. - Y. Daniel Liang; Chongkye Rhee (ACM Conference on Computer Science, 1995)

Teaching dynamic programming techniques using permutation graphs. - Y. Daniel Liang (SIGCSE, 1995)

Finding a Maximum Matching in a Permutation Graph. - Chongkye Rhee; Y. Daniel Liang (Acta Informatica, 1995)

Steiner Set and Connected Domination in Trapezoid Graphs. - Y. Daniel Liang (Inf. Process. Lett., 1995)

Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. - Y. Daniel Liang; Norbert Blum (Inf. Process. Lett., 1995)

Finding Biconnected Components in O(n) Time for a Class of Graphs. - Y. Daniel Liang; Chongkye Rhee (Inf. Process. Lett., 1996)

An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. - Chongkye Rhee; Y. Daniel Liang (Inf. Process. Lett., 1996)

An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph. - Chong Jye Rhee; Y. Daniel Liang; Sudarshan K. Dhall; S. Lakshmivarahan (SIAM J. Comput., 1996)

Effincient Domination of Permutation Graphs and Trapezoid Graphs. - Y. Daniel Liang; Chin Lung Lu; Chuan Yi Tang (COCOON, 1997)

Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs. - Y. Daniel Liang; Maw-Shang Chang (Acta Informatica, 1997)

Parallel Algorithms for the Domination Problems in Trapezoid Graphs. - Y. Daniel Liang (Discret. Appl. Math., 1997)

Object-Oriented Programming. - Raymond Greenlaw; Y. Daniel Liang (Encyclopedia of Information Systems, 2002)

Undergraduate computer graphics using Java 3D. - Hong Zhang 051; Y. Daniel Liang (ACM Southeast Regional Conference (1), 2005)

JavaFX tutorial: tutorial presentation. - Y. Daniel Liang (J. Comput. Sci. Coll., 2016)

Using animations to teach string matching effectively. - Y. Daniel Liang; Lixin Li; Weitian Tong (J. Comput. Sci. Coll., 2020)

Visualizing recursion using code and stack animation. - Y. Daniel Liang; Jireh Bethely; Gursimran Singh Walia (J. Comput. Sci. Coll., 2021)

Design and Implementation of an Automatic Word Match Generator. - E. Miles Gertis; Y. Daniel Liang (FTC (3), 2022)