Y. Daniel Liang

29 papers A 1Misc 2Journal 17Unranked 8
YearRankTypeTitle / Venue / Authors
2022 — conf
Design and Implementation of an Automatic Word Match Generator.
FTC (3)
E. Miles Gertis, Y. Daniel Liang
2021 J jnl
Visualizing recursion using code and stack animation.
J. Comput. Sci. Coll.
Y. Daniel Liang, Jireh Bethely, Gursimran Singh Walia
2020 J jnl
Using animations to teach string matching effectively.
J. Comput. Sci. Coll.
Y. Daniel Liang, Lixin Li, Weitian Tong
2016 J jnl
JavaFX tutorial: tutorial presentation.
J. Comput. Sci. Coll.
Y. Daniel Liang
2005 — conf
Undergraduate computer graphics using Java 3D.
ACM Southeast Regional Conference (1)
Hong Zhang, Y. Daniel Liang
2002 — ch.
Object-Oriented Programming.
Encyclopedia of Information Systems
Raymond Greenlaw, Y. Daniel Liang
1997 Misc conf
Effincient Domination of Permutation Graphs and Trapezoid Graphs.
COCOON
Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang
1997 J jnl
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs.
Acta Informatica
Y. Daniel Liang, Maw-Shang Chang
1997 J jnl
Parallel Algorithms for the Domination Problems in Trapezoid Graphs.
Discret. Appl. Math.
Y. Daniel Liang
1996 J jnl
An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application.
Inf. Process. Lett.
Chongkye Rhee, Y. Daniel Liang
1996 J jnl
An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph.
SIAM J. Comput.
Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
1996 J jnl
Finding Biconnected Components in O(n) Time for a Class of Graphs.
Inf. Process. Lett.
Y. Daniel Liang, Chongkye Rhee
1995 — conf
An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs.
ACM Conference on Computer Science
Y. Daniel Liang, Chongkye Rhee
1995 J jnl
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits.
Inf. Process. Lett.
Y. Daniel Liang, Norbert Blum
1995 J jnl
Finding a Maximum Matching in a Permutation Graph.
Acta Informatica
Chongkye Rhee, Y. Daniel Liang
1995 J jnl
Steiner Set and Connected Domination in Trapezoid Graphs.
Inf. Process. Lett.
Y. Daniel Liang
1995 A conf
Teaching dynamic programming techniques using permutation graphs.
SIGCSE
Y. Daniel Liang
1994 J jnl
A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations.
Inf. Sci.
Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
1994 J jnl
Dominations in Trapezoid Graphs.
Inf. Process. Lett.
Y. Daniel Liang
1994 J jnl
Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.
Inf. Process. Lett.
Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
1994 — conf
Linear Algorithms for Two Independent Set Problems in Permutation Graphs.
ACM Conference on Computer Science
Y. Daniel Liang, Chongkye Rhee
1994 — conf
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract).
Canada-France Conference on Parallel and Distributed Computing
Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher
1994 J jnl
On the Feedback Vertex Set Problem in Permutation Graphs.
Inf. Process. Lett.
Y. Daniel Liang
1993 — conf
An
ACM Conference on Computer Science
Y. Daniel Liang, Glenn K. Manacher
1993 J jnl
Finding a Maximum Matching in a Circular-Arc Graph.
Inf. Process. Lett.
Y. Daniel Liang, Chongkye Rhee
1992 Misc conf
NC algorithms for dominations in permutation graphs.
SAC
Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan
1991 J jnl
A New Approach for the Domination Problem on Permutation Graphs.
Inf. Process. Lett.
Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan
1991 — conf
Efficient parallel algorithms for finding biconnected components of some intersection graphs.
ACM Conference on Computer Science
Y. Daniel Liang, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan
1990 — conf
Parallel algorithms for ranking of trees.
SPDP
Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan