Y. Daniel Liang - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2022

Design and Implementation of an Automatic Word Match GeneratorE. Miles Gertis, Y. Daniel Liang. ftc 2023: 752-765 [doi]

2021

Visualizing recursion using code and stack animationY. Daniel Liang, Jireh Bethely, Gursimran Singh Walia. jcscoll, 37(4):41-49, 2021. [doi]

2020

Using animations to teach string matching effectivelyY. Daniel Liang, Lixin Li, Weitian Tong. jcscoll, 35(10):27-32, 2020. [doi]

2016

JavaFX tutorial: tutorial presentationY. Daniel Liang. jcscoll, 32(2):157, 2016. [doi]

2005

Undergraduate computer graphics using Java 3DHong Zhang, Y. Daniel Liang. ACMse 2005: 12-13 [doi]

1997

Effincient Domination of Permutation Graphs and Trapezoid GraphsY. Daniel Liang, Chin Lung Lu, Chuan Yi Tang. cocoon 1997: 232-241

Minimum Feedback Vertex Sets in Comparability Graphs and Convex Bipartite GraphsY. Daniel Liang, Maw-Shang Chang. ACTA, 34(5):337-346, 1997.

Parallel Algorithms for the Domination Problems in Trapezoid GraphsY. Daniel Liang. DAM, 74(3):241-249, 1997. [doi]

1996

Finding Biconnected Components in O(n) Time for a Class of GraphsY. Daniel Liang, Chongkye Rhee. ipl, 60(3):159-163, 1996. [doi]

An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its ApplicationChongkye Rhee, Y. Daniel Liang. ipl, 57(5):287-290, 1996. [doi]

An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation GraphChong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan. SICOMP, 25(2):404-419, 1996.

1995

1994

NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract)Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher. cfcp 1994: 45-57

Linear Algorithms for Two Independent Set Problems in Permutation GraphsY. Daniel Liang, Chongkye Rhee. acm 1994: 90-93 [doi]

Dominations in Trapezoid GraphsY. Daniel Liang. ipl, 52(6):309-315, 1994.

On the Feedback Vertex Set Problem in Permutation GraphsY. Daniel Liang. ipl, 52(3):123-129, 1994.

A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector OperationsY. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan. isci, 76(3-4):177-195, 1994.

Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation GraphsChong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan. ipl, 49(1):45-50, 1994.

1993

An ::::O(n::::log::::n):::: Algorithm for Finding Minimal Path Cover in Circular-Arc GraphsY. Daniel Liang, Glenn K. Manacher. acm 1993: 390-397 [doi]

Finding a Maximum Matching in a Circular-Arc GraphY. Daniel Liang, Chongkye Rhee. ipl, 45(4):185-190, 1993.

1992

NC algorithms for dominations in permutation graphsY. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan. SAC 1992: 734-739 [doi]

1991

Efficient parallel algorithms for finding biconnected components of some intersection graphsY. Daniel Liang, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan. acm 1991: 48-52 [doi]

A New Approach for the Domination Problem on Permutation GraphsY. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan. ipl, 37(4):219-224, 1991.

1990

Parallel algorithms for ranking of treesY. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan. spdp 1990: 26-31 [doi]

Sign in or sign up to see more results.

runs on WebDSL